Algorithms - ESA 2003
From MaRDI portal
Publication:5897253
DOI10.1007/B13632zbMATH Open1266.68191OpenAlexW1827234103MaRDI QIDQ5897253FDOQ5897253
Authors: Soham Mazumdar, Sariel Har-Peled 
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Recommendations
- Fast algorithms for computing the smallest \(k\)-enclosing circle
- A fast deterministic smallest enclosing disk approximation algorithm
- Computing the smallest \(k\)-enclosing circle and related problems
- Computing the smallest k-enclosing circle and related problems
- Efficient Speed-Up of the Smallest Enclosing Circle Algorithm
- Fast algorithms for computing the diameter of a finite planar set
- scientific article; zbMATH DE number 4041267
- Algorithms - ESA 2003
- Efficient algorithms for the smallest enclosing ball problem
- Complexity and approximation of the smallest \(k\)-enclosing ball problem
Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cited In (11)
- Faster algorithms for growing prioritized disks and rectangles
- A fast deterministic smallest enclosing disk approximation algorithm
- Fast algorithms for computing the smallest \(k\)-enclosing circle
- Computing the smallest \(k\)-enclosing circle and related problems
- Algorithms - ESA 2003
- A simple algorithm for computing the smallest enclosing circle
- A fast algorithm for finding the compact sets
- Title not available (Why is that?)
- Efficient Speed-Up of the Smallest Enclosing Circle Algorithm
- Finding k points with minimum diameter and related problems
- Computing the smallest k-enclosing circle and related problems
This page was built for publication: Algorithms - ESA 2003
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897253)
