Search results for "Euclidean shortest path"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Fajie Li, Reinhard Klette	Decomposing a Simple Polygon into Trapezoids.	CAIP	2007	DBLP DOI BibTeX RDF	rubberband algorithm, computational geometry, simple polygon, Euclidean shortest path
2	Fajie Li, Reinhard Klette, Xue Fu	Approximate ESPs on Surfaces of Polytopes Using a Rubberband Algorithm.	PSIVT	2007	DBLP DOI BibTeX RDF	Rubberband algorithm, surface ESP, Euclidean shortest path
2	Fajie Li, Reinhard Klette	Finding the Shortest Path Between Two Points in a Simple Polygon by Applying a Rubberband Algorithm.	PSIVT	2006	DBLP DOI BibTeX RDF	rubberband algorithm, computational geometry, digital geometry, simple polygon, Euclidean shortest path
2	Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap	Pseudo approximation algorithms, with applications to optimal motion planning.	Symposium on Computational Geometry	2002	DBLP DOI BibTeX RDF	d 1-optimal motion, optimal motion planning, pseudo approximation, approximation algorithms, NP-hard problem, binary search, robot motion planning, Euclidean shortest path
2	Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap	Approximate Euclidean Shortest Path in 3-Space.	Symposium on Computational Geometry	1994	DBLP DOI BibTeX RDF
2	Sanjiv Kapoor, S. N. Maheshwari	Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles.	Symposium on Computational Geometry	1988	DBLP DOI BibTeX RDF
1	Rajasekhar Inkulu, Sanjiv Kapoor, S. N. Maheshwari	A near optimal algorithm for finding Euclidean shortest path in polygonal domain	CoRR	2010	DBLP BibTeX RDF
1	Pankaj K. Agarwal, R. Sharathkumar, Hai Yu	Approximate Euclidean shortest paths amid convex obstacles.	SODA	2009	DBLP DOI BibTeX RDF
1	Atlas F. Cook, Carola Wenk	Link Distance and Shortest Path Problems in the Plane.	AAIM	2009	DBLP DOI BibTeX RDF	Fréchet Distance, Link Distance, Voronoi Diagram, Shortest Path Map
1	Sang Won Bae, Yoshio Okamoto	Querying Two Boundary Points for Shortest Paths in a Polygonal Domain.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Atlas F. Cook, Carola Wenk	Shortest Path Problems on a Polyhedral Surface.	WADS	2009	DBLP DOI BibTeX RDF	Fréchet distance, Voronoi Diagram, Diameter, Polyhedral Surface, Shortest Path Map
1	Fajie Li, Reinhard Klette	An Approximate Algorithm for Solving the Watchman Route Problem.	RobVis	2008	DBLP DOI BibTeX RDF	Watchman Route Problem, rubberband algorithm, computational geometry, simple polygon, visual inspection, Euclidean shortest path
1	Fajie Li, Reinhard Klette	Rubberband Algorithms for Solving Various 2D or 3D Shortest Path Problems.	ICCTA	2007	DBLP DOI BibTeX RDF
1	Fajie Li, Reinhard Klette	Euclidean Shortest Paths in Simple Cube Curves at a Glance.	CAIP	2007	DBLP DOI BibTeX RDF
1	Fajie Li, Reinhard Klette	Shortest Paths in a Cuboidal World.	IWCIA	2006	DBLP DOI BibTeX RDF
1	Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap	Pseudo Approximation Algorithms with Applications to Optimal Motion Planning.	Discrete & Computational Geometry	2004	DBLP DOI BibTeX RDF
1	Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan	Facility Location on a Polyhedral Surface.	Discrete & Computational Geometry	2003	DBLP DOI BibTeX RDF
1	Jean-Daniel Boissonnat, Subir Kumar Ghosh, Telikepalli Kavitha, Sylvain Lazard	An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon.	Algorithmica	2002	DBLP DOI BibTeX RDF
1	Jürgen Sellen, Joonsoo Choi, Chee-Keng Yap	Precision-Sensitive Euclidean Shortest Path in 3-Space.	SIAM J. Comput.	2000	DBLP DOI BibTeX RDF
1	Yi-Jen Chiang, Joseph S. B. Mitchell	Two-Point Euclidean Shortest Path Queries in the Plane.	SODA	1999	DBLP DOI BibTeX RDF
1	Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan	Facility Location on Terrains.	ISAAC	1998	DBLP DOI BibTeX RDF
1	Sanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell	An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane.	Discrete & Computational Geometry	1997	DBLP DOI BibTeX RDF
1	Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap	Precision-Sensitive Euclidean Shortest Path in 3-Space (Extended Abstract).	Symposium on Computational Geometry	1995	DBLP DOI BibTeX RDF
1	Supriya Biswas, D. Chithra Prasad, Sudebkumar Prasant Pal	Algorithms for Convex Visibility Problems.	FSTTCS	1994	DBLP DOI BibTeX RDF
1	Joon Shik Lim, S. Sitharama Iyengar, Si-Qing Zheng	Euclidean Shortest Path Problem with Rectilinear Obstacles.	VLSI Design	1993	DBLP BibTeX RDF
1	Avikam Baltsan, Micha Sharir	On the shortest paths between two convex polyhedra.	J. ACM	1988	DBLP DOI BibTeX RDF
1	Micha Sharir, Avikam Baltsan	On Shortest Paths Amidst Convex Polyhedra.	Symposium on Computational Geometry	1986	DBLP DOI BibTeX RDF