On the Shape of a Set of Points in the Plane

IEEE Transactions on Information Theory

Volumn 29, Issue 4, 1983, Pages 551-559

  Kirkpatrick, David G ^b   Seidel, Raimund ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN RECOGNITION;

EID: 0020780410     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1983.1056714     Document Type: Article

References (20)

1. S. G. Akl, and G. T. Toussaint, “Efficient convex hull algorithms for pattern recognition applications,” in Proc. 4th Intern. Joint. Conf. on Pattern Recognition, Kyoto, pp. 483–487, 1978.
2. K. Q. Brown, “Voronoi diagrams from convex hulls,” Info. Proc. Letters, vol. 9, pp. 223–228, 1979.
3. —, “Geometric transforms for fast geometric algorithms,” Rep. CMU-CS-80-101, Carnegie-Mellon Univ., Dept. of Comp. Sci., 1980.
4. A. K. Dewdney and J. K. Vranch, “A convex partition of R3 with applications to Crum's problem and Knuth's post office problem,” Utilitas Math., vol. 12, pp. 193–199, 1977.
5. H. Edelsbrunner, “A new approach to intersections: Part I,” to appear in Intern. J. Comp. Math., 1983.
6. J. Fairfield, “Contoured shape generation: Forms that people see in dot patterns,” in Proc. IEEE Conf. on Cybernetics and Society, pp. 60–64, 1979.
7. I. G. Gowda and D. G. Kirkpatrick, “Exploiting linear merging and extra storage in the maintenance of fully dynamic geometric data structures,” in Proc. 18th Annual Allerton Conf. on Commun., Contr., and Comput., pp. 1–10, Oct. 1980.
8. R. L. Graham, “An efficient algorithm for determining the convex hull of a finite planar set,” Info. Proc. Letters, vol. 1, pp. 132–133, 1972.
9. R. A. Jarvis, “Computing the shape hull of points in the plane,” in Proc. of the IEEE Comp. Soc. Conf. on Pattern Recognition and Image Processing, pp. 231–241, 1977.
10. H. W. E. Jung, “Ueber die kleinste Kugel, die eine raeumlich Figur einschliesst,” J. f. d. Reine u. Angew. Math., vol. 123, pp. 241–257, 1901.
11. V. E. Klee, “On the complexity of d -dimensional Voronoi diagrams,” Archiv d. Math., vol. 34, pp. 75–80, 1980.
12. D. W. Matula and R. R. Sokal, “Properties of Gabriel graphs relevant to geographic variation research and the clustering of points in the plane,” Geog. Analysis, vol. 12, pp. 205–222, July 1980.
13. E. M. McCreight, “Efficient algorithms for enumerating intersecting intervals and rectangles,” J. Algorithms, vol. 2, pp. 245–260, 1981.
14. M. H. Overmars, “Dynamization of order decomposable set problems,” Rep. RUU-CS-80-9, Univ. of Utrecht, Dept. of Comp. Sci., 1980.
15. F. P. Preparata, “Steps into computational geometry,” Rep. R-792, Univ. of Illinois, Coordinated Sci. Lab., 1977.
16. R. Seidel, “A convex hull algorithm optimal for point sets in even dimensions,” Report 81-14, University of British Columbia, Dept. of Comp. Sci., 1981.
17. M. I. Shamos and D. Hoey, “Closest point problems,” in Proc. 16th IEEE Symp. on Foundations of Comput. Sci., pp. 151–162, 1975.
18. K. J. Supowit, “The relative neighborhood graph with an application to minimum spanning trees,” Tech. Rep., Univ. of Illinois, Dept. of Comput. Sci., Aug. 1980.
19. G. T. Toussiant, “The relative neighborhood graph of a finite planar set,” Patt. Recog., vol. 12, pp. 261–268, 1980.
20. —, “Pattern recognition and geometrical complexity,” 5th International Conference on Pattern Recognition, Miami Beach, FL, pp. 1324–1347, Dec. 1980.