Fast fencing

DOI10.1145/3188745.3188878zbMath1427.68323arXiv1804.00101OpenAlexW2795402084MaRDI QIDQ5230320

Anna Adamaszek, Alan Roytman, Vincent Cohen-Addad, Eva Rotenberg, Mehran Mehr, Mikkel Abrahamsen, Mikkel Thorup, Karl Bringmann

Publication date: 22 August 2019

Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

geometric clusteringminimum perimeter sum

Mathematics Subject Classification ID

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

Related Items (4)

Exact and heuristic solutions for the prize‐collecting geometric enclosure problem ⋮ Geometric multicut: shortest fences for separating groups of objects in the plane ⋮ Unnamed Item ⋮ Minimum perimeter-sum partitions in the plane

This page was built for publication: Fast fencing