Triangulations of Line Segment Sets in the Plane

DOI10.1007/978-3-540-77050-3_32zbMath1135.68596OpenAlexW1518626075MaRDI QIDQ5458851

Mathieu Brévilliers, Nicolas Chevallier, Dominique Schmitt

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_32

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

$$\beta $$-skeletons for a Set of Line Segments in $$R^2 $$ ⋮ Flip Algorithm for Segment Triangulations ⋮ Intersections and circuits in sets of line segments

Uses Software

• RAGlib

Cites Work

• On the computation of an arrangement of quadrics in 3D
• Generalized Delaunay triangulation for planar graphs
• Checking the convexity of polytopes and the planarity of subdivisions
• Angular properties of Delaunay diagrams in any dimension
• Checking geometric programs or verification of geometric structures
• Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
• An exact and efficient approach for computing a cell in an arrangement of quadrics
• 3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Triangulations of Line Segment Sets in the Plane