Abstract
In this paper, further computational geometry in secondary memory are studied. The secondary memory models used are simple and practical. Efficient and practical solutions are given to solve secondary memory decomposable set problems. Some of the previous results are improved and some open questions are partially answered.
The author thanks Tim Merrett for a talk which triggers this work.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho, J.E. Hopcroft, and J.D. Ullman. Data structures and algorithms. Addison-Wesley Publishing Company, Reading, Mass, 1983.
D. Abel and B. C. Ooi. Advances in Spatial Databases: Third Intl. Sympos., SSD'93, volume 692 of Lecture Notes in Computer Science. Springer-Verlag, June 1993.
A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. CACM, 31(9):1116–1127, 1988.
B. Chazelle and D. Dobkin. Intersection of convex objects in two and three dimensions. J. ACM, (1):1–27, 1987.
M.R. Garey, D.S. Johnson, F.D. Preparata, and R.E. Tarjan. Triangulating a simple polygon. Inform. Process. Lett., pages 175–180, 1978.
O. Guenther and H.J. Schek. Advances in Spatial Databases: Second Intl. Sympos., SSD'93, volume 525 of Lecture Notes in Computer Science. Springer-Verlag, June 1991.
M.T. Goodrich, J.J. Tsay, D. E. Vengroff, and J.S. Vitter. External-Memory Computational Geometry. In Proc. 34th FOCS, pages 714–723, 1993.
C. Icking, R. Klein, and T. Ottmann. Priority search trees in secondary memory. In Proc. Internat. Workshop Graph-Theoret. Concepts Comput. Sci. (WG '87), volume 314 of Lecture Notes in Computer Science, pages 84–93. Springer-Verlag, 1987.
D. Knuth. The art of computer programming, volume 3: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.
K. Mehlhorn. Multi-dimensional Searching and Computational Geometry, volume 3 of Data Structures and Algorithms. Springer-Verlag, Heidelberg, West Germany, 1984.
M. Overmars and H. Van Leeuwen. Maintenance of configurations in the plane. Journal of Computer and System Science, 23:166–204, 1981.
M. H. Overmars, M. H. M. Smid, M. T. de Berg, and M. J. van Kreveld. Maintaining range trees in secondary memory, part I: partitions. Acta Inform., 27:423–452, 1990.
M. H. Overmars. Dynamization of order decomposable set problems. J. Algorithms, 2:245–260, 1981. Corrigendum in 4(1983), 301.
F.P. Preparata and M.I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.
H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, 1990.
M.I. Shamos and D. Hoey. Closest point problems. In Proc. 16th IEEE Symp. on FOCS, pages 151–162, 1975.
G.T. Toussaint and D. Avis. On a convex hull algorithm for polygons and its application to triangulation problems. Pattern Recognition, 15(1):23–29, 1982.
G. T. Toussaint. Solving geometric problems with the rotating calipers. In Proc. IEEE MELECON '83, pages A10.02/1–4, Athens, Greece, 1983.
B. Zhu and A. Mirzaian. Sorting does not always help in computational geometry. In Proc. 3rd Canadian Conf. on Comp. Geometry, pages 239–243, Aug, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, B. (1994). Further computational geometry in secondary memory. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_218
Download citation
DOI: https://doi.org/10.1007/3-540-58325-4_218
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58325-7
Online ISBN: 978-3-540-48653-4
eBook Packages: Springer Book Archive