Subject: CGAL users discussion list
List archive
- From: Sandeep Dey <>
- To:
- Subject: [cgal-discuss] balanced tree...
- Date: Wed, 21 Jul 2010 13:38:22 +0200
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:date:message-id:subject:from:to:content-type; b=wu97TM8hlD/uv+ow8t/pOHhqft9l2dUJN5rvhazlLoGZwxJBS9qBYyNFeRndcHKCrK 5q9QdwX7AuRnRhjYgTXCOhJo8eSuXsL42BaMPpeIEVpPEhdZ8x6PrTggQl258E9/RiM9 XSC02S/F7nM0JnDSjS8SkcTpeafyzkj3cm3xM=
Hi,
Is there a balance tree provided to store segments in 2-D?
The collection of segments is always y-monotone and changing continuously.
And if we shoot a ray and need to find the intersection with the segment stored in the tree, Is there a method provided to determine the intersection of a ray with the balanced tree ?
Thanks and Best Regards,
Sandeep.
- [cgal-discuss] balanced tree..., Sandeep Dey, 07/21/2010
Archive powered by MHonArc 2.6.16.