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
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)
A simple output-sensitive algorithm for hidden surface removal
ACM Transactions on Graphics (TOG)
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
Ray shooting and parametric search
SIAM Journal on Computing
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Ray Shooting, Depth Orders and Hidden Surface Removal
Ray Shooting, Depth Orders and Hidden Surface Removal
On the Boundary Complexity of the Union of Fat Triangles
SIAM Journal on Computing
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Balanced aspect ratio trees
Vertical ray shooting for fat objects
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Vertical ray shooting and computing depth orders for fat objects
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
Improved bounds on the union complexity of fat objects
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Approximate range searching using binary space partitions
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Decompositions and Boundary Coverings of Non-convex Fat Polyhedra
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
| Hi-index | 0.00 |
We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm runs in O((n + k) polylog n) time, where k is the combinatorial complexity of the visibility map. This is the first algorithm for computing the visibility map of fat objects that does not require a depth order on the objects and is faster than the best known algorithm for general objects. It is also the first output-sensitive algorithm for curved objects that does not require a depth order.