The expected number of 3D visibility events is linear

Reference:
O. Devillers, V. Dujmovic, H. Everett, X. Goaoc, S. Lazard, H.-S. Na, and S. Petitjean. The expected number of 3D visibility events is linear. Rapport de Recherche INRIA No 4671, 2002, 42 pages. SIAM Journal on Computing, Vol 32:6, June 2003, pp. 1586-1620.

Abstract:
In this paper, we show that, amongst $n$ uniformly distributed unit balls in $\mathbb{R}^3$, the expected number of maximal non-occluded line segments tangent to four balls is linear, considerably improving the previously known upper bound of $O(n^{8/3})$~\cite{DDP02}. 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.

Availability:
Compressed postscript file: Extended abstract (160k, 18p.), Research report (285k, 42p.).



Return to previous page


Sylvain Lazard
Last modified: Wed Nov 19 21:08:57 MET 2003