67 search results - page 8 / 14 » Approximate convex decomposition of polygons |
131
click to vote
ECCV
2010
Springer
14 years 9 months ago
2010
Springer
Given a set of points corresponding to a 2D projection of a non-planar shape, we would like to obtain a representation invariant to articulations (under no self-occlusions). It is ...
JCB
2007
14 years 11 months ago
2007
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
113
click to vote
COMPGEOM
2011
ACM
14 years 3 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
101
click to vote
TIP
1998
14 years 11 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
100
click to vote
CCE
2004
14 years 11 months ago
2004
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...