From approximate balls to approximate ellipses

DOI10.1007/S10898-012-9932-1MaRDI QIDQ1955552zbMATH OpenOpenAlexFDO

Authors Eugene Greene, Animesh Sarker, Tom Switzer, Asish Mukhopadhyay

Publication date 14 June 2013

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-012-9932-1

zbMATH Keywords

computational geometryapproximation schemesstreaming algorithmsapproximate ellipses

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Approximate ellipsoid in the streaming model
• Streaming with minimum space: an algorithm for covering by two congruent balls
• Streaming with minimum space: an algorithm for covering by two congruent balls
• Computing minimum-volume enclosing axis-aligned ellipsoids
• Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls

Cites work

• scientific article; zbMATH DE number 5506243 (Why is no real title available?)
• scientific article; zbMATH DE number 1424324 (Why is no real title available?)
• Adaptive sampling for geometric problems over data streams
• Computing diameter in the streaming and sliding-window models
• Data Streams: Algorithms and Applications
• Data streams: algorithms and applications.
• Deterministic sampling and range counting in geometric data streams
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Minimum Covering Ellipses

Cited in

(4)

• \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity
• Four-arc approximation to ellipses: The best in general
• A FAMILY OF CONSTRUCTIONS OF APPROXIMATE ELLIPSES
• Approximate ellipsoid in the streaming model

This page was built for publication: From approximate balls to approximate ellipses

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