113 search results - page 7 / 23 » On the Area Bisectors of a Polygon |
101
click to vote
COMPGEOM
1997
ACM
15 years 6 months ago
1997
ACM
An effective and fast algorithm is given for rotational overlap minimization: given an overlapping layout of polygons P1, P2, P3, . . . , Pk in a container polygon Q, translate an...
127
click to vote
MVA
2007
15 years 3 months ago
2007
This paper presents a new approach to extracting and representing structural features of images. The approach is based on both a region-based analysis and a contour-based analysis...
103
Voted
JCDCG
1998
Springer
15 years 6 months ago
1998
Springer
We study the minimum number g(m, n) (respectively, p(m, n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygo...
108
Voted
WSCG
2004
15 years 3 months ago
2004
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
108
click to vote
GEOINFORMATICA
2008
15 years 1 months ago
2008
Skeletonization of polygons is a technique, which is often applied to problems of cartography and geographic information science. Especially it is needed for generalization tasks ...