CGAL users discussion list

[Steven G <>]

The problem I try to solve with the example code below, is the following:


I have a large number of points (about a million) that shape a volume which,
from theoretical considerations, we know should look like a kinked wire. I
would like to render the surface of this 'object' (which does only exist in
abstraction since we only have a list of points here) using the point
coordinates as input.

Afterwards I also perform some extra operations, for example for a fixed
rectangular grid check which points are inside the surface, and which are
outside. I adapted an example program I found on this forum which solves
this problem starting with a Polyhedron_3.

Since there are a large number of ways to make a surface from a set of
3D-points, my intention was to make a Delaunay triangulation of these
points, then use the facets of this triangulation which are on the 'outside'
(incident to the infinite vertex) and their vertices to construct a
polyhedron from the triangulation. So I do not want to convert the entire
data structure. I thought that by using the Delaunay property, the
polyhedron I construct in this way would be the best approximation to the
shape I have in mind.

It is in this framework that the construction errors occurred.

I am new to cgal, which means that I usually first try working with the data
structures which I think I could manipulate most easily. Most probably my
method is then not the best to solve my problem. Any comments or suggestions
on how I could proceed?

Thank you.
Cheers,
Steven G.



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Construction-errors-using-the-Polyhedron-3-incremental-builder-tp4658678p4658699.html
Sent from the cgal-discuss mailing list archive at Nabble.com.