Using sentinels to detect intersections of convex and nonconvex polygons
Contribuinte(s) |
UNIVERSIDADE DE SÃO PAULO |
---|---|
Data(s) |
26/03/2012
26/03/2012
2010
|
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. |
Identificador |
Computational & Applied Mathematics, v.29, n.2, p.247-267, 2010 1807-0302 http://producao.usp.br/handle/BDPI/11960 10.1590/S1807-03022010000200008 http://www.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022010000200008 |
Idioma(s) |
eng |
Publicador |
Sociedade Brasileira de Matemática Aplicada e Computacional |
Relação |
Computational & Applied Mathematics |
Direitos |
openAccess Copyright Sociedade Brasileira de Matemática Aplicada e Computacional |
Palavras-Chave | #Sentinels #Polygons #Intersection #Packing #Nonlinear programming |
Tipo |
article original article publishedVersion |