From approximate balls to approximate ellipses

DOI10.1007/S10898-012-9932-1zbMATH Open1272.90062OpenAlexW2147578409MaRDI QIDQ1955552FDOQ1955552

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

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

zbMATH Keywords

computational geometryapproximation schemesstreaming algorithmsapproximate ellipses

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites Work

• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Data Streams: Algorithms and Applications
• Data streams: algorithms and applications.
• Minimum Covering Ellipses
• Title not available (Why is that?)
• Computing diameter in the streaming and sliding-window models
• Adaptive sampling for geometric problems over data streams
• Deterministic sampling and range counting in geometric data streams
• Title not available (Why is that?)

Cited In (4)

• \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity
• A FAMILY OF CONSTRUCTIONS OF APPROXIMATE ELLIPSES
• Four-arc approximation to ellipses: The best in general
• 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)