CGAL users discussion list

[colonel_panic <>]

Thank you both for the replies.  My algorithm is similar to that which
produced these results: 
http://www.mage.fst.uha.fr/maillot/recherche/images/LDA.gif

I need to generate a delaunay triangulation from a point set to start with
and then refine it - the outcome could be a more general simplicial comple.
I would like to be able to remove facets though - an example of where this
would be useful would be reconstructing a shape from a point set which has
several holes or hollows.  the 3d triangulation generates many cells which
go across the hollow and I would like to remove the cells which are in empty
space while keeping the ones which are on the surface of the shape.

I have thought about testing each facet and then printing each one which
meets the criteria to be included but this seems like a sluggish solution. 
I was asking here first to see if there was an easier/more elegant way to do
it :)



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Removing-edges-and-facets-from-a-3d-triangulation-tp4659472p4659475.html
Sent from the cgal-discuss mailing list archive at Nabble.com.