Abstract
Given a set S of n points in the plane, a triangulation is a maximal set of non-intersecting edges connecting the points in S. The weight of the triangulation is the sum of the lengths of the edges. In this paper, we show that for β > 1/sin κ, the β-skeleton of S is a subgraph of a minimum weight triangulation of S, where κ = tan-1 (3/√2√3) ≈ π/3.1. There exists a four-point example such that the β-skeleton for β < 1/sin(π/3) is not a subgraph of the minimum weight triangulation.
| Original language | English |
|---|---|
| Pages (from-to) | 459-471 |
| Number of pages | 13 |
| Journal | Theoretical Computer Science |
| Volume | 262 |
| Issue number | 1-2 |
| DOIs | |
| State | Published - 2001 |
Keywords
- Beta skeleton
- Computational geometry
- Minimum weight triangulation
Fingerprint
Dive into the research topics of 'On β-skeleton as a subgraph of the minimum weight triangulation'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver