Computing convolutions by reciprocal search
SCG '86 Proceedings of the second annual symposium on Computational geometry
Quadratic bounds for hidden line elimination
SCG '86 Proceedings of the second annual symposium on Computational geometry
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & 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
An efficient algorithm for hidden surface removal
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Hidden surface removal for rectangles
Journal of Computer and System Sciences
Computation of the axial view of a set of isothetic parallelepipeds
ACM Transactions on Graphics (TOG)
Efficient binary space partitions for hidden-surface removal and solid modeling
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
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
Fat triangles determine linearly many holes
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A Characterization of Ten Hidden-Surface Algorithms
ACM Computing Surveys (CSUR)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Efficient hidden surface removal for objects with small union size
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Error-bounded antialiased rendering of complex environments
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Cutting triangular cycles of lines in space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Computer-Aided Design
Cutting cycles of rods in space: hardness and approximation
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Computing the visibility map of fat objects
Computational Geometry: Theory and Applications
An optimal hidden-surface algorithm and its parallelization
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Computing the visibility map of fat objects
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We derive a simple output-sensitive algorithm for hidden surfaceremoval in a collection of ntriangles in space for which a (partial) depth order is known. Ifk is the combinatorial complexity ofthe output visibility map, the methodruns in time Onklogn. The method is extended to work for other classes ofobjects as well, sometimes with even improved time bounds. For example,we obtain an algorithm that performs hidden surface removal forn (nonintersecting) balls in timeOn3/2logn+k.