Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
Computational Geometry
2025-06-19 v2 Data Structures and Algorithms
Abstract
We give an overview of the 2025 Computational Geometry Challenge targeting the problem Minimum Non-Obtuse Triangulation: Given a planar straight-line graph G in the plane, defined by a set of points in the plane (representing vertices) and a set of non-crossing line segments connecting them (representing edges); the objective is to find a feasible non-obtuse triangulation that uses a minimum number of Steiner points. If no triangulation without obtuse triangles is found, the secondary objective is to minimize the number of obtuse triangles in the triangulation.
Cite
@article{arxiv.2504.04412,
title = {Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025},
author = {Sándor P. Fekete and Phillip Keldenich and Dominik Krupke and Stefan Schirra},
journal= {arXiv preprint arXiv:2504.04412},
year = {2025}
}
Comments
11 pages, 3 figures