The Path of a Triangulation

@inproceedings{Aichholzer1999ThePO,
  title={The Path of a Triangulation},
  author={Oswin Aichholzer},
  booktitle={Symposium on Computational Geometry},
  year={1999}
}
For a planar point set S let T be a triangulation of S and 1 a line properly intersecting T. We show that there always exists a unique path in T with certain properties with respect to 1. This path is then generalized to (non triangulated) point sets restricted to the interior of simple polygons. This so-called triangulation path enables us to treat several triangulation problems on planar point sets in a divide & conquer-like manner. For example, we give the first algorithm for counting… CONTINUE READING