Haitao Wang

activity

20242026

collaborators

8 papers

cs.CG2026

Maximum Independent Sets in Disk Graphs with Disks in Convex Position

Anastasiia Tkachenko, Haitao Wang

For a set $D$ of disks in the plane, its disk graph $G (D)$ is the graph with vertex set $D$ , where two vertices are adjacent if and only if the corres…

cs.CG2026

Shortest Paths in Geodesic Unit-Disk Graphs

Bruce W. Brewer, Haitao Wang

Let $S$ be a set of $n$ points in a polygon $P$ with $m$ vertices. The geodesic unit-disk graph $G (S)$ induced by $S$ has vertex set $S$ and contains an edge between two vertices w…

cs.CG2026

An Optimal Algorithm for Computing Many Faces in Line Arrangements

Haitao Wang

Given a set of $m$ points and a set of $n$ lines in the plane, we consider the problem of computing the faces of the arrangement of the lines that contain at least one point. In th…

cs.CG2026

Computing Dominating Sets in Disk Graphs with Centers in Convex Position

Anastasiia Tkachenko, Haitao Wang

Given a set $P$ of $n$ points in the plane and a collection of disks centered at these points, the disk graph $G (P)$ has vertex set $P$ , with an edge between two vertices if their…

cs.CG2025

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs

Bruce W. Brewer, Haitao Wang

Given in the plane a set $S$ of $n$ points and a set of disks centered at these points, the disk graph $G (S)$ induced by these disks has vertex set $S$ and an edge between two vert…

cs.CG2025

Minimum-Weight Half-Plane Hitting Set

Gang Liu, Haitao Wang

Given a set $P$ of $n$ weighted points and a set $H$ of $n$ half-planes in the plane, the hitting set problem is to compute a subset $P^{'}$ of points from $P$ such that each half-pla…