Results 1  10
of
190
Rotational Polygon Overlap Minimization
 Computational Geometry: Theory and Applications
, 1997
"... 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 C, translate and rotate the polygons to a layout that minimizes an overlap measure. A (local) overlap minimum has the property that ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
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 C, translate and rotate the polygons to a layout that minimizes an overlap measure. A (local) overlap minimum has the property
Rotational Polygon Overlap Minimization and Compaction
 Computational Geometry: Theory and Applications
, 1998
"... An effective and fast algorithm is given for rotational overlap minimization: given an overlapping layout of polygons P 1 ,P 2 ,P 3 ,...,P k in a container polygon Q, translate and rotate the polygons to diminish their overlap to a local minimum. A (local) overlap minimum has the property that any p ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
An effective and fast algorithm is given for rotational overlap minimization: given an overlapping layout of polygons P 1 ,P 2 ,P 3 ,...,P k in a container polygon Q, translate and rotate the polygons to diminish their overlap to a local minimum. A (local) overlap minimum has the property that any
The Combinatorics of Overlapping Convex Polygons in Contact
 CANAD. CONF. COMPUT. GEOM.
, 1992
"... We consider the following problem: given any two convex polygons which are free to translate and rotate arbitrarily in the plane and which have m and n vertices respectively, what is the maximum number of ways they may contact each other such that three independent boundary contacts are made? This p ..."
Abstract
 Add to MetaCart
We consider the following problem: given any two convex polygons which are free to translate and rotate arbitrarily in the plane and which have m and n vertices respectively, what is the maximum number of ways they may contact each other such that three independent boundary contacts are made
On Polygonal Covers
, 1997
"... A polygonal cover of a finite collection of pairwise disjoint convex compact sets in the plane is a finite collection of nonoverlapping bounded convex polygons such that each polygon covers exactly one convex set. We show that computing a polygonal cover with worst case minimal number of sides redu ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
A polygonal cover of a finite collection of pairwise disjoint convex compact sets in the plane is a finite collection of nonoverlapping bounded convex polygons such that each polygon covers exactly one convex set. We show that computing a polygonal cover with worst case minimal number of sides
Translational Polygon Containment and Minimal Enclosure using Geometric Algorithms and Mathematical Programming
, 1995
"... We present an algorithm for the twodimensional translational containment problem: find translations for k polygons (with up to m vertices each) which place them inside a polygonal container (with n vertices) without overlapping. The polygons and container may be nonconvex. The containment algorit ..."
Abstract

Cited by 29 (13 self)
 Add to MetaCart
We present an algorithm for the twodimensional translational containment problem: find translations for k polygons (with up to m vertices each) which place them inside a polygonal container (with n vertices) without overlapping. The polygons and container may be nonconvex. The containment
A new convexity measure for polygons
 IEEE Transactions on Pattern Analysis and Machine Intelligence
"... Convexity estimators are commonly used in the analysis of shape. In this paper we define and evaluate a new easily computable measure of convexity for polygons. Let be an arbitrary polygon. If denotes the perimeter in the sense of metrics of the polygon obtained by the rotation of by angle ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
with the origin as the center of the applied rotation, and if is the Euclidean perimeter of the minimal rectangle having the edges parallel to coordinate axes which includes such a rotated polygon , then we show that defined as can be used as an estimate for the convexity of . Several desirable
A Convexity Measurement for Polygons
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2002
"... Convexity estimators are commonly used in the analysis of shape. In this paper we define and evaluate a new easily computable measure of convexity for polygons. Let P be an arbitrary polygon. If 7 ) (P, c) denotes the perimeter in the sense of l metrics of the polygon obtained by the rotation of ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
of P by angle c with the origin as the center of the applied rotation, and if 7)2 (R(P, c)) is the Euclidean perimeter of the minimal rectangle R(P, c) having the edges parallel to coordinate axes which includes such a rotated polygon P, then we show that C(P) defined as C(P) = min 7)2(R(P,c)) a C
Probabilistic Matching of polygons
, 2008
"... We analyze a probabilistic algorithm for matching plane compact sets with sufficiently nice boundaries under translations and rigid motions (rotation and translation). Given shapes A and B, the algorithm computes a transformation t such that with high probability the area of overlap of t(A) and B is ..."
Abstract
 Add to MetaCart
We analyze a probabilistic algorithm for matching plane compact sets with sufficiently nice boundaries under translations and rigid motions (rotation and translation). Given shapes A and B, the algorithm computes a transformation t such that with high probability the area of overlap of t(A) and B
Rotational polygon containment and minimum enclosure using only robust 2D constructions
 Computational Geometry
, 1998
"... An algorithm and a robust floating point implementation is given for rotational polygon containment:given polygons P 1 ,P 2 ,P 3 ,...,P k and a container polygon C, find rotations and translations for the k polygons that place them into the container without overlapping. A version of the algorithm a ..."
Abstract

Cited by 36 (6 self)
 Add to MetaCart
An algorithm and a robust floating point implementation is given for rotational polygon containment:given polygons P 1 ,P 2 ,P 3 ,...,P k and a container polygon C, find rotations and translations for the k polygons that place them into the container without overlapping. A version of the algorithm
Results 1  10
of
190