The expected number of 3D visibility events is linear

Abstract : In this paper, we show that, amongst n uniformly distributed unit balls in R^3, the expected number of maximal non-occluded line segments tangent to four balls is linear, considerably improving the previously known upper bound. Using our techniques we show a linear bound on the expected size of the visibility complex, a data structure encoding the visibility information of a scene, providing evidence that the storage requirement for this data structure is not necessarily prohibitive. Our results generalize in various directions. We show that the linear bound on the expected number of maximal non-occluded line segments that are not too close to the boundary of the scene and tangent to four unit balls extends to balls of various but bounded radii, to polyhedra of bounded aspect ratio, and even to non-fat 3D objects such as polygons of bounded aspect ratio. We also prove that our results extend to other distributions such as the Poisson distribution. Finally, we indicate how our probabilistic analysis provides new insight on the expected size of other global visibility data structures, notably the aspect graph.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00071914
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 7:14:10 PM
Last modification on : Saturday, January 27, 2018 - 1:31:24 AM
Long-term archiving on : Sunday, April 4, 2010 - 10:44:18 PM

Identifiers

  • HAL Id : inria-00071914, version 1

Collections

Citation

Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, et al.. The expected number of 3D visibility events is linear. [Research Report] RR-4671, INRIA. 2002. ⟨inria-00071914⟩

Share

Metrics

Record views

338

Files downloads

131