15 citations · 74 across the 39 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
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.CG2012★ 15 cited
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…
cs.CG2012★ 6 cited
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…