5 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.DS2013★ 5 cited
Matroid and Knapsack Center Problems
Danny Z. Chen, Jian Li, Hongyu Liang +1
In the classic -center problem, we are given a metric graph, and the objective is to open nodes as centers such that the maximum distance from any vertex to its closest cent…
cs.CG2012
Weak Visibility Queries of Line Segments in Simple Polygons
Danny Z. Chen, Haitao Wang
Given a simple polygon P in the plane, we present new algorithms and data structures for computing the weak visibility polygon from any query line segment in P. We build a data str…
cs.CG2011★ 2 cited
Optimal Point Movement for Covering Circular Regions
Danny Z. Chen, Xuehou Tan, Haitao Wang +1
Given points in a circular region in the plane, we study the problems of moving the points to its boundary to form a regular -gon such that the maximum (min-max) or…