Subject: CGAL users discussion list
List archive
- From: chrism <>
- To:
- Subject: Re: [cgal-discuss] Triangulation_data_structure_2 dD spatial searching
- Date: Fri, 1 Jul 2016 05:06:05 -0700 (PDT)
- Authentication-results: mail2-smtp-roc.national.inria.fr; spf=None ; spf=SoftFail ; spf=None
- Ironport-phdr: 9a23:7u/14BzdvF3dYu7XCy+O+j09IxM/srCxBDY+r6Qd0egeIJqq85mqBkHD//Il1AaPBtSDrasVwLeO+4nbGkU4qa6bt34DdJEeHzQksu4x2zIaPcieFEfgJ+TrZSFpVO5LVVti4m3peRMNQJW2WVTerzWI4CIIHV2nbEwud7yzQ9+Z0pz//tvx0qWbWx9Piju5bOE6BzSNhiKViPMrh5B/IL060BrDrygAUe1XwWR1OQDbxE6ktY/jtKJkpi9fsvZk+89bWrjhZIw5S6ZZBXIoKTMb/sru4BLDVwqU4zNIWWUMkwEOBgHf9xHSQ4z4qSi8veMri3rSBtH/Ub1hAWfq1KxsUhK90Co=
Thanks for the suggestion.
I would also like to quickly find a triangle that contains an arbitrary
point, which is currently taking me O(N). I had hoped a dD tree would solve
this. How would be best to incorporate the searching of the dD into this
datastructure?
--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Triangulation-data-structure-2-dD-spatial-searching-tp4662015p4662022.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
- Re: [cgal-discuss] Triangulation_data_structure_2 dD spatial searching, Sebastien Loriot (GeometryFactory), 07/01/2016
- Re: [cgal-discuss] Triangulation_data_structure_2 dD spatial searching, chrism, 07/01/2016
Archive powered by MHonArc 2.6.18.