CGAL users discussion list

[one_eyed_cat <>]

Hello everyone,
I would like to reduce a model's complexity as much as possible by merging
adjacent, (nearly for an ε) coplanar faces. The model's surfaces can be
closed or contain holes. Currently. I am using a Polyhedron with plane
equations (like here 
https://doc.cgal.org/latest/Polyhedron/Polyhedron_2polyhedron_prog_planes_8cpp-example.html
<https://doc.cgal.org/latest/Polyhedron/Polyhedron_2polyhedron_prog_planes_8cpp-example.html>
 
), iteratively iterating the halfedges and calling `join_facet`when needed
until there's nothing left to merge. However, I encounter problems like
antennas for more than one overlapping edge for adjacent facets or
overlapping edges in the same facet, ending up trying to merge with itself
in the merging process which makes me doubt my approach (examples appened).
I get the feeling I would have to consider a lot of factors and edge cases
if I am staying with `join_facet`. So I wonder if Polyhedron is really the
right class to use regarding the joining of any faces and not having exactly
coplanar surfaces. 
If you could help a newcomer out with your experience, that would make my
day :) 
Best regards
<http://cgal-discuss.949826.n4.nabble.com/file/t376194/resulting_antenna.jpg> 
<http://cgal-discuss.949826.n4.nabble.com/file/t376194/overlapping.png> 



--
Sent from: http://cgal-discuss.949826.n4.nabble.com/