839 search results - page 45 / 168 » Three-Clustering of Points in the Plane |
COMPGEOM
2001
ACM
14 years 20 days ago
2001
ACM
Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different
CCCG
2010
13 years 10 months ago
2010
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by ha...
CCCG
2010
13 years 10 months ago
2010
Given a set S of n points in the plane and a fixed angle 0 < < , we show how to find all triangles of minimum area with angle that enclose S in O(n log n) time.
COMPGEOM
1991
ACM
14 years 16 days ago
1991
ACM
Given a set of points in the plane, a crossing family is a collection of line segments, each joining two of the points, such that any two line segments intersect internally. Two s...
IROS
2007
IEEE
14 years 3 months ago
2007
IEEE
— On this paper, inertial orientation measurements are exploited to compensate the rotational degrees of freedom for an aerial vehicle carrying a perspective camera, taking a seq...