Algorithms - ESA 2003

DOI10.1007/B13632MaRDI QIDQ5897253zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

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

Cited in

(11)

• Computing the smallest k-enclosing circle and related problems
• A fast deterministic smallest enclosing disk approximation algorithm
• Faster algorithms for growing prioritized disks and rectangles
• Fast algorithms for computing the smallest \(k\)-enclosing circle
• Computing the smallest \(k\)-enclosing circle and related problems
• A simple algorithm for computing the smallest enclosing circle
• Algorithms - ESA 2003
• A fast algorithm for finding the compact sets
• scientific article; zbMATH DE number 7278008 (Why is no real title available?)
• Efficient Speed-Up of the Smallest Enclosing Circle Algorithm
• Finding k points with minimum diameter 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)