3 ms·
> robust triangulation of n-gons and making per-face-per-vertex data per-vertex on disconnected triangles. This is a simple post-process step after parsing.
by grandempire 2y ago
> robust triangulation of n-gons and making per-face-per-vertex data per-vertex on disconnected triangles.
This is a simple post-process step after parsing.
- sreekotay 2y agoDepends on your definition of robust (e.g. how are you handling T-junctions) but in general I would agree with this, in that that some things that are NOT trivial should rightly be pushed up the art pipeline. Good pipelines shouldn't rely on clever parser behaviour (as a general rule)
- grandempire 2y agoGood point about T-junctions. I was thinking only of combinatorial triangulation.
- virtualritz 2y agoWhen your polygons are convex and non-planar 'simple' quickly becomes an euphemism. You may even want to consider adjacent topology for something as 'simple' as which of two possible solutions to take, when splitting a non-planar quad into two triangles. Triangulation is simple only when your polygons are planar and convex and aspect ratios of resulting triangles do not matter under any 2ndary circumstances. Some uses e.g. require avoiding thin, splinter-like triangles.