Enclosing weighted points with an almost-unit ball

DOI10.1016/J.IPL.2009.09.001zbMATH Open1206.68324OpenAlexW2088622389MaRDI QIDQ990963FDOQ990963

Guilherme D. Da Fonseca, Celina M. H. 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)

Cites Work

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

Cited In (2)

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

   Recommendations

• Covering Many or Few Points with Unit Disks 👍 👎
• Covering many or few points with unit disks 👍 👎
• Title not available (Why is that?) 👍 👎
• On the ball spanned by balls 👍 👎
• The Weighted Euclidean 1-Center Problem 👍 👎

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

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