Using Topological Sweep to Extract the Boundaries of Regions in Maps Represented by Region Quadtrees

Algorithmica (New York)

Volumn 15, Issue 1, 1996, Pages 82-102

  Dillencourt, M B ^a   Samet, H ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Active borders; Boundary extraction; Computational geometry; Computer graphics; Geographic information systems; Image Processing; Plane sweep; Region quadtrees; Region representation; Topological sweep

Indexed keywords

EID: 0347618003     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01942608     Document Type: Article

References (25)

1. D. J. Abel and J. L. Smith. A data structure and algorithm based on a linear key for a rectangle retrieval problem. Computer Vision, Graphics, and Image Processing, 24(1):1-13, October 1983.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
3. H. S. Baird. Fast algorithms for LSI artworks analysis. Journal of Design Automation & Fault-Tolerant Computing, 2:179-209, 1978.
4. M. Ben-Or. Lower bounds for algebraic computation trees. Proceedings of the Fifteenth Annual ACM Symposium on the Theory of Computing, pp. 80-86, Boston, MA, April 1983.
5. J. L. Bentley. Algorithms for Klee's rectangle problems. Unpublished manuscript, Computer Science Department, Carnegie-Mellon University, Pittsburgh, PA, 1977.
6. J. L. Bentley and D. Wood. An optimal worst-case algorithm for reporting intersections of rectangles. IEEE Transactions on Computers, 29(7):571-576, July 1980.
7. M. B. Dillencourt, H. Samet, and M. Tamminen. A general approach to connected-component labeling for arbitrary image representations. Journal of the ACM, 39(3):253-280, April 1992. Also see Corrigenda, Journal of the ACM, 39(4):985-985, October 1992.
8. C. R. Dyer, A. Rosenfeld, and H. Samet. Region representation: Boundary codes from quadtrees. Communications of the ACM, 23(3):171-179, March 1980.
9. H. Edelsbrunner. A new approach to rectangle intersections: part I. International Journal of Computer Mathematics, 13(3-4):209-219, 1983.
10. H. Edelsbrunner. Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science, vol. 10. Springer-Verlag, Berlin, 1987.
11. H. Edelsbrunner and L. J. Guibas. Topologically sweeping an arrangement. Proceedings of the Eighteenth Annual ACM Symposium on the Theory of Computing, pp. 389-403, Berkeley, CA, May 1986.
12. H. Freeman. Computer processing of line-drawing images. ACM Computing Surveys, 6(1):57-97, March 1974.
13. I. Gargantini. An effective way to represent quadtrees. Communications of the ACM, 25(12):905-910, December 1982.
14. E. Kawaguchi, T. Endo, and J. Matsunaga. Depth-first picture expression viewed from digital picture processing. IEEE Transactions on Pattern Analysis and Machine Intelligence, 5(4):373-384, July 1983.
15. D. T. Lee. Maximum clique problem of rectangle graphs. In F. P. Preparata, editor, Computational Geometry, pp. 91-107. Advances in Computing Research, vol. 1. JAI Press, Greenwich, CT, 1983.
16. E. M. McCreight. Priority search trees. SIAM Journal on Computing, 14(2):257-276, May 1985.
17. J. Nievergelt and F. P. Preparata. Plane-sweep algorithms for intersecting geometric figures. Communications of the ACM, 25(10):739-747, October 1982.
18. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
19. H. Samet. Hierarchical representations of collections of small rectangles. ACM Computing Surveys, 20(2):271-309, December 1988.
20. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.
21. H. Samet and M. Tamminen. Computing geometric properties of images represented by linear quadtrees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 7(3):229-240, March 1985.
22. H. Samet and M. Tamminen. Efficient component labeling of images of arbitrary dimension represented by linear bintrees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 10(4):579-586, July 1988.
23. H. Samet and R. E. Webber. Storing a collection of polygons using quadtrees. ACM Transactions on Graphics, 4(3): 182-222, July 1985.
24. M. Tamminen, Encoding pixel trees. Computer Graphics, Vision, and Image Processing, 28(1):44-57, October 1984.
25. R. E. Tarjan, Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22(2):215-225, April 1975.