Approximation algorithms for minimum-width annuli and shells
From MaRDI portal
Publication:1591055
DOI10.1007/s004540010062zbMath0966.68207OpenAlexW4251602903MaRDI QIDQ1591055
Pankaj K. Agarwal, Sariel Har-Peled, Boris Aronov, Micha Sharir
Publication date: 16 August 2001
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004540010062
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (10)
How to get close to the median shape ⋮ Locating a minisum annulus: a new partial coverage distance model ⋮ Fitting concentric circles to measurements ⋮ Monte Carlo maximum likelihood circle fitting using circular density functions ⋮ Measure of circularity for parts of digital boundaries and its fast computation ⋮ Practical methods for shape fitting and kinetic data structures using coresets ⋮ Computing a minimum-width cubic and hypercubic shell ⋮ On overlays and minimization diagrams ⋮ Robust shape fitting via peeling and grating coresets ⋮ Certified efficient global roundness evaluation
This page was built for publication: Approximation algorithms for minimum-width annuli and shells
