98 citations · 365 across the 61 of their papers we have counts for
Showing 2008 · cs.CGShow all
3 papers · 2 filters
cs.CG2008★ 2 cited
Shape Fitting on Point Sets with Probability Distributions
Maarten Loffler, Jeff M. Phillips
A typical computational geometry problem begins: Consider a set P of n points in R^d. However, many applications today work with input that is not precisely known, for example when…
cs.CG2008
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
Pankaj K. Agarwal, Jeff M. Phillips
For a set P of n points in R^2, the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2,k)-center problem whe…
cs.CG2008★ 9 cited
Algorithms for eps-approximations of Terrains
Jeff M. Phillips
Consider a point set D with a measure function w : D -> R. Let A be the set of subsets of D induced by containment in a shape from some geometric family (e.g. axis-aligned rectangl…