Millie Niss wrote:
I found a useful segment intersection algorithm in the book
_Computational Geometry: Algorithms and Applications_, by Mark de Berg
http://www.amazon.com/Computational-Geometry-Algorithms-Applications-Second/dp/3540656200/ref=pd_ys_qtk_rvi_img/102-1020427-4119337
The algorithm is quite understandable and efficient. It does use
binary trees, so I have to code a binary tree class before I can
implement the algorithm.
Haven't read it, but this book has a good reputation. If memory serves,
it's a sweep line algorithm which uses a priority queue -- you can get
an AS 2 version from Arul's blog --
http://www.shockwave-india.com/blog/actionscript2/?asfile=PriorityQueue.as .
good luck and enjoy the book!
- jim
--
Singularity >> Flash :: Flex :: Math :: www.2112fx.com/blog
TechNotes >> Computational Geometry :: www.2112fx.com/technotes.html
_______________________________________________
[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
