7351 search results - page 1 / 1471 » Segmenting Point Sets |
SMI
2006
IEEE
13 years 10 months ago
2006
IEEE
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
FSTTCS
2007
Springer
13 years 10 months ago
2007
Springer
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We consider the number of different ways to divide a rectangle containing n noncorectilinear points into smaller rectangles by n non-intersecting axis-parallel segments,...
CCCG
2006
13 years 5 months ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
CAIP
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. We propose a new computational method for segmenting topological sub-dimensional point-sets in scalar images of arbitrary spatial dimensions. The technique is based on co...