Article

Free access

Biased finger trees and three-dimensional layers of maxima: (preliminary version)

Authors:

Mikhail J. Atallah,

Michael T. Goodrich, and

Kumar RamaiyerAuthors Info & Claims

SCG '94: Proceedings of the tenth annual symposium on Computational geometry

June 1994

Pages 150 - 159

https://doi.org/10.1145/177424.177601

Published: 10 June 1994 Publication History

Abstract

We present a method for maintaining biased search trees so as to support fast finger updates (i.e., updates in which one is given a pointer to the part of the tree being changed). We illustrate the power of such biased finger trees by showing how they can be used to derive an optimal O(nlogn) algorithm for the 3-dimensional layers-of-maxima problem and also obtain an improved method for dynamic point location.

References

[1]

P. Agarwal, private communication, 1992.

[2]

A. Aggarwal and J. Park, "Notes on searching in multidimensional monotone arrays," in Proc. 29th IEEE Symposium on Foundations of Computer Science, 1988, 497-512.

[3]

A.V. Aho, J.E. ttopcroft, and J.D. Ullman, Data Structures and Algorithms, Addison-Wesley (Reading, Mass.: 1983).

Digital Library

[4]

H. Baumgarten, H. Jung, and K. Mehlhorn, "Dynamic Point Location in General Subdivisions," Proc. 3rd A CM-SIAM Symp. on Discrete Algorithms, 1992, 250-258.

Digital Library

[5]

S.W. Bent, D.D. Sleator, and R.E. Tarjan, "Biased search trees," SiAM Journal of Computing, 14(3):545-568, August 1985.

[6]

N. Blum and K. Mehlhorn, "On the Average Number of Rebalancing Operations in Weight-Balanced Trees," Theoretical Computer Science, 11, 1980, 303- 320.

[7]

B. Chazelle, "On the convex layers of a planar set," IEEE Trans. Inform. Theory, IT-31 1985, 509-517.

Digital Library

[8]

Y.-J. Chiang and R. Tamassia, "Dynamization of the Trapezoid Method for Planar Point Location," Proc. A CM Syrup. on Computational Geometry, 1991, 61- 70.

Digital Library

[9]

Y.-J. Chiang and R. Tamassia, "Dynamic Algorithms in Computational Geometry," Proc. of the IEEE, 80(9), 1992.

[10]

Y.-J. Chiang, F.P. Preparata, and R. Tamassia "A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps," Proc. ~th A CM-SiAM Syrup. on Discrete Algorithms, 1993, 44-53.

Digital Library

[11]

S.W. Cheng and R. Janardan~ "New Results on Dynamic Planar Point Location," 31st IEEE Syrup. on Foundations of Computer Science, 96-105, 1990.

Digital Library

[12]

R.F. Cohen and R. Tamassia, "Dynamic Expression Trees and their Applications," Proc. 2nd A CM-SIAM Syrup. on Discrete Algorithms, 1991, 52-61.

Digital Library

[13]

R. Cole, "Searching and Storing Similar Lists," J. of Algorithms, Vol. 7, 202-220 (1986).

Digital Library

[14]

T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, MIT Press (Cambridge, Mass.: 1990)

Digital Library

[15]

H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, NY, 1987.

Digital Library

[16]

H. Edelsbrunner, L.J. Guibas, and J. Stolfi, "Optimal Point Location in a Monotone Subdivision," SIAM J. Computing, Vol. 15, No. 2, 317-340, 1986.

Digital Library

[17]

D. Eppstein, G.F. Italiano, R. Tamassia, R.E. Tarjan, J. Westbrook, and M. Yung, "Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph," J. Algorithms, 13, 1992, 33-54.

Digital Library

[18]

M.T. Goodrich and R. Tamassia, "Dynamic Trees and Dynamic Point Location," Proc. 23rd A CM Syrup. on Theory of Computing, 1991, 523-533.

Digital Library

[19]

M.T. Goodrich and R. Tamassia, "Dynamic Ray Shooting and Shortest Paths via Balanced Geodesic Triangulations," Proc. 9th A CM Syrup. on Computational Geometry, 1993, 318-327.

Digital Library

[20]

L.J. Guibas, E.M. McCreight, M.F. Plass, and J.R. Roberts, "A New Representation for Linear Lists," Proc. 9th A CM Syrup. on Theory of Computing, 1977, 49-60.

Digital Library

[21]

L.j. Guibas and R. Sedgewick, "A Dichromatic Framework for Balanced Trees," Proc. 19th IEEE Syrup. on Foundations of Computer Science, 1978, 8- 21.

[22]

S. Huddleston and K. Mehlhorn, "A New Data Structure for Representing Sorted Lists," Acta informatica, 17, 1982, 157-184.

Digital Library

[23]

D. Kirkpatrick, "Optimal Search in Planar Subdivision,'' SIAM Journal on Computing, Vol. 12, No. 1, February 1983, pp. 28-35.

[24]

D.E. Knuth, Sorting and Searching, Addison-Wesley, Reading, Mass., 1973.

[25]

S.R. Kosaraju, "Localized Search in Sorted Lists," in Proc. 13th Annual A CM Syrup. on Theory of Computing, 1981, pp. 62-69.

Digital Library

[26]

S.R. Kosaraju, "An Optimal RAM Implementation of Catenable Min Double-ended Queues.," Proc. 5th A CM-SIAM Syrup. on Discrete Algom,lhms, 1994, 195-203.

Digital Library

[27]

H.T. Kung, F. Luccio, F.P. Preparata, ';On Finding the Maxima of a Set of Vectors," J. A CM, Vol. 22, No. 4, 1975, pp. 469-476.

Digital Library

[28]

D.T. Lee and F.P. Preparata, "Location of a Point in a Planar Subdivision and its Applications," SIAM J. Computing, Vol. 6, No. 3, 594-606, 1977.

[29]

D.T. Lee and F.P. Preparata, "Computational Geometry--A Survey," IEEE Trans. on Computers, C-33(12), 1984, 872-1101.

[30]

K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, Springer-Verlag, 1984.

[31]

K. Mehlhorn, Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry, Springer-Verlag, 1984.

Digital Library

[32]

K. Mehlhorn and S. Niiher, "Dynamic Fractional Cascading," Algorithmica, 5, 1990, 215-241.

Digital Library

[33]

I. Nievergelt and E.M. Reingold, "Binary Search Trees of Bounded Balance," SIAM J. Comput., 2, 1973, 33-43.

Digital Library

[34]

M. Overmaxs, The Design of Dynamic Data Structures, Lecture Notes in Computer Science, Springer- Verlag, 1983.

Digital Library

[35]

F.P. Preparata, "A New Approach to Planar Point Location," SIAM J. Computing, Vol. 10, No. 3, 1981, 73-83.

[36]

F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, NY, 1985.

Digital Library

[37]

F.P. Preparata and R. Tamassia, "Fully Dynamic Point Location in a Monotone Subdivision," SIAM J. Computing, Vol. 18, No. 4, 811-830, 1989.

Digital Library

[38]

Preparata, F.P. and R. Tamassia, "Dynamic Planar Point Location with Optimal Query Time," Theoretical Computer Science, Vol. 74, No. 1, 95-114, 1990.

Digital Library

[39]

N. Sarnak and R.E. Tarjan, "Planar Point Location Using Persistent Search Trees," Communications A CM, Vol. 29, No. 7, 669-679, 1986.

Digital Library

[40]

D.D. Sleator and R.E. Taxjan, "A Data, Structure for Dynamic Trees," J. Comput. and Sys. Sci., 26, 362- 391, 1983.

Digital Library

[41]

R.E. Tarjan, Data Structures and Network Algorithms, SIAM, Philadelphia, PA, 1983.

Digital Library

[42]

R.E. Tarjan, "Amortized computationa.1 complexity," SIAM J. Alg. D~sc. Meth., 6(2):306-318, April 1985.

Cited By

Kaporis AMakris CSioutas STsakalidis ATsichlas KZaroliagis C(2012)Improved Bounds for Finger Search on a RAMAlgorithmica10.1007/s00453-012-9636-466:2(249-286)Online publication date: 17-Mar-2012
https://doi.org/10.1007/s00453-012-9636-4
Nekrich Y(2011)A fast algorithm for three-dimensional layers of maxima problemProceedings of the 12th international conference on Algorithms and data structures10.5555/2033190.2033241(607-618)Online publication date: 15-Aug-2011
https://dl.acm.org/doi/10.5555/2033190.2033241
Nekrich Y(2011)A Fast Algorithm for Three-Dimensional Layers of Maxima ProblemAlgorithms and Data Structures10.1007/978-3-642-22300-6_51(607-618)Online publication date: 2011
https://doi.org/10.1007/978-3-642-22300-6_51
Show More Cited By

Index Terms

Biased finger trees and three-dimensional layers of maxima: (preliminary version)

Recommendations

Three algorithms on Braun trees

Among the many flavours of balanced binary trees, Braun trees (Braun and Rem, 1983) are perhaps the most circumscribed. For any given node of a Braun tree, the left subtree is either exactly the same size as the right subtree, or one element larger. ...
Read More
Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent
Algorithms and Data Structures
Abstract
We define simple variants of zip trees, called zip-zip trees, which provide several advantages over zip trees, including overcoming a bias that favors smaller keys over larger ones. We analyze zip-zip trees theoretically and empirically, showing, ... $_{}$ $_{}$
Read More
Upward drawings of trees on the minimum number of layers
WALCOM'08: Proceedings of the 2nd international conference on Algorithms and computation

In a planar straight-line drawing of a tree T on k layers, each vertex is placed on one of k horizontal lines called layers and each edge is drawn as a straight-line segment. A planar straight-line drawing of a rooted tree T on k layers is called an ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SCG '94: Proceedings of the tenth annual symposium on Computational geometry

June 1994

400 pages

ISBN:0897916484

DOI:10.1145/177424

Chairman:
Kurt Mehlhorn
U.S. Army Research Office

Copyright © 1994 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 June 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SCG94

Sponsor:

SCG94: Tenth Symposium on Computational Geometry

June 6 - 8, 1994

New York, Stony Brook, USA

Acceptance Rates

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
308
Total Downloads

Downloads (Last 12 months)34
Downloads (Last 6 weeks)12

Other Metrics

View Author Metrics

Citations

Cited By

Kaporis AMakris CSioutas STsakalidis ATsichlas KZaroliagis C(2012)Improved Bounds for Finger Search on a RAMAlgorithmica10.1007/s00453-012-9636-466:2(249-286)Online publication date: 17-Mar-2012
https://doi.org/10.1007/s00453-012-9636-4
Nekrich Y(2011)A fast algorithm for three-dimensional layers of maxima problemProceedings of the 12th international conference on Algorithms and data structures10.5555/2033190.2033241(607-618)Online publication date: 15-Aug-2011
https://dl.acm.org/doi/10.5555/2033190.2033241
Nekrich Y(2011)A Fast Algorithm for Three-Dimensional Layers of Maxima ProblemAlgorithms and Data Structures10.1007/978-3-642-22300-6_51(607-618)Online publication date: 2011
https://doi.org/10.1007/978-3-642-22300-6_51
Brodal GLagogiannis GMakris CTsakalidis ATsichlas K(2003)Optimal finger search trees in the pointer machineJournal of Computer and System Sciences10.1016/S0022-0000(03)00013-867:2(381-418)Online publication date: 1-Sep-2003
https://dl.acm.org/doi/10.1016/S0022-0000%2803%2900013-8
Buchsbaum AGoodrich M(2002)Three-Dimensional Layers of MaximaAlgorithms — ESA 200210.1007/3-540-45749-6_26(257-269)Online publication date: 29-Aug-2002
https://doi.org/10.1007/3-540-45749-6_26
Auletta VDas SDe Vivo APinotti MScarano V(1998)Toward a universal mapping algorithm for accessing trees in parallel memory systemsProceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing10.1109/IPPS.1998.669955(447-454)Online publication date: 1998
https://doi.org/10.1109/IPPS.1998.669955
Goodrich MOrletsky MRamaiyer KSaks M(1997)Methods for achieving fast query times in point location data structuresProceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms10.5555/314161.314438(757-766)Online publication date: 5-Jan-1997
https://dl.acm.org/doi/10.5555/314161.314438

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents