A New Algorithm for Euclidean Shortest Paths in the Plane

Haitao Wang

Type: Preprint

Publication Date: 2021-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.2102.12589

View

Locations

arXiv (Cornell University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	A new algorithm for Euclidean shortest paths in the plane	2021	Haitao Wang
+ PDF Chat	A New Algorithm for Euclidean Shortest Paths in the Plane	2023	Haitao Wang
+	Shortest Paths Among Obstacles in the Plane Revisited	2020	Haitao Wang
+ PDF Chat	Shortest Paths Among Obstacles in the Plane Revisited	2021	Haitao Wang
+	Computing L1 Shortest Paths among Polygonal Obstacles in the Plane	2012	Danny Z. Chen Haitao Wang
+	Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane	2017	Haitao Wang
+ PDF Chat	Computing Shortest Paths among Curved Obstacles in the Plane	2015	Danny Z. Chen Haitao Wang
+	An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains	2015	Joseph S. B. Mitchell Valentin Polishchuk Mikko Sysikaski Haitao Wang
+	Computing Shortest Paths among Curved Obstacles in the Plane	2011	Danny Z. Chen Haitao Wang
+	A near optimal algorithm for finding Euclidean shortest path in polygonal domain	2010	R. Inkulu Sanjiv Kapoor Sachin Maheshwari
+ PDF Chat	Two-point L1 shortest path queries in the plane	2016	Danny Z. Chen R. Inkulu Haitao Wang
+	Two-Point $L_1$ Shortest Path Queries in the Plane	2014	Danny Z. Chen R. Inkulu Haitao Wang
+ PDF Chat	Two-Point L1 Shortest Path Queries in the Plane	2014	Danny Z. Chen R. Inkulu Haitao Wang
+ PDF Chat	Computing shortest paths among curved obstacles in the plane	2013	Danny Z. Chen Haitao Wang
+ PDF Chat	Computing shortest paths among curved obstacles in the plane	2013	Danny Z. Chen Haitao Wang
+ PDF Chat	Computing $$L_1$$ Shortest Paths Among Polygonal Obstacles in the Plane	2019	Danny Z. Chen Haitao Wang
+	Approximate Euclidean shortest paths in polygonal domains	2015	R. Inkulu Sanjiv Kapoor
+	Approximate Euclidean shortest paths in polygonal domains	2015	R. Inkulu Sanjiv Kapoor
+	Geodesic Fr\'echet Distance Inside a Simple Polygon	2008	Atlas F. Cook Carola Wenk
+ PDF Chat	EHL*: Memory-Budgeted Indexing for Ultrafast Optimal Euclidean Pathfinding	2024	Jinchun Du Bojie Shen Muhammad Aamir Cheema

Cited by (0)

Action	Title	Year	Authors

Citing (8)

Action	Title	Year	Authors
+	A near optimal algorithm for finding Euclidean shortest path in polygonal domain	2010	R. Inkulu Sanjiv Kapoor Sachin Maheshwari
+	RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS	1992	Kenneth L. Clarkson Richard Cole Robert E. Tarjan
+ PDF Chat	Computing Shortest Paths among Curved Obstacles in the Plane	2015	Danny Z. Chen Haitao Wang
+ PDF Chat	Two-point L1 shortest path queries in the plane	2016	Danny Z. Chen R. Inkulu Haitao Wang
+	L1 shortest path queries in simple polygons	2019	Sang Won Bae Haitao Wang
+	A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains	2020	Haitao Wang
+ PDF Chat	Computing $$L_1$$ Shortest Paths Among Polygonal Obstacles in the Plane	2019	Danny Z. Chen Haitao Wang
+ PDF Chat	Shortest Paths Among Obstacles in the Plane Revisited	2021	Haitao Wang