7351 search results - page 233 / 1471 » Segmenting Point Sets |
196
click to vote
ICCV
1995
IEEE
15 years 10 months ago
1995
IEEE
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...
158
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
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 ...
153
click to vote
IEICET
2006
15 years 6 months ago
2006
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 ...
169
click to vote
JCO
2006
15 years 6 months ago
2006
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...
156
click to vote
IJCGA
2002
15 years 6 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...