7351 search results - page 113 / 1471 » Segmenting Point Sets |
112
click to vote
CCCG
2007
15 years 5 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...
227
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
106
click to vote
PREMI
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Segmentation of magnetic resonance imaging (MRI) data entails assigning tissue class labels to voxels. The primary source of segmentation error is the partial volume eff...
179
click to vote
DMTCS
2010
15 years 1 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
139
Voted
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Skeletonization algorithms typically decompose an object’s
silhouette into a set of symmetric parts, offering a
powerful representation for shape categorization. However,
havi...