279 search results - page 37 / 56 » Implicit Convex Polygons |
ALGORITHMICA
1998
13 years 7 months ago
1998
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
IJRR
2002
13 years 7 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
JCT
2007
13 years 7 months ago
2007
A k-triangulation of a convex polygon is a maximal set of diagonals so that no k + 1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
We introduce a novel method for face recognition from image sets. In our setting each test and training example is a set of images of an individual’s face, not just a single ima...
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
A triangulation of a point set Pn is a partitioning of the convex hull Conv(Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn...