Using sentinels to detect intersections of convex and nonconvex polygons

DOI10.1590/S1807-03022010000200008zbMATH Open1201.90202MaRDI QIDQ5962404FDOQ5962404

Authors: Walter F. Mascarenhas, E. G. Birgin 

Publication date: 22 September 2010

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Recommendations

• Method of sentinels for packing items within arbitrary convex regions
• Detecting the intersection of convex objects in the plane
• Optimal detection of intersections between convex polyhedra
• Approximation algorithms for solving packing problems of convex polygons in plane
• A simple linear algorithm for intersecting convex polygons

zbMATH Keywords

nonlinear programmingpolygonspackingintersectionsentinels

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Methods of quasi-Newton type (90C53)

Cited In (3)

• Method of sentinels for packing items within arbitrary convex regions
• Symmetry-breaking constraints for packing identical rectangles within polyhedra
• Rigorous packing of unit squares into a circle

This page was built for publication: Using sentinels to detect intersections of convex and nonconvex polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962404)