CGAL users discussion list

[Issha Kayo <>]

Hello Sebastien,

Thank you for the code!
Really a good idea and it works!

Cheers,
Issha

> Issha Kayo wrote:
>> Dear all,
>>
>> I am now looking for a method to insert large number of points
>> efficiently to a 3D Delaunay triangulation.
>>
>> "int dt.insert(InputIterator first, InputIterator last)" is the method
>> but I want to insert points with info. Now I insert one by one by using
>> "Vertex_handle dt.insert(Point)" and assigning the info to the returned
>> Vertex_handle, but it is not efficient.
>>
>> Thank you,
>> Issha Kayo
>>
> Hello,
> 
> You can simply copy-paste the insert(InputIterator first, InputIterator
> last) function to benefit from the efficiency of the spatial sort.
> Since the spatial sort requires your input data to be shuffled you
> should be careful while assigning your info.
> 
> 
> I joined to this email a working example where the info assigned to a
> vertex is the original insertion order.
> 
> 
> Best,
> 
> Sebastien.
> 
> 
> 
> 
> 
>