opened
Rockambole
username_0
Polygon connectivity data is known, i.e. element incidences + edge connections

Does CGAL deal with this problem?
Finding closed (watertight) volumes in polygon soup
issue
created
sloriot
username_1
Could you be more precise?
comment
created
Rockambole
username_0
I've studied the problem and think I've solved it using iteration. Between iterations I remove any polygons which are confirmed being part of 1 or 2 compartments (found by studying connection info on boundary edges) thereby successively reducing the problem until all polygons have been confirmed. Very fast, very stable😊
comment
closed
Rockambole
username_0
issue