Corpus ID: 5158629

Planar Visibility Counting

@article{Fischer2008PlanarVC,
  title={Planar Visibility Counting},
  author={M. Fischer and M. Hilbig and C. J{\"a}hn and F. Heide and M. Ziegler},
  journal={ArXiv},
  year={2008},
  volume={abs/0810.0052}
}
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. We deduce the EXISTENCE of an O(m^2/n^2) space data structure for S that, given p and time O(log n), allows to approximate the ratio of… Expand
Randomized approximation algorithms for planar visibility counting problem
On Planar Visibility Counting Problem
Planar visibility: testing and counting
Visibility Testing and Counting
Weak visibility counting in simple polygons
Visibility testing and counting

References

SHOWING 1-10 OF 48 REFERENCES
Graphics in Flatland Revisited
Visibility Algorithms in the Plane
Visibility, occlusion, and the aspect graph
Visibility preprocessing for interactive walkthroughs
Guided visibility sampling
Guided visibility sampling
Exact, robust and efficient full visibility computation in Plücker space
On the Expected Size of the 2D Visibility Complex
...
1
2
3
4
5
...