A local-search solver over constrained Delaunay triangulations with insertion, relocation, deletion, and solution merging won CG:SHOP 2025, beating the runner-up on most instances.
On nonobtuse simplicial partitions
1 Pith paper cite this work, alongside 95 external citations. Polarity classification is still indexing.
1
Pith paper citing it
95
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.CG 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Computing Non-Obtuse Triangulations with Few Steiner Points
A local-search solver over constrained Delaunay triangulations with insertion, relocation, deletion, and solution merging won CG:SHOP 2025, beating the runner-up on most instances.