Euclidean shortest path

Results: 14



#Item
1Graph theory / Mathematics / Computational complexity theory / NP-hard problems / NP-complete problems / Edsger W. Dijkstra / Combinatorial optimization / Approximation algorithms / Travelling salesman problem / Shortest path problem / Matching / Randomized algorithm

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:48:33
2Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Combinatorial optimization / NP-hard problems / Approximation algorithms / Edsger W. Dijkstra / Travelling salesman problem / Nearest neighbour algorithm / Shortest path problem / Maximal independent set

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:46:12
3Steiner tree problem / Shortest path problem / Routing algorithms / Euclidean plane geometry / Operations research / Graph theory / Theoretical computer science / Mathematics

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximate Shortest Descent Path on a Terrain Sasanka Roy∗ , Sachin Lodha∗, Sandip Das† and Anil Maheshwari‡ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:24:07
4Discrete geometry / Euclidean plane geometry / Shortest path problem / Mathematical optimization / Mathematics / Theoretical computer science / Arrangement of lines

CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 On Shortest Paths in Line Arrangements T. Kavitha∗ Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-01-08 18:44:30
5Network theory / Shortest path problem / NP-complete problems / Connectivity / Euclidean plane geometry / Analysis of algorithms / Path decomposition / Minimum spanning tree / Theoretical computer science / Computational complexity theory / Mathematics

The min-# problem, a hybrid error criterion for near-linear time performance Lilian Buzer∗† Abstract 2.1

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:46
6Euclidean plane geometry / Discrete geometry / Computational geometry / Shortest path problem / Simple polygon / Visibility / Voronoi diagram / Visibility graph / Pseudotriangle / Geometry / Mathematics / Polygons

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Optimal schedules for 2-guard room search Stephen Bahun∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:30:44
7Quadrilaterals / Network theory / Arrangement of lines / Shortest path problem / Trigonometric functions / Mathematics / Geometry / Euclidean plane geometry

CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Shortest Paths in Two Intersecting Pencils of Lines David Hart∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-01-08 18:44:36
8Polygons / Network theory / Discrete geometry / Computational geometry / Shortest path problem / Simple polygon / Visibility / Voronoi diagram / Vertex / Geometry / Mathematics / Euclidean plane geometry

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Optimal schedules for 2-guard room search Stephen Bahun∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:26:35
9Euclidean geometry / Euclidean plane geometry / Simple polygon / Connectivity / Shortest path problem / Tree / Computational geometry / Polyhedra / Art gallery problem / Geometry / Mathematics / Polygons

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon Amir Ali Khosravi∗†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:27:01
10Search algorithms / Robot control / Routing algorithms / Combinatorial optimization / Network theory / Visibility graph / Homotopy / Motion planning / Euclidean shortest path / Mathematics / Graph theory / Applied mathematics

2013 IEEE International Conference on Robotics and Automation (ICRA) Karlsruhe, Germany, May 6-10, 2013 Online Motion Planning for Tethered Robots in Extreme Terrain Melissa M. Tanner1 , Joel W. Burdick 1 , and Issa A. D

Add to Reading List

Source URL: www.kiss.caltech.edu

Language: English - Date: 2014-05-23 13:34:26
UPDATE