Using sentinels to detect intersections of convex and nonconvex polygons
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.
Saved in:
Main Authors: | , |
---|---|
Format: | Digital revista |
Language: | English |
Published: |
Sociedade Brasileira de Matemática Aplicada e Computacional
2010
|
Online Access: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022010000200008 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|