Computing smallest convex intersecting polygons

DOI10.4230/LIPICS.ESA.2022.9MaRDI QIDQ6969680zbMATH OpenFDO

Authors Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos

Publication date 19 June 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2022.9

zbMATH Keywords

computational geometryconvex hullimprecise points

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A faster algorithm for solving general LPs
• A PTAS for Euclidean TSP with hyperplane neighborhoods
• Approximating largest convex hulls for imprecise points
• Convex hulls of finite sets of points in two and three dimensions
• scientific article; zbMATH DE number 6776481 (Why is no real title available?)
• Largest and smallest convex hulls for imprecise points
• Minimum-perimeter intersecting polygons
• On the identification of the convex hull of a finite set of points in the plane
• The touring rays and related problems
• The traveling salesman problem for lines and rays in the plane
• Touring a sequence of polygons

This page was built for publication: Computing smallest convex intersecting polygons

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