Computing pseudotriangulations via branched coverings
Computational Geometry
2012-08-14 v2 Combinatorics
Abstract
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility complexes and on the extension of that theory to the setting of branched coverings. The problem of computing a pseudotriangulation that contains a given set of bitangent line segments is also examined.
Cite
@article{arxiv.1102.0151,
title = {Computing pseudotriangulations via branched coverings},
author = {Luc Habert and Michel Pocchiola},
journal= {arXiv preprint arXiv:1102.0151},
year = {2012}
}
Comments
66 pages, 39 figures