The complexity of computing minimum separating polygons

DOI10.1016/0167-8655(93)90140-9zbMath0781.68113OpenAlexW2063514882MaRDI QIDQ4274652

David Rappaport, Peter Eades

Publication date: 17 February 1994

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8655(93)90140-9

zbMATH Keywords

NP-hardfinite setsminimum separating polygon

Mathematics Subject Classification ID

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

Related Items (6)

Exact and heuristic solutions for the prize‐collecting geometric enclosure problem ⋮ Geometric multicut: shortest fences for separating groups of objects in the plane ⋮ Bounds for point recolouring in geometric graphs ⋮ Geometric Knapsack problems ⋮ Delineating boundaries for imprecise regions ⋮ Unnamed Item

This page was built for publication: The complexity of computing minimum separating polygons