Enclosing weighted points with an almost-unit ball

Authors:
Celina M. H. de Figueiredo;Guilherme D. da Fonseca
Affiliations:
COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, Brazil;COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, Brazil
Venue:
Information Processing Letters
Year:
2009

Citing 12
Cited 0

On a circle placement problem

Computing
On a class of O(n2) problems in computational geometry

Computational Geometry: Theory and Applications
Introduction to Algorithms

Introduction to Algorithms
Translating a Planar Object to Maximize Point Containment

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Fast Algorithms for Computing the Smallest k-Enclosing Circle

Algorithmica
Low-Dimensional Linear Programming with Violations

SIAM Journal on Computing
On the importance of idempotence

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Faster core-set constructions and data-stream algorithms in fixed dimensions

Computational Geometry: Theory and Applications
On Approximating the Depth and Related Problems

SIAM Journal on Computing
Tradeoffs in Approximate Range Searching Made Simpler

SIBGRAPI '08 Proceedings of the 2008 XXI Brazilian Symposium on Computer Graphics and Image Processing
Covering Many or Few Points with Unit Disks

Theory of Computing Systems
Approximate range searching: The absolute model

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

Given a set of n points with positive real weights in d-dimensional space, we consider an approximation to the problem of placing a unit ball, in order to maximize the sum of the weights of the points enclosed by the ball. Given an approximation parameter @e