Optimizing generalized kernels of polygons

DOI10.1007/s10898-021-01020-3zbMath1473.51020arXiv1802.05995OpenAlexW3156845128MaRDI QIDQ2046316

Alejandra Martínez-Moraian, Carlos Seara, Leonidas Palios, David Orden, Paweł Żyliński

Publication date: 17 August 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.05995

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (1)

Separating bichromatic point sets in the plane by restricted orientation convex hulls

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• On-line construction of the convex hull of a simple polyline
• A linear algorithm for finding the convex hull of a simple polygon
• Multiple-guard kernels of simple polygons
• An Optimal Algorithm for Finding the Kernel of a Polygon
• Computing common tangents without a separating line

This page was built for publication: Optimizing generalized kernels of polygons