基于分支覆盖的伪三角剖分计算
Computing pseudotriangulations via branched coverings
摘要：
本文描述了一个计算由手形表示的两两不相交凸体的有限平面族的伪三角剖分的有效算法。该算法的设计依赖于深化的理论的可见性复合体和扩展该理论的分支覆盖的设置。计算一个伪三角形，其中包含一组给定的双切线线段的问题也进行了研究。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
