Subject: CGAL users discussion list
List archive
- From: chrism <>
- To:
- Subject: [cgal-discuss] Triangulation_data_structure_2 dD spatial searching
- Date: Mon, 27 Jun 2016 09:57:56 -0700 (PDT)
- Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=SoftFail ; spf=None
- Ironport-phdr: 9a23:xrgL2xbXnqUwLN+tv7DzW/D/LSx+4OfEezUN459isYplN5qZpci8bnLW6fgltlLVR4KTs6sC0LuO9fm5EjVYsd6oizMrSNR0TRgLiMEbzUQLIfWuLgnFFsPsdDEwB89YVVVorDmROElRH9viNRWJ+iXhpQAbFhi3DwdpPOO9QteU1JXvkbnrsMSLM01hv3mUWftKNhK4rAHc5IE9oLBJDeIP8CbPuWZCYO9MxGlldhq5lhf44dqsrtY4q3wD88QIrJARFPyiN+RjFeQZX3waNDU+68Tv8BXCVgCS/WA0U2MMkxMODRKWwgv9W8L6sjH7re81jCKaJ8ztC7U9Qy+ix7pwQQTrziwOYW1quFrLg9B92fsI6CmqoAZyltWMOIw=
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.
- [cgal-discuss] Triangulation_data_structure_2 dD spatial searching, chrism, 06/27/2016
Archive powered by MHonArc 2.6.18.