Document Open Access Logo

Computing Non-Obtuse Triangulations with Few Steiner Points (CG Challenge)

Authors Mikkel Abrahamsen , Florestan Brunck , Jacobus Conradi , Benedikt Kolbe , André Nusser

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2025.79.pdf
  • Filesize: 1.24 MB
  • 13 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • non-obtuse triangulation
  • local search
  • competition

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We present the winning implementation of the Seventh Computational Geometry Challenge (CG:SHOP 2025). The task in this challenge was to find non-obtuse triangulations for given planar regions, respecting a given set of constraints consisting of extra vertices and edges that must be part of the triangulation. The goal was to minimize the number of introduced Steiner points. Our approach is to maintain a constrained Delaunay triangulation, for which we repeatedly remove, relocate, or add Steiner points. We use local search to choose the action that improves the triangulation the most, until the resulting triangulation is non-obtuse.

Cite As Get BibTex

Mikkel Abrahamsen, Florestan Brunck, Jacobus Conradi, Benedikt Kolbe, and André Nusser. Computing Non-Obtuse Triangulations with Few Steiner Points (CG Challenge). In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 79:1-79:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.SoCG.2025.79

Author Details

Mikkel Abrahamsen
  • University of Copenhagen, Denmark
Florestan Brunck
  • University of Copenhagen, Denmark
Jacobus Conradi
  • University of Bonn, Germany
Benedikt Kolbe
  • Hausdorff Center for Mathematics, Lamarr Institute for Machine Learning and Artificial Intelligence, University of Bonn, Germany
André Nusser
  • Université Côte d'Azur, CNRS, Inria, Sophia Antipolis, France

Funding

  • Abrahamsen, Mikkel: Supported by Independent Research Fund Denmark, grant 1054-00032B, and by the Carlsberg Foundation, grant CF24-1929.
  • Brunck, Florestan: Supported by a DNRF Chair grant from the Danish National Research Foundation and partially by the BARC grant of the Villum Foundation.
  • Conradi, Jacobus: Funded by the iBehave Network: Sponsored by the Ministry of Culture and Science of the State of North Rhine-Westphalia.
  • Kolbe, Benedikt: This research has partly been funded by the Federal Ministry of Education and Research of Germany and the state of North-Rhine Westphalia as part of the Lamarr-Institute for Machine Learning and Artificial Intelligence.
  • Nusser, André: Supported by the France 2030 investment plan managed by the ANR as part of the Initiative of Excellence of Université Côte d'Azur with reference number ANR-15-IDEX-01.

Acknowledgements

We thank the Challenge organizers and other competitors for their time, feedback, and making this whole event possible. We thank Max Kanold for invaluable input enabling high quality visualizations which made later discussions on how to improve our algorithm all the more fruitful. We gratefully acknowledge the access to the Marvin cluster of the University of Bonn.

Supplementary Materials

References

  1. Mikkel Abrahamsen, Florestan Brunck, Jacobus Conradi, Benedikt Kolbe, and André Nusser. nonObtuseTri. Software, version v3.0., (visited on 2025-06-02). URL: https://github.com/JacobusTheSecond/nonObtuseTri
    Software Heritage Logo archived version
    full metadata available at: https://doi.org/10.4230/artifacts.23288
  2. Taehoon Ahn, Jaegun Lee, Byeonguk Kang, and Hwi Kim. Incremental algorithm and local search for minimum non-obtuse triangulations (CG challenge). In Oswin Aichholzer and Haitao Wang, editors, 41st International Symposium on Computational Geometry (SoCG 2025), 2025. These proceedings. URL: https://doi.org/10.4230/LIPIcs.SoCG.2025.80.
  3. Brenda S. Baker, Eric Grosse, and Conor S. Rafferty. Nonobtuse triangulation of polygons. Discret. Comput. Geom., 3:147-168, 1988. URL: https://doi.org/10.1007/BF02187904.
  4. Marshall W. Bern, Scott A. Mitchell, and Jim Ruppert. Linear-size nonobtuse triangulation of polygons. Discret. Comput. Geom., 14(4):411-428, 1995. URL: https://doi.org/10.1007/BF02570715.
  5. Jan Brandts, Sergey Korotov, Michal Krízek, and Jakub Solc. On nonobtuse simplicial partitions. SIAM Rev., 51(2):317-335, 2009. URL: https://doi.org/10.1137/060669073.
  6. Y. Burago and V. Zalgaller. Polyhedral embedding of a net. Vestnik Leningrad. Univ, 15(7):66-80, 1960. Google Scholar
  7. Hale Erten and Alper Üngör. Computing acute and non-obtuse triangulations. In Prosenjit Bose, editor, Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada, pages 205-208. Carleton University, Ottawa, Canada, 2007. URL: http://cccg.ca/proceedings/2007/09a2.pdf.
  8. Hale Erten and Alper Üngör. Computing triangulations without small and large angles. In Francois Anton, editor, Sixth International Symposium on Voronoi Diagrams, ISVD 2009, Copenhagen, Denmark, June 23-26, 2009, pages 192-201. IEEE Computer Society, 2009. URL: https://doi.org/10.1109/ISVD.2009.32.
  9. Hale Erten and Alper Üngör. Quality triangulations with locally optimal steiner points. SIAM J. Sci. Comput., 31(3):2103-2130, 2009. URL: https://doi.org/10.1137/080716748.
  10. Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, and Stefan Schirra. Minimum non-obtuse triangulations: The CG:SHOP Challenge 2025, 2025. URL: https://arxiv.org/abs/2504.04412.
  11. Hiroshi Maehara. Acute triangulations of polygons. European Journal of Combinatorics, 23(1):45-55, 2002. URL: https://doi.org/10.1006/EUJC.2001.0531.
  12. M. Maschler, S. Zamir, and E. Solan. Game Theory. Cambridge University Press, 2013. URL: https://books.google.de/books?id=lqwzqgvhwXsC.
  13. S. Saraf. Acute and nonobtuse triangulations of polyhedral surfaces. European Journal of Combinatorics, 30(4):833-840, 2009. URL: https://doi.org/10.1016/J.EJC.2008.08.004.
  14. Jane Tournois, Pierre Alliez, and Olivier Devillers. Interleaving delaunay refinement and optimization for 2d triangle mesh generation. In Michael L. Brewer and David L. Marcum, editors, Proceedings of the 16th International Meshing Roundtable, October 14-17, 2007, Seattle, Washington, USA, Proceedings, pages 83-101. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-75103-8_5.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact