Sciweavers

5019 search results - page 95 / 1004
» On the Reflexivity of Point Sets
Sort
View
MLDM
2005
Springer
15 years 12 months ago
Clustering Large Dynamic Datasets Using Exemplar Points
In this paper we present a method to cluster large datasets that change over time using incremental learning techniques. The approach is based on the dynamic representation of clus...
William Sia, Mihai M. Lazarescu
ICCV
1995
IEEE
15 years 10 months ago
In Defence of the 8-Point Algorithm
The fundamental matrix is a basic tool in the analysis of scenes taken with two uncalibrated cameras, and the 8-point algorithm is a frequently cited method for computing the fund...
Richard I. Hartley
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
15 years 7 months ago
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
Delaunay tessellations and Voronoi diagrams capture proximity relationships among sets of points in any dimension. When point coordinates are not known exactly, as in the case of ...
Deepak Bandyopadhyay, Jack Snoeyink
IEICET
2006
55views more  IEICET 2006»
15 years 6 months ago
Inserting Points Uniformly at Every Instance
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjam...
JCO
2006
128views more  JCO 2006»
15 years 6 months ago
A combinatorial theorem on labeling squares with points and its application
In this paper, we present a combinatorial theorem on labeling disjoint axis-parallel squares of edge length two using points. Given an arbitrary set of disjoint axis-parallel squar...
Binhai Zhu, Minghui Jiang