164 search results - page 8 / 33 » Outlier-Robust Convex Segmentation |
160
Voted
CCCG
2006
15 years 4 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...
103
click to vote
PAMI
2006
15 years 3 months ago
2006
In this article we present a novel convexity measure for object shape analysis. The proposed method is based on the idea of generating pairs of points from a set, and measuring th...
140
click to vote
SODA
1992
ACM
15 years 4 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...
120
click to vote
DCG
2010
15 years 3 months ago
2010
We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron ...
124
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We show that cutting shortest paths from every vertex of a convex polyhedron to a simple closed quasigeodesic, and cutting all but a short segment of the quasigeodesic, unfolds th...