Using sentinels to detect intersections of convex and nonconvex polygons

AUTOR(ES)

Mascarenhas, W.F., Birgin, E.G.

FONTE

Computational & Applied Mathematics

DATA DE PUBLICAÇÃO

2010-06

RESUMO

We describe finite sets of points, called sentinels, which allow us to decide if isometric copies of polygons, convex or not, intersect. As an example of the applicability of the concept of sentinel, we explain how they can be used to formulate an algorithm based on the optimization of differentiable models to pack polygons in convex sets. Mathematical subject classification: 90C53, 65K05.

Documentos Relacionados

• A CONVEX APPROXIMANT METHOD FOR NONCONVEX EXTENSIONS OF GEOMETRIC PROGRAMMING*
• Rotational placement of irregular polygons over containers with fixed dimensions using simulated annealing and no-fit polygons
• Estudo do recozimento simulado e do polígono de obstrução aplicados ao problema de empacotamento rotacional de polígonos irregulares não-convexos em recipientes fechados.
• Using Computer Technology to Detect, Measure, and Prevent Adverse Drug Events
• Issues Associated with and Recommendations for Using PCR To Detect Outbreaks of Pertussis