Output-sensitive algorithms for uniform partitions of points

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1741, Issue , 1999, Pages 403-414

  Agarwal, Pankaj K ^a   Bhattacharya, Binay K ^b   Sen, Sandeep ^c  

^a Duke University   (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

^c INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ELASTIC MODULI;

DETERMINISTIC ALGORITHMS; MONTE CARLO ALGORITHMS; ONE DIMENSIONAL PROBLEMS; OPTIMAL SOLUTIONS; OUTPUT-SENSITIVE ALGORITHM; POSITIVE INTEGERS; TIME COMPLEXITY; TWO-DIMENSIONAL PROBLEM;

ALGORITHMS;

EID: 84958046843     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_41     Document Type: Conference Paper

References (6)

1. T. Asano and T. Tokuyama. Algorithms for projecting points to give the most uniform distribution and applications to hashing. Algorithmic, 9, pp. 572-590, 1993.
2. B. Bhattacharya. Usefulness of angle sweep. Proc. of FST&TCS, New Delhi, India, 1991.
3. D. Comer and M.J. O'Donnell Geometric problems with applications to hashing. SIAM Journal on Computing, 11, pp. 217-226, 1982.
4. T. K. Dey, Improved bounds on planar fc-sets and related problems, Discrete Com-put. Geom., 19 (1998), 373-382.
5. J. Hershberger and S. Suri, A pedestrian approach to ray shooting: Shoot a ray, take a walk, J. Algorithms, 18 (1995), 403-431.
6. J. Matousek. Efficient Partition trees. Discrete and Computational Geometry,8, pp. 315-334, 1992.