Scaling and related techniques for geometry problems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1984, Pages 135-143

  Gabow, Harold N ^a   Bentley, Jon Louis ^b   Tarjan, Robert E ^b  

^a UNIVERSITY OF COLORADO   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; NEAREST NEIGHBOR SEARCH; TREES (MATHEMATICS);

ALL NEAREST NEIGHBORS; GEOMETRY PROBLEMS; MAXIMUM SPANNING TREE; MINIMUM SPANNING TREE PROBLEM; NUMERICAL PRECISION; SWEEP ALGORITHMS;

COMPUTATION THEORY;

EID: 85020601782     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800057.808675     Document Type: Conference Paper

References (24)

1. J.L Bentley, "Multidimensional divide-and-conquer." CACM 33, 4, 1980, pp. 214-229.
2. B. Chazelle, "Filtering search: A new approach to queryanswering, " Proc. 34th Aztnual Syrnp. on Found. of Camp. Sci., 1983, pp. 122-132.
3. K.L Clarkson, "Fast algorithms for the all nearest neighbors problem", Proe. 34th Annual Syrnp. on Foundations of Corap. Sci., 1983, pp. 226-232.
4. D. Dobkin and RJ. Lipton, "Multidimensional search problems, ", SIAM J. Comput. 5. 1976, pp. 181-186.
5. H Edelsbrunner and H.A. Maurar, "On the intersection of orthogonal objects, " Inf. Proc..Letters, 13, 4, 1961, pp. 177-181.
6. H. Edelsbrunner and M.H. Overmars, "On the equivalence of some rectangle problems, ". Inf. Proc. Letters 14, 3, 1982, pp. 124-27.
7. H. Edelsbrunner and M.H. Overmars, "Botched dynamic solutions to decomposable searching problems, " Report FllB, Inst. fur Informationsvararbeitung, Tech. Univ. Graz, 1983.
8. J. Edmonds and R.M. Karp, "Theoretical improvements in algorithmic effmiency for network flow problems, " J. ACM 19, 2, 1972, pp. 248-264.
9. H.N. Gabow, "Scaling algorithms for network problems, " Proc. 34th Annual Syrnp. on Found. of Cornp. Sci., 1983. pp. 248-257.
10. H.N. Gabow and P, .E. Tarjan, "A linear-time algorithm for a special case of disjoint set union, "Proe. 15th Aztnuat ACM Syrnp. on Theory of Cornp., 1983, pp. 248-251.
11. R.L. Craham and P. Hell, "On the history of the minimum spanning tree problem, " Ann. History of Computing, to appear.
12. LJ. Guibas and J. Stolfi, "On computing all north-east nearest neighbors in the Li metric, " Inf. Proc. Letters 17, 1983, pp. 219-223.
13. D. Harel and R.E. Tarjan, "Fast algorithms for finding nearest common ancestors, SIAM J. Comput., to appear.
14. F.K Hwang, "An O(n log n) algorithm for rectilinear minimal spanning trees, " J. ACM. 26, 2, 1979, pp. 177-182.
15. D.E Knuth, The Art of Computer Progrararnirtg, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, Mass., 1973.
16. H.T. Kung, F. Luccio and F.P. Preparata, "On finding the maxima of a set of vectors, " J. ACM 22, 4, 1975, pp. 469- 476.
17. D.T. Lee and C.K. Wong, "Voronoi diagrams in Li(L, ) metrics with 2-dimensional storage applications, " SIAM J. Comput. 9, Feb. 1960, pp. 200-211.
18. D.T. Lee and K. Wong, "Finding intersetions of rectangles by range search, " J. of Algarithms 2, 1961, pp. 337- 347.
19. C.H. Papadimitriou and J.L Bentley, "A worst-case analysis of nearest neighbor searching by projection", in Lecture Notes in Computer Science, 85, Springer-Vering, Berlin, 1930, pp. 470-482.
20. P. van Emde Boas, Kaas, R., and Zijlstra, E., "Design and implementation of an efficient priority queue, " Math. Sjsterns Theory 10, 1977, pp. 99-127.
21. P van Erode Boas, "Preserving order in a forest in less than logarithmic time and linear space, " In f. Prsc. Letters 6, 3, 1977, pp. 60-62.
22. J. Vuillemin, "A unifying look at data structures, " C. ACM 33, 4, 1968, pp. 229-239.
23. D.E. Willard, "New data structures for orthogonal range queries, " SIAM J. Cornput., to appear.
24. A.C. Yes, "On constructing minimum spanning trees in k-dimensional spaces and related problems, " SIAM J. Comput. 11, 4, 1982, pp. 721-736.