Sciweavers

839 search results - page 85 / 168
» Three-Clustering of Points in the Plane
Sort
View
SODA
1992
ACM
109views Algorithms» more  SODA 1992»
13 years 11 months ago
New Algorithms for Minimum Area k-gons
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
David Eppstein
ADCM
2006
110views more  ADCM 2006»
13 years 10 months ago
Interpolation on lattices generated by cubic pencils
: Principal lattices are distributions of points in the plane obtained from a triangle by drawing equidistant parallel lines to the sides and taking the intersection points as node...
Jesús M. Carnicer, Mariano Gasca
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 7 months ago
Shortest path problem in rectangular complexes of global nonpositive curvature
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
Victor Chepoi, Daniela Maftuleac
COMPGEOM
2011
ACM
13 years 1 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
MVA
2000
164views Computer Vision» more  MVA 2000»
13 years 11 months ago
Visual Screen: Transforming an Ordinary Screen into a Touch Screen
Touch screens are very convenient because one can directly point to where it is interesting. This paper presents an inexpensive technique to transform an ordinary screen into a to...
Zhengyou Zhang, Ying Shan