On the Expected Size of the 2D Visibility Complex

Hazel Everett 1 Sylvain Lazard 1 Sylvain Petitjean 1 Linqiao Zhang 1
1 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [1 references]  Display  Hide  Download


https://hal.inria.fr/inria-00103926
Contributor : Sylvain Lazard <>
Submitted on : Monday, November 19, 2007 - 5:36:06 PM
Last modification on : Tuesday, October 30, 2018 - 10:28:22 AM

Files

2Dcomplex_revised.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang. On the Expected Size of the 2D Visibility Complex. International Journal of Computational Geometry and Applications, World Scientific Publishing, 2007, 17 (4), pp.361-381. ⟨10.1142/S0218195907002380⟩. ⟨inria-00103926⟩

Share

Metrics

Record views

308

Files downloads

158