Further Computational Geometry in Secondary Memory

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.

[1]  Samuel B. Williams,et al.  ASSOCIATION FOR COMPUTING MACHINERY , 2000 .

[2]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[3]  Rolf Klein,et al.  Priority Search Trees in Secondary Memory (Extended Abstract) , 1987, WG.

[4]  Mark H. Overmars,et al.  Dynamization of Order Decomposable Set Problems , 1981, J. Algorithms.

[5]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[6]  Godfried T. Toussaint,et al.  On a convex hull algorithm for polygons and its application to triangulation problems , 1982, Pattern Recognit..

[7]  Kurt Mehlhorn,et al.  Multi-dimensional searching and computational geometry , 1984 .

[8]  G. Toussaint.  Solving geometric problems with the rotating calipers , 1983 .

[9]  Jan van Leeuwen,et al.  Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

[10]  Robert E. Tarjan,et al.  Triangulating a Simple Polygon , 1978, Inf. Process. Lett..

[11]  Jyh-Jong Tsay,et al.  External-memory computational geometry , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[12]  Bernard Chazelle,et al.  Intersection of convex objects in two and three dimensions , 1987, JACM.

[13]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[14]  Beng Chin Ooi,et al.  Advances in Spatial Databases , 1993, Lecture Notes in Computer Science.

[15]  Hans-Jörg Schek,et al.  Advances in Spatial Databases , 1991, Lecture Notes in Computer Science.

[16]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .