Qizheng He

activity

20172026

most citedDistributed Edge Coloring with Small Palettes and a Special Case of the Constructive Lovász Local Lemma

26 citations · 42 across the 10 of their papers we have counts for

collaborators

Showing cs.CGShow all

5 papers · 1 filter

cs.CG2026

How to Catch $k$ Grid Points

Sariel Har-Peled, Elfarouk Harb, Qizheng He

Given a positive integer $k$ , we study the problem of finding a convex polygon of minimum perimeter that encloses exactly $k$ points of $Z^{2}$ . We show that an optimal poly…

cs.CG2024

Enclosing Points with Geometric Objects

Timothy M. Chan, Qizheng He, Jie Xue

Let $X$ be a set of points in $R^{2}$ and $O$ be a set of geometric objects in $R^{2}$ , where $∣ X ∣ + ∣ O ∣ = n$ . We study the problem of computing a…

cs.CG2021

Dynamic Geometric Set Cover, Revisited

Timothy M. Chan, Qizheng He, Subhash Suri +1

Geometric set cover is a classical problem in computational geometry, which has been extensively studied in the past. In the dynamic version of the problem, points and ranges may b…

cs.CG2021

More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time

Timothy M. Chan, Qizheng He

We study geometric set cover problems in dynamic settings, allowing insertions and deletions of points and objects. We present the first dynamic data structure that can maintain an…

cs.CG2020

Faster Approximation Algorithms for Geometric Set Cover