Sciweavers

4761 search results - page 83 / 953
» Generalizing Boundary Points
Sort
View
COMPGEOM
2007
ACM
14 years 3 days ago
Bi-criteria linear-time approximations for generalized k-mean/median/center
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
SMI
2010
IEEE
208views Image Analysis» more  SMI 2010»
13 years 6 months ago
Local Constraint-Based General Surface Deformation
—This paper develops a framework for locally deforming either a parametric surface or hierarchical subdivision surface to match a set of positional and energy minimizing constrai...
Richard Pusch, Faramarz Samavati
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
14 years 2 months ago
On Approximating the Average Distance Between Points
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
Kfir Barhum, Oded Goldreich, Adi Shraibman
CCCG
2010
13 years 9 months ago
Triangulations with many points of even degree
Let S be a set of points in the plane in general position. A triangulation of S will be called even if all the points of S have an even degree. We show how to construct a triangul...
Jorge Urrutia, Canek Peláez, Adriana Ram&ia...
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
14 years 8 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen