Worst-case optimal hidden-surface removal
ACM Transactions on Graphics (TOG)
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
New algorithms for special cases of the hidden line elimination problem
Computer Vision, Graphics, and Image Processing
Visibility and intersection problems in plane geometry
Discrete & Computational Geometry
Lines in space-combinators, algorithms and applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
An efficient output-sensitive hidden surface removal algorithm and its parallelization
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Hidden surface removal for rectangles
Journal of Computer and System Sciences
An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Efficient ray shooting and hidden surface removal
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
New upper bounds in Klee's measure problem
SIAM Journal on Computing
Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient hidden surface removal for objects with small union size
Computational Geometry: Theory and Applications
Hidden surface removal for c-oriented polyhedra
Computational Geometry: Theory and Applications
Guarding galleries and terrains
Information Processing Letters
On a class of O(n2) problems in computational geometry
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
In this paper we study the following generalization of the classical hidden surface removal problem: given a set S of objects, a view point and a point light source, compute which parts of the objects in S are visible, subdivided into parts that are lit and parts that are not lit.We prove tight bounds on the maximum combinatorial complexity of such views and give efficient output-sensitve algorithms to compute the views for three cases: (i) S consists of non-intersecting triangles, (ii) S consists of horizontal axis-parallel rectangles, (iii) S is the set of faces of a polyhedral terrain.