Rendering equation revisited: how to avoid explicit visibility computations
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Sweeping simple polygons with a chain of guards
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Segment intersection searching problems in general settings
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Cost prediction for ray shooting
Proceedings of the eighteenth annual symposium on Computational geometry
Sets of lines and cutting out polyhedral objects
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Vertical ray shooting for fat objects
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
The interface between computational and combinatorial geometry
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Pianos are not flat: rigid motion planning in three dimensions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Vertical ray shooting and computing depth orders for fat objects
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
Proceedings of the twenty-second annual symposium on Computational geometry
Cost prediction for ray shooting in octrees
Computational Geometry: Theory and Applications
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
Computational Geometry: Theory and Applications
Approximating nearest neighbor among triangles in convex position
Information Processing Letters
Line transversals of convex polyhedra in R3
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Cost prediction for ray shooting in octrees
Computational Geometry: Theory and Applications
The union of colorful simplices spanned by a colored point set
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Line Transversals of Convex Polyhedra in $\mathbb{R}^3$
SIAM Journal on Computing
Computing a center-transversal line
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Watchman tours for polygons with holes
Computational Geometry: Theory and Applications
Lazy Visibility Evaluation for Exact Soft Shadows
Computer Graphics Forum
Technical Section: Analytic ambient occlusion using exact from-polygon visibility
Computers and Graphics
Accelerating ray tracing using constrained tetrahedralizations
EGSR'08 Proceedings of the Nineteenth Eurographics conference on Rendering
The union of colorful simplices spanned by a colored point set
Computational Geometry: Theory and Applications
Hi-index | 0.00 |