92 search results - page 15 / 19 » Stabbers of line segments in the plane |
SODA
1992
ACM
13 years 8 months ago
1992
ACM
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
CGF
2004
13 years 7 months ago
2004
This paper presents a hybrid method for creating three-dimensional shapes by sketching silhouette curves. Given a silhouette curve, we approximate its medial axis as a set of line...
CVPR
1997
IEEE
13 years 11 months ago
1997
IEEE
In this paper we focus on using local 3D structure for segmentation. A tensor descriptor is estimated for each neighbourhood, i.e. for each voxel in the data set. The tensors are ...
SODA
1993
ACM
13 years 8 months ago
1993
ACM
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
GIS
2008
ACM
13 years 8 months ago
2008
ACM
One of the formalisms to qualitatively describe polylines in the plane are double-cross matrices. In a double-cross matrix the relative position of any two line segments in a poly...