Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/776
On βskeleton as a subgraph of the minimum weight triangulation
Authors 
Cheng, SW
Xu, XF 


Issue Date  2001  
Source  Theoretical Computer Science , v. 262, (12), 2001, JUL 6, p. 459471  
Summary  Given a set S of n points in the plane, a triangulation is a maximal set of nonintersecting 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 beta > l/sin kappa, the beta skeleton of S is a subgraph of a minimum weight triangulation of S, where kappa = tan(1)(3/root2 root3) approximate to pi /3.1. There exists a fourpoint example such that the beta skeleton for beta < 1/sin( 

Subjects  
ISSN  03043975  
Language  English 

Format  Article  
Access 
View fulltext via DOI View fulltext via Web of Science View fulltext via Scopus Files in this item:
