Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Proximity problems on moving points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A practical evaluation of kinetic data structures
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Kinetic data structures: a state of the art report
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
Lower bounds for kinetic planar subdivisions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Kinetic collision detection between two simple polygons
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Separation-sensitive collision detection for convex objects
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An algorithm for planning collision-free paths among polyhedral obstacles
Communications of the ACM
Minimum link paths in polygons and related problems
Minimum link paths in polygons and related problems
A sum of squares theorem for visibility
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Computational geometry column 43
ACM SIGACT News
Algorithmic issues in modeling motion
ACM Computing Surveys (CSUR)
Separation Sensitive Kinetic Separation Structures for Convex Polygons
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Tight degree bounds for pseudo-triangulations of points
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Transforming pseudo-triangulations
Information Processing Letters
Collision detection for deforming necklaces
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
Enumerating pseudo-triangulations in the plane
Computational Geometry: Theory and Applications
Fast continuous collision detection for articulated models
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Interactive Continuous Collision Detection Using Swept Volume for Avatars
Presence: Teleoperators and Virtual Environments
Continuous collision detection for articulated models using Taylor models and temporal culling
ACM SIGGRAPH 2007 papers
Minimum weight pseudo-triangulations
Computational Geometry: Theory and Applications
Computers and Electronics in Agriculture
Enumerating pseudo-triangulations in the plane
Computational Geometry: Theory and Applications
C2A: controlled conservative advancement for continuous collision detection of polygonal models
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
On constrained minimum pseudotriangulations
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Transforming pseudo-triangulations
ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
Fast continuous collision detection using parallel filter in subspace
I3D '11 Symposium on Interactive 3D Graphics and Games
The stochastic walk algorithms for point location in pseudo-triangulations
Advances in Engineering Software
Construction of pseudo-triangulation by incremental insertion
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
| Hi-index | 0.00 |