Geometry © 1997 Springer-Verlag New York Inc. A Large Subgraph of the Minimum Weight Triangulation ∗
Cached
Download Links
BibTeX
@MISC{Dickerson_geometry©,
author = {M. T. Dickerson and J. M. Keil and M. H. Montague},
title = {Geometry © 1997 Springer-Verlag New York Inc. A Large Subgraph of the Minimum Weight Triangulation ∗},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. We present an O(n 4)-time and O(n 2)-space algorithm that computes a subgraph of the minimum weight triangulation (MWT) of a general point set. The algorithm works by finding a collection of edges guaranteed to be in any locally minimal triangulation. We call this subgraph the LMT-skeleton. We also give a variant called the modified LMTskeleton that is both a more complete subgraph of the MWT and is faster to compute requiring only O(n 2) time and O(n) space in the expected case for uniform distributions. Several experimental implementations of both approaches have shown that for moderate-sized point sets (up to 350 points 1) the skeletons are connected, enabling an efficient completion of the exact MWT. We are thus able to compute the MWT of substantially larger random point sets than have previously been computed. 1.
Keyphrases
minimum weight triangulation springer-verlag new york inc large subgraph minimal triangulation random point set exact mwt uniform distribution complete subgraph moderate-sized point set efficient completion general point expected case space algorithm several experimental implementation modified lmtskeleton
