Two Subsets an the Triangulation of a Planar Point Set
Received:May 05, 1994  
Key Words: triangulation, stable line segment, chain decomposition, algorithm, computational geometry.  
Fund Project:
Author NameAffiliation
Xu Yinfeng School of Management, Xi′an Jiaotong University, Xi′an 710049 
Yang Boting Dept. of Math., Xi′an Jiaotong University, Xi′an 710049 
Hits: 1971
Download times: 1307
Abstract:
      Given a finite set S of points in the Euclidean plane, we propose two kinds of line segment sets with endpoints in S. the first kind of line segment set is a subset of any triangulation of S, the second kind of line segment set is a subset of any minimum weight triangulation of S, and the two sets are disjoint. The computation of the two sets takes O(n3) time and O(n) space.
Citation:
DOI:10.3770/j.issn:1000-341X.1996.04.009
View Full Text  View/Add Comment