Using sentinels to detect intersections of convex and nonconvex polygons

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

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. © 2010 SBMAC.

Cite

CITATION STYLE

APA

Mascarenhas, W. F., & Birgin, E. G. (2010). Using sentinels to detect intersections of convex and nonconvex polygons. Computational and Applied Mathematics, 29(2), 247–267. https://doi.org/10.1590/S1807-03022010000200008

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free