Learn More
No polynomial-time algorithm is kno-ivn to compute t,he minimum weight triangulation (MWT) of a finite planar point set. In this paper xve present efficient implementat,ions of the LMT-skeleton heuris-t'ic, xvhich identifies edges that must be, and cannot be, in an MWT. For uniformly distributed points, v:e can compute the esact MWT of tens of thousands of(More)
In presenting this thesis in partial fullllment of the requirements for an advanced degree at the University of British Columbia, I agree that the Library shall make it freely available for reference and study. I further agree that permission for extensive copying of this thesis for scholarly purposes may be granted by the head of my department or by his or(More)
  • 1