6 citations · 12 across the 2 of their papers we have counts for
2 papers
cs.CG2014★ 6 cited
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…
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…