Minimum weight pseudo-triangulations

@article{Gudmundsson2007MinimumWP,
  title={Minimum weight pseudo-triangulations},
  author={Joachim Gudmundsson and Christos Levcopoulos},
  journal={Comput. Geom.},
  year={2007},
  volume={38},
  pages={139-153}
}
We consider the problem of computing a minimum weight pseudo-triangulation of a set S of n points in the plane. We first present an O(n log n)-time algorithm that produces a pseudo-triangulation of weight O(log n ·wt(M(S))) which is shown to be asymptotically worst-case optimal, i.e., there exists a point set S for which every pseudo-triangulation has weight Ω(log n ·wt(M(S))), where wt(M(S)) is the weight of a minimum spanning tree of S. We also present a constant factor approximation… CONTINUE READING