839 search results - page 104 / 168 » Three-Clustering of Points in the Plane |
ASPDAC
2001
ACM
14 years 2 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
CCCG
2006
13 years 11 months ago
2006
A flip or edge-replacement is considered as a transformation by which one edge e of a geometric object is removed and an edge f (f = e) is inserted such that the resulting object ...
DCG
2007
13 years 10 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
PAMI
2006
13 years 10 months ago
2006
: This article addresses the problem of estimating the motion of a camera as it observes the outline (or apparent contour) of a solid bounded by a smooth surface in successive imag...
ICCV
2005
IEEE
15 years 7 days ago
2005
IEEE
When deploying a heterogeneous camera network or when we use cheap zoom cameras like in cell-phones, it is not practical, if not impossible to off-line calibrate the radial distor...