One strike against the min-max degree triangulation problem

DOI10.1016/0925-7721(93)90003-OzbMath0779.68088MaRDI QIDQ685602

Klaus Jansen

Publication date: 17 October 1993

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

triangulationgeometric graphNP-complete

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

Higher order Delaunay triangulations ⋮ Plane Graphs with Parity Constraints ⋮ Triangulating planar graphs while minimizing the maximum degree ⋮ Plane graphs with parity constraints ⋮ Minimum degree triangulation for rectangular domains ⋮ Euler Transformation of Polyhedral Complexes ⋮ Augmenting Geometric Graphs with Matchings

Cites Work

• Unnamed Item
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Edge insertion for optimal triangulations
• Planar Formulae and Their Uses
• Mesh relaxation: A new technique for improving triangulations
• Triangulating planar graphs while minimizing the maximum degree

This page was built for publication: One strike against the min-max degree triangulation problem