Exact and approximation algorithms for minimum-width cylindrical shells

DOI10.1007/S00454-001-0039-6zbMATH Open0988.68203OpenAlexW3087563582MaRDI QIDQ5953074FDOQ5953074

Authors: Pankaj K. Agarwal, Boris Aronov, Micha Sharir 

Publication date: 22 July 2002

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-001-0039-6

Recommendations

• Publication:4952660
• Approximation algorithms for minimum-width annuli and shells
• Computing a minimum-width cubic and hypercubic shell
• The number of cylindrical shells
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (11)

• Practical methods for shape fitting and kinetic data structures using coresets
• Optimizing a constrained convex polygonal annulus
• Robust shape fitting via peeling and grating coresets
• On overlays and minimization diagrams
• Title not available (Why is that?)
• The number of cylindrical shells
• Title not available (Why is that?)
• Approximation algorithms for minimum-width annuli and shells
• Extremal point queries with lines and line segments and related problems
• A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms
• Computing a minimum-width cubic and hypercubic shell

This page was built for publication: Exact and approximation algorithms for minimum-width cylindrical shells

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