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.
Computing acute and non-obtuse triangulations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.CG 1years
2025 1verdicts
ACCEPT 1roles
method 1polarities
extend 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.