Closed hassec closed 1 year ago
Adding a plot of the delaunay triangulation:
If I understand the current algorithm correctly it assumes that it can build the original polygon back from sets of convex subpolygons which are created by grouping the simplices created by the Delaunay triangulation.
But, this doesn't seem to be possible for this specific case.
Maybe a different approach to splitting the polygon into convex subsets, could work?
Ah, sorry for the delay - I've been away for a bit. The issue here is that the triangulation didn't produce an edge along one of the boundaries of the polygon. I'll see if there is an option in the QHull library to force a set of edges just from the input points. The polygon can always be decomposed into convex subsets as long as there are edges on the boundary of the polygon.
closed via #2362
Reproducer:
The matplotlib plot shows the shape of the polygon:
But the geometry of the cell that is created by OpenMC doesn't correctly reproduce the top left cutout but has a diagonal instead.
fyi @eepeterson