Haitao Wang

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Dynamic Convex Hulls for Simple Paths	2025	Bruce Brewer Gerth Stølting Brodal Haitao Wang
+ PDF Chat	Dynamic Unit-Disk Range Reporting	2024	Haitao Wang Yiming Zhao
+ PDF Chat	On the Line-Separable Unit-Disk Coverage and Related Problems	2024	Gang Liu Haitao Wang
+ PDF Chat	Algorithms for Subpath Convex Hull Queries and Ray-Shooting among Segments	2024	Haitao Wang
+ PDF Chat	An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs	2024	Bruce W. Brewer Haitao Wang
+ PDF Chat	On Line-Separable Weighted Unit-Disk Coverage and Related Problems	2024	Gang Liu Haitao Wang
+	Algorithms for Computing Closest Points for Segments	2024	Haitao Wang
+ PDF Chat	A New Algorithm for Euclidean Shortest Paths in the Plane	2023	Haitao Wang
+	Improved Algorithms for Distance Selection and Related Problems	2023	Haitao Wang Yiming Zhao
+ PDF Chat	On the Planar Two-Center Problem and Circular Hulls	2022	Haitao Wang
+ PDF Chat	Constructing Many Faces in Arrangements of Lines and Segments	2022	Haitao Wang
+ PDF Chat	A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines	2022	Haitao Wang
+ PDF Chat	Improved algorithms for the bichromatic two-center problem for pairs of points	2021	Haitao Wang Jie Xue
+	A new algorithm for Euclidean shortest paths in the plane	2021	Haitao Wang
+ PDF Chat	A linear-time algorithm for radius-optimally augmenting paths in a metric space	2021	Christopher Johnson Haitao Wang
+ PDF Chat	Shortest Paths Among Obstacles in the Plane Revisited	2021	Haitao Wang
+	A New Algorithm for Euclidean Shortest Paths in the Plane	2021	Haitao Wang
+	An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons	2021	Haitao Wang
+ PDF Chat	An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees	2021	Haitao Wang Jingru Zhang
+ PDF Chat	Algorithms for the Line-Constrained Disk Coverage and Related Problems	2021	Logan Pedersen Haitao Wang
+	A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines	2021	Haitao Wang
+ PDF Chat	A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space	2020	Haitao Wang Yiming Zhao
+	A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains	2020	Haitao Wang
+ PDF Chat	Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs	2020	Haitao Wang Jie Xue
+	On the Planar Two-Center Problem and Circular Hulls	2020	Haitao Wang
+	Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments	2020	Haitao Wang
+ PDF Chat	Bicriteria Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane	2019	Haitao Wang
+ PDF Chat	Covering Uncertain Points in a Tree	2019	Haitao Wang Jingru Zhang
+ PDF Chat	Computing $$L_1$$ Shortest Paths Among Polygonal Obstacles in the Plane	2019	Danny Z. Chen Haitao Wang
+	A Divide-and-Conquer Algorithm for Two-Point $L_1$ Shortest Path Queries in Polygonal Domains	2019	Haitao Wang
+	Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs	2019	Haitao Wang Jie Xue
+ PDF Chat	Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points	2019	Haitao Wang Jie Xue
+ PDF Chat	A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space	2019	Christopher Johnson Haitao Wang
+	A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space	2019	Christopher Johnson Haitao Wang
+ PDF Chat	Algorithms for covering multiple barriers	2018	Shimin Li Haitao Wang
+ PDF Chat	An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains	2018	Joseph S. B. Mitchell Valentin Polishchuk Mikko Sysikaski Haitao Wang
+ PDF Chat	Algorithms for Covering Multiple Barriers	2017	Shimin Li Haitao Wang
+	Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane	2017	Haitao Wang
+	Algorithms for Covering Multiple Barriers	2017	Shimin Li Haitao Wang
+ PDF Chat	An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains	2015	Joseph S. B. Mitchell Valentin Polishchuk Mikko Sysikaski 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
+	Linear Time Approximation Schemes for Geometric Maximum Coverage	2015	Jian Li Haitao Wang Bowei Zhang Ningye Zhang
+ PDF Chat	Optimal Point Movement for Covering Circular Regions	2012	Danny Z. Chen Xuehou Tan Haitao Wang Gangshan Wu
+ PDF Chat	Weak Visibility Queries of Line Segments in Simple Polygons	2012	Danny Z. Chen Haitao Wang
+ PDF Chat	An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles	2011	Danny Z. Chen Haitao Wang
+	An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles	2010	Danny Z. Chen Haitao Wang

Common Coauthors

Coauthor	Papers Together
Danny Z. Chen	5
Jie Xue	4
Joseph S. B. Mitchell	3
Shimin Li	3
Mikko Sysikaski	3
Valentin Polishchuk	3
Christopher Johnson	2
Jingru Zhang	2
Gang Liu	1
Bowei Zhang	1
Christopher Johnson	1
Gangshan Wu	1
Gang Liu	1
Jian Li	1
Yiming Zhao	1
Bruce W. Brewer	1
Xuehou Tan	1
Logan Pedersen	1
Gerth Stølting Brodal	1
Yiming Zhao	1
Ningye Zhang	1
Yiming Zhao	1
Bruce Brewer	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Two-point L1 shortest path queries in the plane	2016	Danny Z. Chen R. Inkulu Haitao Wang	7
+	Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems	1983	Nimrod Megiddo	6
+	Minimum-link paths revisited	2014	Joseph S. B. Mitchell Valentin Polishchuk Mikko Sysikaski	5
+ PDF Chat	Computing $$L_1$$ Shortest Paths Among Polygonal Obstacles in the Plane	2019	Danny Z. Chen Haitao Wang	5
+	An efficient algorithm for the Euclidean two-center problem	1994	Jerzy W. Jaromczyk Mirosław Kowaluk	4
+	Bichromatic 2-center of pairs of points	2014	Esther M. Arkin José Miguel Díaz-Báñez Ferrán Hurtado Piyush Kumar Joseph S. B. Mitchell Belén Palop Pablo Pérez-Lantero Maria Saumell Rodrigo I. Silveira	4
+ PDF Chat	A Near-Linear Algorithm for the Planar 2-Center Problem	1997	Micha Sharir	4
+	More planar two-center algorithms	1999	Timothy M. Chan	4
+ PDF Chat	Computing Shortest Paths among Curved Obstacles in the Plane	2015	Danny Z. Chen Haitao Wang	4
+ PDF Chat	Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms	1990	Herbert Edelsbrunner Ernst P. Mücke	4
+	Two-Point $L_1$ Shortest Path Queries in the Plane	2014	Danny Z. Chen R. Inkulu Haitao Wang	3
+ PDF Chat	An improved algorithm for diameter-optimally augmenting paths in a metric space	2018	Haitao Wang	3
+	A near optimal algorithm for finding Euclidean shortest path in polygonal domain	2010	R. Inkulu Sanjiv Kapoor Sachin Maheshwari	3
+ PDF Chat	Optimal Point Movement for Covering Circular Regions	2013	Danny Z. Chen Xuehou Tan Haitao Wang Gangshan Wu	3
+ PDF Chat	Augmenting Graphs to Minimize the Diameter	2014	Fabrizio Frati Serge Gaspers Joachim Gudmundsson Luke Mathieson	3
+ PDF Chat	Decreasing the diameter of bounded degree graphs	2000	Noga Alon Andr�s Gy�rf�s Mikl�s Ruszink�	3
+	L1 shortest path queries in simple polygons	2019	Sang Won Bae Haitao Wang	3
+ PDF Chat	Minimizing the Aggregate Movements for Interval Coverage	2016	A. M. Andrews Haitao Wang	2
+	Decreasing the diameter of bounded degree graphs	2000	Noga Alon András Gyárfás Miklós Ruszinkó	2
+ PDF Chat	Dynamic planar convex hull	2003	Gerth Stølting Brodal Riko Jacob	2
+	Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points	2019	Haitao Wang Jie Xue	2
+	A Divide-and-Conquer Algorithm for Two-Point $L_1$ Shortest Path Queries in Polygonal Domains	2019	Haitao Wang	2
+ PDF Chat	Two-Point L1 Shortest Path Queries in the Plane	2014	Danny Z. Chen R. Inkulu Haitao Wang	2
+	Some dynamic computational geometry problems	1985	Mikhail J. Atallah	2
+	An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains	2015	Joseph S. B. Mitchell Valentin Polishchuk Mikko Sysikaski Haitao Wang	2
+	Shortest paths in intersection graphs of unit disks	2014	Sergio Cabello Miha Jejčič	2
+	RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS	1992	Kenneth L. Clarkson Richard Cole Robert E. Tarjan	2
+ PDF Chat	Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications	2005	Jie Gao Li Zhang	2
+ PDF Chat	Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points	2019	Haitao Wang Jie Xue	2
+ PDF Chat	Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon	2019	Eunjin Oh Hee-Kap Ahn	2
+	An Efficient Algorithm for 2D Euclidean 2-Center with Outliers	2008	Pankaj K. Agarwal Jeff M. Phillips	2
+	Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees	2016	Ulrike Große Joachim Gudmundsson Christian Knauer Michiel Smid Fabian Stehn	2
+ PDF Chat	Shortest Paths Among Obstacles in the Plane Revisited	2021	Haitao Wang	2
+	Stochastic <i>k</i>-Center and <i>j</i>-Flat-Center Problems	2017	Lingxiao Huang Jian Li	1
+ PDF Chat	Almost optimal algorithms for diameter-optimally augmenting trees	2022	Davide Bilò	1
+	Convex Hulls under Uncertainty	2014	Pankaj K. Agarwal Sariel Har-Peled Subhash Suri Hakan Yıldız Wuzhou Zhang	1
+	Computing the geodesic centers of a polygonal domain	2015	Sang Won Bae Matias Korman Yoshio Okamoto	1
+ PDF Chat	A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs	2018	Mark de Berg Hans L. Bodlaender Sándor Kisfaludi-Bak Dániel Marx Tom C. van der Zanden	1
+ PDF Chat	Covering Uncertain Points in a Tree	2017	Haitao Wang Jingru Zhang	1
+ PDF Chat	A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space	2019	Christopher Johnson Haitao Wang	1
+ PDF Chat	The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon	2019	Eunjin Oh Luis Barba Hee-Kap Ahn	1
+ PDF Chat	Convex Hulls under Uncertainty	2014	Pankaj K. Agarwal Sariel Har-Peled Subhash Suri Hakan Yıldız Wuzhou Zhang	1
+ PDF Chat	Algorithms for Subpath Convex Hull Queries and Ray-Shooting among Segments	2024	Haitao Wang	1
+	A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space	2020	Haitao Wang Yiming Zhao	1
+	Optimal Time-Convex Hull under the Lp Metrics	2013	Bang-Sin Dai Mong-Jen Kao D. T. Lee	1
+ PDF Chat	Algorithms for the Line-Constrained Disk Coverage and Related Problems	2021	Logan Pedersen Haitao Wang	1
+ PDF Chat	A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines	2022	Haitao Wang	1
+ PDF Chat	Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees	2022	Timothy M. Chan Da Wei Zheng	1
+	Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications	2017	Haim Kaplan Wolfgang Mulzer Liam Roditty Paul Seiferth Micha Sharir	1
+	A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines	2021	Haitao Wang	1