Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913899277713408 |
|---|---|
| author | Fekete, Sándor P. Keldenich, Phillip Krupke, Dominik Schirra, Stefan |
| author_facet | Fekete, Sándor P. Keldenich, Phillip Krupke, Dominik Schirra, Stefan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_04412 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025 Fekete, Sándor P. Keldenich, Phillip Krupke, Dominik Schirra, Stefan Computational Geometry Data Structures and Algorithms F.2.2 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. |
| title | Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025 |
| topic | Computational Geometry Data Structures and Algorithms F.2.2 |
| url | https://arxiv.org/abs/2504.04412 |