220 citations · 458 across the 35 of their papers we have counts for
9 papers · 1 filter
On Clustering Induced Voronoi Diagrams
Danny Z. Chen, Ziyun Huang, Yangwei Liu +1
In this paper, we study a generalization of the classical Voronoi diagram, called clustering induced Voronoi diagram (CIVD). Different from the traditional model, CIVD takes as its…
Two-Point Shortest Path Queries in the Plane
Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang
Let be a set of pairwise-disjoint polygonal obstacles with a total of vertices in the plane. We consider the problem of building a data structure that can qui…
Efficient Algorithms for One-Dimensional k-Center Problems
Danny Z. Chen, Jian Li, Haitao Wang
We consider the problem of finding k centers for n weighted points on a real line. This (weighted) k-center problem was solved in O(n log n) time previously by using Cole's paramet…
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…
Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain
Danny Z. Chen, Yan Gu, Jian Li +1
In this paper, we study the problem of moving sensors on a line to form a barrier coverage of a specified segment of the line such that the maximum moving distance of the senso…
Computing L1 Shortest Paths among Polygonal Obstacles in the Plane
Danny Z. Chen, Haitao Wang
Given a point and a set of pairwise disjoint polygonal obstacles of totally vertices in the plane, we present a new algorithm for building an shortest path map of…