ar X iv : 0 81 0 . 00 52 v 2 [ cs . C G ] 9 O ct 2 00 8 Planar Visibility Counting ⋆

Abstract

For a fixed virtual scene (=collection of simplices) S and given observer position p, how many elements of S are weakly visible (i.e. not fully occluded by others) from p? The present work explores the trade-off between query time and preprocessing space for these quantities in 2D: exactly, in the approximate deterministic, and in the probabilistic sense… (More)

Topics

8 Figures and Tables

Cite this paper

@inproceedings{FischerarXI, title={ar X iv : 0 81 0 . 00 52 v 2 [ cs . C G ] 9 O ct 2 00 8 Planar Visibility Counting ⋆}, author={M. Fischer and M. Hilbig and Claudius J{\"a}hn and Friedhelm Meyer auf der Heide} }