Three-dimensional layers of maxima

Algorithmica (New York)

Volumn 39, Issue 4, 2004, Pages 275-286

  Buchsbaum, Adam L ^a   Goodrich, Michael T ^b  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Fractional cascading; Layers of maxima; Planar point location

Indexed keywords

DATA STRUCTURES; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; THREE DIMENSIONAL;

FRACTIONAL CASCADING; LAYERS OF MAXIMA; PLANAR POINT LOCATION; THREE-DIMENSIONAL LAYERS-OF-MAXIMA PROBLEM;

ALGORITHMS;

EID: 21044452753     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1082-5     Document Type: Article

References (17)

1. P. K. Agarwal. Personal communication, 1992.
2. M. J. Atallah, M. T. Goodrich, and K. Ramaiyer. Biased finger trees and three-dimensional layers of maxima. in Proc. 10th ACM Symp. on Computational Geometry, pages 150-159, 1994.
3. S. W. Bent, D. D. Sleator, and R. E. Tarjan. Biased search trees. SIAM Journal on Computing, 14(3):545-568, 1985.
4. B. Chazelle. On the convex layers of a planar set. IEEE Transactions on Information Theory, IT-31:509-517, 1985.
5. B.Chazelle and L.J.Guibas. Fractional cascading: I. A datastructure technique. Algorithmica, 1(2)133-162, 1986.
6. P. F. Dietz and R. Raman. Persistence, amortization and randomization. In Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, pages 78-88, 1991.
7. P. G. Franciosa, C. Gaibisso and M. Talamo. An optimal algorithm for the maxima set problem for data in motion. In Abstracts 8th European Workshop on Computational Geometry, pages 17-21, 1992.
8. L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE Symp. on Foundations of Computer Science, pages 8-21, 1978.
9. J.-W. Jang, M. Nigam, V. K. Prasanna, and S. Sahni. Constant time algorithms for computational geometry on the reconfigurable mesh. IEEE Transactions on Parallel and Distributed Systems, 8(1):1-12, 1997.
10. S. Kapoor. Dynamic maintenance of maximas of 2-d Point Sets. In Proc. 10th ACM Symp. on Computational Geometry, pages 140-149, 1994.
11. H. T. Kung, F. Luccio, and P. Preparata. On finding the maxima of a set of vector. Journal of the ACM, 22(4):469-476, 1975.
12. K. Mehlhorn and S. Näher. Bounded ordered dictionaries in O(log log N) time and O(n) space. Information Processing Letters, 35(4): 183-189, 1990.
13. K. Mehlhorn and S. Näher. Dynamic fractional cascading. Algorithmica 5(2):215-241, 1990.
14. F. P. Preparata. A new approach to planar point location. SIAM Journal on Computing, 10(3):473-482. 1981.
15. R. Raman. Eliminating Amortization: On Data Structures with Guaranteed Fast Response Time. Ph.D. thesis, University of Rochester, 1992.
16. P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6(3):80-82, June 1977.
17. D. E. Willard. New trie data structures which support very fast search operations. Journal of Computer and System Sciences, 28(3):379-394, 1984.