3 citations · 13 across the 19 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
cs.CG2010
Minimum Sum Dipolar Spanning Tree in R^3
Steven Bitner, Ovidiu Daescu
In this paper we consider finding a geometric minimum-sum dipolar spanning tree in R^3, and present an algorithm that takes O(n^2 log^2 n) time using O(n^2) space, thus almost matc…
cs.CG2010★ 2 cited
Fréchet Distance Problems in Weighted Regions
Yam Ki Cheung, Ovidiu Daescu
We discuss two versions of the Fréchet distance problem in weighted planar subdivisions. In the first one, the distance between two points is the weighted length of the line segmen…
cs.CG2010★ 3 cited
Approximate Point-to-Face Shortest Paths in R^3
Yam Ki Cheung, Ovidiu Daescu
We address the point-to-face approximate shortest path problem in R: Given a set of polyhedral obstacles with a total of n vertices, a source point s, an obstacle face f, and a rea…