839 search results - page 72 / 168 » Three-Clustering of Points in the Plane |
ICCV
2003
IEEE
14 years 3 months ago
2003
IEEE
This article proposes a novel approach on how to rectify the photo image of the bound document. The surface of the document is modeled by a cylindrical surface. By the geometry of...
CCCG
2007
13 years 11 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
VMV
2001
13 years 11 months ago
2001
Sampling points with blue noise spectral characteristics are best suited for antialiasing. Compared to Poisson disk sampling, Lloyd's relaxation scheme yields samples that ap...
IJCAI
1993
13 years 11 months ago
1993
Though arrangement knowledge is well suited for qualitative representations of spatial situations, if we only use this kind of knowledge, we cannot do interesting inferences about...