Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
By: Sándor P. Fekete , Phillip Keldenich , Dominik Krupke and more
Potential Business Impact:
Makes shapes with only good angles.
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.
Similar Papers
Solving the Heilbronn Triangle Problem using Global Optimization Methods
Computational Geometry
Finds best point arrangements for biggest empty triangles.
Non-planar Object Detection and Identification by Features Matching and Triangulation Growth
CV and Pattern Recognition
Finds objects even when they look bent.
Triangle-Decomposable Graphs for Isoperimetric Robots
Robotics
Builds robots that change shape like balloons.