839 search results - page 13 / 168 » Three-Clustering of Points in the Plane |
STOC
1994
ACM
13 years 11 months ago
1994
ACM
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
CCCG
2007
13 years 9 months ago
2007
We give a simple O(n log n) algorithm to compute the convex hull of the (possibly Θ(n2 )) intersection points in an arrangement of n line segments in the plane. We also show an a...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We propose an energy-based framework for approximating surfaces from a cloud of point measurements corrupted by noise and outliers. Our energy assigns a tangent plane to each (noi...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We introduce global regularities in the 2.5D building modeling problem, to reflect the orientation and placement similarities between planar elements in building structures. Give...
CVIU
2007
13 years 7 months ago
2007
We investigate the problem of automatically creating 3D models of man-made environments that we represent as collections of textured planes. A typical approach is to automatically...