Visualization of Geometric Algorithms
IEEE Transactions on Visualization and Computer Graphics
Computing the Penetration Depth of Two Convex Polytopes in 3D
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Fast and Accurate Collision Detection for Virtual Environments
Dagstuhl '97, Scientific Visualization
Sublinear geometric algorithms
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Collision prediction for polyhedra under screw motions
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Efficient algorithms for bichromatic separability
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On approximating the depth and related problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Introduction to haptic rendering
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Efficient Collision Detection within Deforming Spherical Sliding Contact
IEEE Transactions on Visualization and Computer Graphics
Exact and efficient construction of Minkowski sums of convex polyhedra with applications
Computer-Aided Design
Hausdorff approximation of 3D convex polytopes
Information Processing Letters
On the union of fat tetrahedra in three dimensions
Journal of the ACM (JACM)
Ray shooting and stone throwing with near-linear storage
Computational Geometry: Theory and Applications
Counter-example guided predicate abstraction of hybrid systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Algorithms and theory of computation handbook
On the computation of 3D visibility skeletons
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Computational Geometry: Theory and Applications
MICCAI'11 Proceedings of the 2011 international conference on Prostate cancer imaging: image analysis and image-guided interventions
A local search algorithm for ray-convex polyhedron intersection
Computational Optimization and Applications
Tentative Prune-And-Search For Computing Fixed-Points With Applications To Geometric Computation
Fundamenta Informaticae
Convex hulls of spheres and convex hulls of disjoint convex polytopes
Computational Geometry: Theory and Applications
Range-aggregate queries for geometric extent problems
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
| Hi-index | 0.00 |