Quadratic bounds for hidden line elimination
SCG '86 Proceedings of the second annual symposium on Computational geometry
Worst-case optimal hidden-surface removal
ACM Transactions on Graphics (TOG)
New algorithms for special cases of the hidden line elimination problem
Computer Vision, Graphics, and Image Processing
An efficient output-sensitive hidden surface removal algorithm and its parallelization
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Binary partitions with applications to hidden surface removal and solid modelling
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
An efficient algorithm for hidden surface removal
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
The complexity and construction of many faces in arrangements of lines and of segments
Discrete & Computational Geometry - Special issue on the complexity of arrangements
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
A simple output-sensitive algorithm for hidden surface removal
ACM Transactions on Graphics (TOG)
A Characterization of Ten Hidden-Surface Algorithms
ACM Computing Surveys (CSUR)
Computing the minimum Hausdorff distance for point sets under translation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
| Hi-index | 0.00 |
Let V be a set of objects in space for which we want to determine the portions visible from a particular point of view &ugr;. Assume V is subdivided in subsets V1,…, Vz and the visibility maps &Mgr;1, … &Mgr;z of these subsets from point ugr; are known. We show that the visibility map &Mgr; for V can be computed by merging &Mgr;1, … &Mgr;z in time &Ogr;((n + &kgr;)z log2 n) where n is the total size (number of edges, vertices and faces) of the visibility maps &Mgr;1,…, &Mgr;z and &kgr; is the size of &Mgr;. This result has important applications e.g. in animation where objects move with respect to a fixed environment. It also leads to efficient algorithms for special cases of the hidden-surface removal problem. For example, we obtain a method for hidden surface removal in a set of unit spheres, viewed from infinity, that runs in time &Ogr;((n + &kgr;) log2 n).