Subject: CGAL users discussion list
List archive
- From: "Valdes, Julio" <>
- To: "" <>
- Subject: RE: [cgal-discuss] a question about some basic algorithms
- Date: Wed, 30 Oct 2019 17:34:16 +0000
- Accept-language: en-US, en-CA
- Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=Pass ; spf=None
- Ironport-phdr: 9a23:vJpITBJH0uACmzmvb9mcpTZWNBhigK39O0sv0rFitYgfL/vxwZ3uMQTl6Ol3ixeRBMOHsqkC0rKN+Pm4ACQp2tWoiDg6aptCVhsI2409vjcLJ4q7M3D9N+PgdCcgHc5PBxdP9nC/NlVJSo6lPwWB6nK94iQPFRrhKAF7Ovr6GpLIj8Swyuu+54Dfbx9HiTagb75+Ngi6oRnfu8UZnIduNrs9wQbVr3VVfOhb2XlmLk+JkRbm4cew8p9j8yBOtP8k6sVNT6b0cbkmQLJBFDgpPHw768PttRnYUAuA/WAcXXkMkhpJGAfK8hf3VYrsvyTgt+p93C6aPdDqTb0xRD+v4btnRAPuhSwaMTMy7WPZhdFqjK9DoByvuQFxw5Labo+WOvpxfKLdcs8VS2VORctRSzdODp+gY4cTE+YMP+BVpJT9qVsUqhu+ABGhCO3gxTBSgn/5wLM10/85HQrb2AIgAtYOsHXTrNn7KawfVuS7zLTMzTXCaPNawzjy55LMch88v/6MRql9cczLyUYzDg/KklOQqZb5MD+P2eQCr3KX4PZ6Wu+2jWMstg9/oj+qxsg2i4nJgJoYylHC9SVjwYY6P8e0SEBhYdK8DJRQuDuVN49sTsMlWWFotyA3waAFt56jZCUG1ogryh7FZ/Cad4WF7AjvWPiPLTp8nn5pZbyyiwiq/US9y+DxVNO43VhIoyZfndTBtWoB2h/L5sSaS/Zw/F2t1DiN2gzJ6uxJLlo4mbTHJ5MgxLM7i4Advl7ZHiDsnUX7lK+WeVsg+uiv8+nnZ7rnqoWHN49vkA7+NL4ildKwAeQjKwQORHaU+eum2L3s4UL1WqlFgecunqnYtpDVO9gbq7anDwNJ0osv8QuzAjOo3dgCg3ULMlZIdAiag4XnJV3COPX4Au2+g1Sonjdr3ffGPrj5D5vJM3jDlLbhfbFn50FT0gUzyc1Q6IxPCrwaJvLzQFP+uMXEAR8/KQy73/zrCNph2Y8ERW2AGLeVMLnOvl+Q+uIvP+6MaZcJtzbyMfcl4+figmI4mV8GYaapwIAXaGujE/R9I0SZZGLsjc0bHWcLuAo+Vu3qh0eYXT5dfXbhF586/SwxXYK6EZ/YFMfqm62ExC79H5tMZ2kABErLCmbtb4zDWvECb2WZLcZl1zAFTrO8UJRy6Rb7/gT1wr4iIuvP8TADrrri0sJ07qvdj1t6oTd7BsDY32CWRHxvhUsJQSU31eZxuxou5E2E1P0yvfVcGdFIo7trTwM7MtSUm85nD9H1HDzIetuEU36gWN7jCjcrRZQ+yJkFahAuSJ2Zkhnf0n/yUPcunLuRCclsq/OO7z3KP894jk3++uwkhlgiTNFIMDT41Khl/E3YAZTC1UqS0a2jJ/1FgHz9sVybxG/Lh3l2FRZqWPybD3YFbQ7dq87yoEzJCbSnW+x+b1lxjPWaI64PUeXHyFVLQPC5Y4bbcySqgG62QxuH3faXYYWsdG5b1yyPUEU=
Hello Dr. Loriot:
Thank you very much for responding my email and for your valuable suggestions.
I shall follow your indications and see if I could produce an implementation
of the solutions that you provided.
Once again, thank for your time and advice.
Best regards,
jjv
Julio J. Valdés
National Research Council Canada | Conseil
National de Recherches Canada
Digital Technologies Research Centre | Centre
de Recherche en Technologies Numériques
Data Science for Complex Systems Group | Science des
Données pour les Systèmes Complexes
M-50, 1200 Montreal Road, Ottawa, Ontario K1A 0R6 | M-50, 1200 chemin
Montréal, Ottawa, Ontario K1A 0R6
Canada
| Canada
tel/tél: (1)613-993-0257
-----Original Message-----
From:
[mailto:]
On Behalf Of Sebastien Loriot (GeometryFactory)
Sent: Monday, October 28, 2019 5:05 AM
To:
Subject: Re: [cgal-discuss] a question about some basic algorithms
There might be a simpler and smarter way to do it but using the dD
triangulation package:
https://doc.cgal.org/latest/Triangulation
You should be able to know if a point location using the locate function:
https://doc.cgal.org/latest/Triangulation/classCGAL_1_1Triangulation.html#af9ea0ceb6cc5c814e4ed63738396a6b6
For the distance to the convex hull, I would first build the triangulation,
extract the vertices on the convex hull (which are the set of vertices
incident to the infinite vertex) and build a triangulation out of those
vertices.
Then doing locate queries, you will
Access the infinite_vertex() using:
https://doc.cgal.org/latest/Triangulation/classCGAL_1_1Triangulation.html#a44e3585e1b8fa31b718310a3f32a92af
Access dimension 1 incident cells (edges):
https://doc.cgal.org/latest/Triangulation/classTriangulationDataStructure.html#a9700c5ae4a6a2af65b002fb1057d47fa
Use the range of vertices in the cells (vertices_begin(),
vertices_end()) + to get the vertex of the edge that is not the infinite
one:
https://doc.cgal.org/latest/Triangulation/classTriangulationDataStructure_1_1FullCell.html
Note that Delaunay_triangulation inherits from Triangulation, that itself
inherits from the TriangulationDataStructure. The doc of some methods are in
the Triangulation or TriangulationDataStructure doc only.
Sebastien.
On 10/25/19 5:10 PM, Valdes, Julio wrote:
> Dear Sirs:
>
> First of all thank you for the formidable effort that represents the work
> around the CGAL library.
> I am not an expert in computational geometry, but I need to use some basic
> algorithms and I have not been able to find my way through the
> documentation.
> Please excuse me if my questions are too trivial for you.
> The algorithms that I am interested in are related to convex hulls (in d >
> 3 dimensions):
> 1) distance from a point to a convex hull.
> 2) whether a point is inside/outside with respect to a given convex hull.
>
> I would appreciate if you could direct me to the algorithms in CGAL that
> approach the aforementioned problems.
> In case that there would not be available algorithms for the general case,
> references to lower dimension versions would be also helpful.
> Any additional comments that you could provide, given your expertise in the
> domain would be greatly appreciated.
> Sincerely
>
> Julio J. Valdés
> National Research Council Canada |
> Conseil National de Recherches Canada
> Digital Technologies Research Centre | Centre
> de Recherche en Technologies Numériques
> Data Science for Complex Systems Group | Science des
> Données pour les Systèmes Complexes
> M-50, 1200 Montreal Road, Ottawa, Ontario K1A 0R6 | M-50, 1200 chemin
> Montréal, Ottawa, Ontario K1A 0R6
> Canada
> | Canada
>
> tel/tél: (1)613-993-0257
>
--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://sympa.inria.fr/sympa/info/cgal-discuss
- [cgal-discuss] a question about some basic algorithms, Valdes, Julio, 10/25/2019
- Re: [cgal-discuss] a question about some basic algorithms, Sebastien Loriot (GeometryFactory), 10/28/2019
- RE: [cgal-discuss] a question about some basic algorithms, Valdes, Julio, 10/30/2019
- Re: [cgal-discuss] a question about some basic algorithms, Sebastien Loriot (GeometryFactory), 10/28/2019
Archive powered by MHonArc 2.6.18.