The largest empty annulus problem

DOI10.1007/3-540-47789-6_5MaRDI QIDQ4739327zbMATH OpenOpenAlexFDO

Authors J. M. Díaz-Báñez, Ferran Hurtado, David Rappaport, Toni Sellarès

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) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• THE LARGEST EMPTY ANNULUS PROBLEM
• Maximum-width empty square and rectangular annulus
• Maximum-width empty square and rectangular annulus
• Fitting a set of points by a circle
• Largest empty circle centered on a query line

Cited in

(15)

• Fitting a set of points by a circle
• Continuous location of dimensional structures.
• Computing an obnoxious anchored segment.
• Optimal consensus set for digital flake hyperspheres in \(n\)D
• Locating a minisum annulus: a new partial coverage distance model
• Locating an obnoxious plane
• The maximin HAZMAT routing problem
• Optimal consensus set for annulus fitting
• COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND
• THE LARGEST EMPTY ANNULUS PROBLEM
• Efficient robust digital annulus fitting with bounded error
• Computational Science and Its Applications – ICCSA 2004
• Maximum-width empty square and rectangular annulus
• Maximum-width empty square and rectangular annulus
• Largest empty circle centered on a query line

This page was built for publication: The largest empty annulus problem

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