Output-sensitive algorithms for uniform partitions of points

DOI10.1007/3-540-46632-0_41MaRDI QIDQ4511241zbMATH OpenFDO

Authors Binay Bhattacharya, Pankaj K. Agarwal, Sandeep Sen

Publication date 6 March 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46632-0_41

zbMATH Keywords

bucketing problemsMonte Carlo algorithm

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Improved algorithms for uniform partitions of points
• Algorithms for projecting points to give the most uniform distribution with applications to hashing
• Minimizing the sum of diameters efficiently
• Finding tailored partitions
• Partitioning with two lines in the plane

Cited in

(5)

• Improved algorithms for uniform partitions of points
• Translating a regular grid over a point set
• Algorithms for projecting points to give the most uniform distribution with applications to hashing
• An output-sensitive Algorithm to partition a Sequence of Integers into Subsets with equal Sums
• Output sensitive algorithms for approximate incidences and their applications

This page was built for publication: Output-sensitive algorithms for uniform partitions of points

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