Subject: CGAL users discussion list
List archive
- From: Samuel Hornus <>
- To:
- Cc: Michael Klatt <>, Clément Jamin <>, Olivier Devillers <>, Monique Teillaud <>
- Subject: Re: [cgal-discuss] Maximum Distance from Bounding Volume Calculation
- Date: Fri, 6 Nov 2015 10:49:14 +0100
On Nov6, 2015, at 09:49 , Monique Teillaud
<>
wrote:
>
> I was wondering about the following: Is there in the dD package a function
> that returns the conflicts of a new point, before inserting it?
Yes it is possible, there is also an example in the documentation that does
just that:
http://doc.cgal.org/latest/Triangulation/index.html#title20
> Then it would be possible to avoid inserting a new point if it is not going
> to be on the convex hull. It would keep the triangulation smaller, so
> lighter in memory, and faster.
>
> BTW, we could keep this thread on the cgal-discuss list (Samuel, you are
> subscribed, right?)
Sure.
—
Sam
> […]
> Best,
> Monique
>
> Le 05/11/15 20:08, Samuel Hornus a écrit :
>>
>> Hello Michael,
>> The dD Triangulation class works in the same way as the 3D one.
>> If your goal is to compute the diameter of the point set, however, then it
>> might be faster to simply test every pairs of points. Delaunay
>> triangulation in dimension > 3 tends to be pretty slow.
>> The convex hull vertices can be traversed as the set of vertices adjacent
>> to the vertex at infinity.
>> The dD Triangulation package documentation has an example that does
>> exactly this.
>> Regards,
>> —
>> samuel
>>
>>> On 4 nov. 2015, at 12:03, Monique Teillaud
>>> <>
>>> wrote:
>>>
>>> -------- Message transféré --------
>>> Sujet : Re: [cgal-discuss] Maximum Distance from Bounding Volume
>>> Calculation
>>> Date : Tue, 3 Nov 2015 11:13:45 -0800 (PST)
>>> De : Michael Klatt
>>> <>
>>> Répondre à :
>>>
>>> Pour :
>>>
>>>
>>> Dear Michael,
>>>
>>> thank you very much for your help. Your solutions works perfectly.
>>> Now, I need to generalize the program to three (and probably even higher)
>>> dimensions.
>>> I have found the package "dD Triangulations", but I am unsure how I can
>>> use
>>> it to only construct the convex hull and determine the largest distance
>>> between two points.
- Re: [cgal-discuss] Maximum Distance from Bounding Volume Calculation, Michael Klatt, 11/03/2015
- Message not available
- Message not available
- Message not available
- Re: [cgal-discuss] Maximum Distance from Bounding Volume Calculation, Samuel Hornus, 11/06/2015
- Message not available
- Message not available
- Message not available
Archive powered by MHonArc 2.6.18.