Enclosing weighted points with an almost-unit ball

DOI10.1016/j.ipl.2009.09.001zbMath1206.68324OpenAlexW2088622389MaRDI QIDQ990963

Guilherme Dias da Fonseca, Celina M. Herrera de Figueiredo

Publication date: 1 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.09.001

zbMATH Keywords

computational geometrygeometric approximation

Mathematics Subject Classification ID

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

Related Items (2)

FITTING FLATS TO POINTS WITH OUTLIERS ⋮ A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning

Cites Work

• Unnamed Item
• Unnamed Item
• Range searching with efficient hierarchical cuttings
• Covering many or few points with unit disks
• On a circle placement problem
• Fast algorithms for computing the smallest \(k\)-enclosing circle
• On a class of \(O(n^ 2)\) problems in computational geometry
• Approximate range searching: The absolute model
• Faster core-set constructions and data-stream algorithms in fixed dimensions
• On the importance of idempotence
• Lower Bounds on the Complexity of Polytope Range Searching
• On Approximating the Depth and Related Problems
• Low-Dimensional Linear Programming with Violations
• FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE

This page was built for publication: Enclosing weighted points with an almost-unit ball