Haitao Wang

collaborators

2 papers

cs.CG2025

Shortest Paths on Convex Polyhedral Surfaces

Haitao Wang

Let $P$ be the surface of a convex polyhedron with $n$ vertices. We consider the two-point shortest path query problem for $P$ : Constructing a data structure so…

cs.CG2025

Computing Maximum Cliques in Unit Disk Graphs

Anastasiia Tkachenko, Haitao Wang

Given a set $P$ of $n$ points in the plane, the unit-disk graph $G (P)$ is a graph with $P$ as its vertex set such that two points of $P$ have an edge if their Euclidean distance is…