Subject: CGAL users discussion list
List archive
- From: "Sebastien Loriot (GeometryFactory)" <>
- To:
- Subject: Re: [cgal-discuss] Triangulation_data_structure_2 dD spatial searching
- Date: Fri, 01 Jul 2016 07:38:56 +0200
- Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=Pass ; spf=None
- Ironport-phdr: 9a23:fQkj5hU9FbxHdkBfi3sDWZvXUiXV8LGtZVwlr6E/grcLSJyIuqrYZhOFt8tkgFKBZ4jH8fUM07OQ6PG4HzVQqsfR+Fk5M7V0HycfjssXmwFySOWkMmbcaMDQUiohAc5ZX0Vk9XzoeWJcGcL5ekGA6ibqtW1aJBzzOEJPK/jvHcaK1oLshrj0os2YMlUArQH+SIs6FA+xowTVu5teqqpZAYF19CH0pGBVcf9d32JiKAHbtR/94sCt4MwrqHwI6LoX3pQRDOCiL+x4EOQZX3waNDU+68Tv8BXCVgCS/WA0U2MMkxMODRKWwgv9W8K7iSbwv/Fh2SScdenxV7EzRXziwKpsTRL0kjYpPjUl93vGy4Y42LlfpwigoAA5xor8b4ScNf44daTYK4BJDVFdV9pcAnQSSri3aJECWrdZMA==
- Organization: GeometryFactory
Considering the type of queries you're interested in, I would take the triangle center and find triangles that are within the query distance by iteratively visiting the neighbors of the current triangle.
Sebastien.
On 06/27/2016 06:57 PM, chrism wrote:
I use the Triangulation_data_structure_2 data structure to hold a
triangulation that I create outside of CGAL. I would like to use the
algorithms in dD spatial search to provide fast queries. The types of
queries I'm interested in are, for example, which triangles are at distance
X from a current triangle center.
It's unclear to be how to use dD to do this. Is dD inappropriate for this? I
would appreciate any guidance.
--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Triangulation-data-structure-2-dD-spatial-searching-tp4662015.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.