smart people, help a less smart one out: I'm faced with a problem similar to the seven circles theorem (http://mathworld.wolfram.com/SevenCirclesTheorem.html) in that i need to arrange x number of circles along a circular path, making sure they all touch their two neighbors. In this way, the path's radius is NOT given, but is rather made up from the sum of all the circles' diametres.
I've boiled the problem down to this: I have a line of x length with y number of segments of nonuniform length. I know the final length of the line because i know the length of each individual segment. Now, i need to "bend" this line so that the end of the final segment touches on the beginning of the first one. As such, each segment must be given an angle somehow based on the overall amount of segments and their individual lengths. Beyond this, i'm stumped. I've been pouring over mathworld and google looking for such bendyness, and i've come up empty handed. Anyone have suggestions, possible solutions? Thanks, - A _______________________________________________ [email protected] To change your subscription options or search the archive: http://chattyfig.figleaf.com/mailman/listinfo/flashcoders Brought to you by Fig Leaf Software Premier Authorized Adobe Consulting and Training http://www.figleaf.com http://training.figleaf.com
