Utah State University

output

19922026

most citedCharacterization of the LIGO detectors during their sixth science run

1.3k citations

Showing cs.CGShow all

27 papers · 1 filter

cs.CG2021

A New Algorithm for Euclidean Shortest Paths in the Plane

Haitao Wang

Given a set of pairwise disjoint polygonal obstacles in the plane, finding an obstacle-avoiding Euclidean shortest path between two points is a classical problem in computational g…

cs.CG2020

Shortest Paths Among Obstacles in the Plane Revisited

Haitao Wang

Given a set of pairwise disjoint polygonal obstacles in the plane, finding an obstacle-avoiding Euclidean shortest path between two points is a classical problem in computational g…

cs.CG2019★ 2 cited

Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points

Haitao Wang, Jie Xue

We consider a bichromatic two-center problem for pairs of points. Given a set $S$ of $n$ pairs of points in the plane, for every pair, we want to assign a red color to one point an…

cs.CG2019★ 1 cited

Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs

Haitao Wang, Jie Xue

We revisit a classical graph-theoretic problem, the \textit{single-source shortest-path} (SSSP) problem, in weighted unit-disk graphs. We first propose an exact (and deterministic)…

cs.CG2018★ 1 cited

$L_{1}$ Shortest Path Queries in Simple Polygons

Sang Won Bae, Haitao Wang

Let $P$ be a simple polygon of $n$ vertices. We consider two-point $L_{1}$ shortest path queries in $P$ . We build a data structure of $O (n)$ size in $O (n)$ time such that given any t…

cs.CG2017

Covering Uncertain Points in a Tree

Haitao Wang, Jingru Zhang

In this paper, we consider a coverage problem for uncertain points in a tree. Let T be a tree containing a set P of n (weighted) demand points, and the location of each demand poin…