An improved algorithm for subdivision traversal without extra storage

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1969, Issue , 2000, Pages 444-455

  Bose, Prosenjit ^a   Morin, Pat ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

MODIFIED ALGORITHMS; PLANAR SUBDIVISION; RUNNING TIME;

ARTIFICIAL INTELLIGENCE;

EID: 51349148014     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40996-3_38     Document Type: Conference Paper

References (14)

1. P. A. Burrough. Principles of Geographical Information Systems for Land Resources Assessment. Number 12 in Monographs on Soil and Resources Survey. Clarendon Press, Oxford, 1986.
2. M. de Berg, M. van Kreveld, R. van Oostrum, and M. Overmars. Simple traversal of a subdivision without extra storage. International Journal of Geographic Information Systems, 11:359-373, 1997.
3. H. Edelsbrunner, L. J. Guibas, and J. Stolfi. Optimal point location in a monotone subdivision. SIAM Journal on Computing, 15:317-340, 1986.
4. C. Gold and S. Cormack. Spatially ordered networks and topographic reconstructions. In Proceedings of the 2nd International Symposium on Spatial Data Handling, pages 74-85, 1986.
5. C. M. Gold, T. D. Charters, and J. Ramsden. Automated contour mapping using triangular element data and an interpolant over each irregular triangular domain. Computer Graphics, 11(2):170-175, 1977.
6. C. M. Gold and U. Maydell. Triangulation and spatial ordering in computer cartography. In Proceedings of the Canadian Cartographic Association Annual Meeting, pages 69-81, 1978.
7. Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Mathematics. Addison-Wesley, 2nd edition, 1994.
8. L. J. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Transactions on Graphics, 4:74-123, 1985.
9. D. S. Hirschberg and J. B. Sinclair. Decentralized extrema-finding in circular configurations of processes. Communications of the ACM, 23(11):627-628, 1980.
10. Kurt Mehlhorn and Stefan Näher. LEDA A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
11. D. E. Muller and F. P. Preparata. Finding the intersection of two convex polyhedra. Theoretical Computer Science, 7(2):217-236, 1978.
12. D. J. Peuquet and D. F. Marble. ARC/INFO: An example of a contemporary geographic information system. In Introductory Readings in Geographic Information Systems, pages 90-99. Taylor & Francis, 1990.
13. D. J. Peuquet and D. F. Marble. Technical description of the DIME system. In Introductory Readings in Geographic Information Systems, pages 100-111. Taylor & Francis, 1990.
14. Franco P. Preparata and Michael Ian Shamos. Computational Geometry. Springer- Verlag, New York, 1985.