839 search results - page 39 / 168 » Three-Clustering of Points in the Plane |
CVPR
2005
IEEE
14 years 11 months ago
2005
IEEE
This paper presents a novel method for reconstructing complex 3D objects with unknown topology using silhouettes extracted from image sequences. This method exploits the duality p...
DCG
2007
13 years 9 months ago
2007
Let C be a cone in R3 whose base B is a planar convex body in a horizontal plane π and whose tip is a point v /∈ π. Let C be a packing formed by translates of C and −C in R3...
CORR
2002
Springer
13 years 8 months ago
2002
Springer
In this paper we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we sh...
CCCG
2010
13 years 10 months ago
2010
Given a set R of red points and a set B of blue points in the plane of total size n, we study the problem of determining all angles for which there exists an L-shape containing al...
GD
2000
Springer
14 years 18 days ago
2000
Springer
Abstract. We deal with a map-labeling problem, named LOFL (Leftpart Ordered Flexible Labeling), to label a set of points in a plane with polygonal obstacles. The label for each poi...