Pith. sign in

REVIEW 1 cited by

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.04412 v2 pith:JOA3CNUD submitted 2025-04-06 cs.CG cs.DS

Sándor P. Fekete , Phillip Keldenich , Dominik Krupke , Stefan Schirra This is my paper · ORCID
classification cs.CGcs.DS
keywords triangulationminimumnon-obtusechallengenumberobjectiveobtuseplane
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Computing Non-Obtuse Triangulations with Few Steiner Points

    cs.CG 2025-05 accept novelty 6.0 of 10

    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.

Pith tools