3 research outputs found
On the expected size of the 2d visibility complex
We study the expected size of the 2D visibility complex of randomly distributed objects in the plane. We prove that the asymptotic expected number of free bitangents (which correspond to 0-faces of the visibility complex) among unit discs (or polygons of bounded aspect ratio and similar size) is linear and exhibit bounds in terms of the density of the objects. We also make an experimental assessment of the size of the visibility complex for disjoint random unit discs. We provide experimental estimates of the onset of the linear behavior and of the asymptotic slope and y-intercept of the number of free bitangents in terms of the density of discs. Finally, we analyze the quality of our estimates in terms of the density of discs.
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.Comment: 66 pages, 39 figure
Globale Sichtbarkeitsalgorithmen
In der vorliegenden Arbeit werden zwei grundsätzliche Ansätze zur Lösung des globalen Sichtbarkeitsproblems beschrieben und verglichen: Näherungs- und exakte Verfahren. Als Beispiel für die exakten Verfahren wird das sog. Visibility Skeleton eingehend untersucht und für verschiedene Spezialfälle angepasst