Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Efficient hidden surface removal for objects with small union size
Computational Geometry: Theory and Applications
Computing and Verifying Depth Orders
SIAM Journal on Computing
The complexity of the free space for a robot moving amidst fat obstacles
Computational Geometry: Theory and Applications
Computing depth orders for fat objects and related problems
Computational Geometry: Theory and Applications
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Computational Geometry: Theory and Applications
Ray shooting and lines in space
Handbook of discrete and computational geometry
On fat partitioning, fat covering and the union size of polygons
Computational Geometry: Theory and Applications
Efficient generation of k-directional assembly sequences
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic data structures for fat objects and their applications
Computational Geometry: Theory and Applications
Ray Shooting, Depth Orders and Hidden Surface Removal
Ray Shooting, Depth Orders and Hidden Surface Removal
Balanced aspect ratio trees
Guarding scenes against invasive hypercubes
Computational Geometry: Theory and Applications
Vertical ray shooting for fat objects
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Approximate range searching using binary space partitions
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
Proceedings of the twenty-second annual symposium on Computational geometry
Cutting cycles of rods in space: hardness and approximation
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
Computational Geometry: Theory and Applications
Computing the visibility map of fat objects
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Dynamic planar point location with sub-logarithmic local updates
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We present new results for three problems dealing with a set P of n convex constant-complexity fat polyhedra in 3-space. (i) We describe a data structure for vertical ray shooting in P that has O(log2 n) query time and uses O(n log2 n) storage. (ii) We give an algorithm to compute in O(n log3 n) time a depth order on P, if it exists. (iii) We give an algorithm to verify in O(n log4 n) time whether a given order on P is a valid depth order. All three results improve on previous results.