SCG '87 Proceedings of the third annual symposium on Computational geometry
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computing Minimal Distances on Polyhedral Surfaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Numerical Solution to the Generalized Mapmaker's Problem: Flattening Nonconvex Polyhedral Surfaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Path planning in 0/1/ weighted regions with applications
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Parallel rectilinear shortest paths with rectangular obstacles
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Shortest paths on a polyhedron
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Using focusing search algorithms and a strong heuristic to solve the findpath problem in robotics
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
The weighted region problem: finding shortest paths through a weighted planar subdivision
Journal of the ACM (JACM)
Shortest path queries in rectilinear worlds of higher dimension (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Nonoverlap of the star unfolding
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Gross motion planning—a survey
ACM Computing Surveys (CSUR)
Shortest paths among obstacles in the plane
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
On the shortest paths between two convex polyhedra
Journal of the ACM (JACM)
Precision-sensitive Euclidean shortest path in 3-space (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Approximating shortest paths on a convex polytope in three dimensions
Proceedings of the twelfth annual symposium on Computational geometry
Approximating weighted shortest paths on polyhedral surfaces
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximating shortest paths on a convex polytope in three dimensions
Journal of the ACM (JACM)
Constructing approximate shortest path maps in three dimensions
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient computation of geodesic shortest paths
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Practical methods for approximating shortest paths on a convex polytope in R3
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
SCG '85 Proceedings of the first annual symposium on Computational geometry
Computing approximate shortest paths on convex polytopes
Proceedings of the sixteenth annual symposium on Computational geometry
Topology matching for fully automatic similarity estimation of 3D shapes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Time-minimal paths amidst moving obstacles in three dimensions
Theoretical Computer Science
High-Speed Environment Representation Scheme for Dynamic Path Planning
Journal of Intelligent and Robotic Systems
Ununfoldable polyhedra with convex faces
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Shortest Anisotropic Paths on Terrains
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Sublinear geometric algorithms
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
Theoretical Computer Science - Algebraic and numerical algorithm
Determining approximate shortest paths on weighted polyhedral surfaces
Journal of the ACM (JACM)
Calculating the meeting point of scattered robots on weighted terrain surfaces
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
Proceedings of the twenty-second annual symposium on Computational geometry
Straightest geodesics on polyhedral surfaces
ACM SIGGRAPH 2006 Courses
Shortest monotone descent path problem in polyhedral terrain
Computational Geometry: Theory and Applications
Approximate convex decomposition of polyhedra
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Shortest paths on realistic polyhedra
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Efficiently determining a locally exact shortest path on polyhedral surfaces
Computer-Aided Design
An output sensitive algorithm for computing visibility graphs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Approximate convex decomposition of polyhedra and its applications
Computer Aided Geometric Design
Approximate Euclidean shortest paths amid convex obstacles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improving Chen and Han's algorithm on the discrete geodesic problem
ACM Transactions on Graphics (TOG)
Continuous obstructed nearest neighbor queries in spatial databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Automatic generation of computeranimation: using AI for movie animation
Automatic generation of computeranimation: using AI for movie animation
Approximate ESPs on surfaces of polytopes using a rubberband algorithm
PSIVT'07 Proceedings of the 2nd Pacific Rim conference on Advances in image and video technology
Continuous nearest-neighbor search in the presence of obstacles
ACM Transactions on Database Systems (TODS)
Approximate shortest paths in simple polyhedra
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
A survey of geodesic paths on 3D surfaces
Computational Geometry: Theory and Applications
Computing shortest paths amid pseudodisks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Shortest monotone descent path problem in polyhedral terrain
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Short-Cuts on star, source and planar unfoldings
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Constant-time all-pairs geodesic distance query on triangle meshes
I3D '12 Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
Near optimal algorithm for the shortest descending path on the surface of a convex terrain
Journal of Discrete Algorithms
Direct multiple shooting method for solving approximate shortest path problems
Journal of Computational and Applied Mathematics
A near-optimal algorithm for shortest paths among curved obstacles in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
Saddle vertex graph (SVG): a novel solution to the discrete geodesic problem
ACM Transactions on Graphics (TOG)
Parallel chen-han (PCH) algorithm for discrete geodesics
ACM Transactions on Graphics (TOG)
Development of curves on polyhedra via conical existence
Computational Geometry: Theory and Applications
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |