57 search results - page 6 / 12 » Rotationally Monotone Polygons |
MMSEC
2004
ACM
15 years 2 months ago
2004
ACM
This paper presents a high-capacity method to embed information into the geometry of a 3D polygonal mesh. The method extends a previously reported work, to which several improveme...
SODA
1996
ACM
14 years 10 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
103
click to vote
CORR
1999
Springer
14 years 9 months ago
1999
Springer
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be rotated into any member of S. We present a hinged dissection...
CCCG
2003
14 years 11 months ago
2003
Morphing algorithms aim to construct visually pleasing interpolations (morphs) between 2D or 3D shapes. One of the desirable properties of a morph is avoiding selfintersections of...
IWANN
2001
Springer
15 years 1 months ago
2001
Springer
It is presented in this paper a new approach to the problem of feature extraction. The approach is based on the edge detection, where a set of feature vectors is taken from the sou...