On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation

DOI10.1016/S0304-3975(00)00318-2zbMath0983.68225OpenAlexW2110610374MaRDI QIDQ5958132

No author found.

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00318-2

zbMATH Keywords

minimum weight triangulationcomputational geometrybeta skeleton

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

A linear time algorithm for max-min length triangulation of a convex polygon ⋮ A new asymmetric inclusion region for minimum weight triangulation ⋮ Steiner reducing sets of minimum weight triangulations: Structure and topology ⋮ FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM ⋮ The minimum weight triangulation problem with few inner points

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing a subgraph of the minimum weight triangulation
• New results for the minimum weight triangulation problem
• Triangulations intersect nicely
• Edge insertion for optimal triangulations
• A heuristic triangulation algorithm
• A New Heuristic for Minimum Weight Triangulation
• Hypersingular integrals in boundary element fracture analysis

This page was built for publication: On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation