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

Authors
Citation
Sw. Cheng et Xf. Xu, On beta-skeleton as a subgraph of the minimum weight triangulation, THEOR COMP, 262(1-2), 2001, pp. 459-471
Citations number
18
Categorie Soggetti
Computer Science & Engineering
Journal title
THEORETICAL COMPUTER SCIENCE
ISSN journal
03043975 → ACNP
Volume
262
Issue
1-2
Year of publication
2001
Pages
459 - 471
Database
ISI
SICI code
0304-3975(20010706)262:1-2<459:OBAASO>2.0.ZU;2-0
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 trian gulation is the sum of the lengths of the edges. In this paper, we show tha t for beta > l/sin kappa, the beta -skeleton of S is a subgraph of a minimu m weight triangulation of S, where kappa- = tan(-1)(3/root2 root3) approxim ate to pi /3.1. There exists a four-point example such that the beta -skele ton for beta < 1/sin(<pi>/3) is not a subgraph of the minimum weight triang ulation. (C) 2001 Elsevier Science B.V. All rights reserved.