The Largest Empty Annulus Problem

DOI10.1007/3-540-47789-6_5zbMath1049.68711OpenAlexW1581117185MaRDI QIDQ4739327

No author found.

Publication date: 12 August 2004

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-47789-6_5

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (4)

The maximin HAZMAT routing problem ⋮ Continuous location of dimensional structures. ⋮ Computing an obnoxious anchored segment. ⋮ Optimal consensus set for digital flake hyperspheres in \(n\)D

This page was built for publication: The Largest Empty Annulus Problem