Bibliography

 

1. Abe, K., Mizutani, F., Wang, C. Thinning of gray-scale images with combined sequential and parallel conditions for pixel removal. IEEE Trans. Systems, Man, Cybernetics. 1994;24:294–299.

2. Ablameyko, S.V., Arcelli, C., Sanniti di Baja, G. Hierarchical decomposition of distance labeled skeletons. Int. J. Pattern Recognition Artificial Intelligence. 1996;10:957–970.

3. Abramowitz, M., Stegun, I., eds. Handbook of Mathematical Functions with Formulas, Graphs and Mathematical Tables. Wiley: New York, 1972. (10th printing with corrections)

4. Acketa, D.M., Žuniimage, J.D. The number of linear partitions of the (m, n)-grid. Information Processing Letters. 1991;38:163–168.

5. Acketa, D.M., Žuniimage, J.D. On the maximal number of edges of convex digital polygons included into an m m-grid. J. Combinatorial Theory. 1995;A69:358–368.

6. Aharoni, R., Herman, G.T., Loebl, M. Jordan graphs. Graphical Models Image Processing. 1996;58:345–359.

7. Ahuja, N., Davis, L.S., Milgram, D.L., Rosenfeld, A. Piecewise approximation of pictures using maximal neighborhoods. IEEE Trans. Computers. 1978;27:375–379.

8. Ahuja, N., Schachter, B.J. Pattern Models. Wiley: New York, 1983.

9. Aleksandrov, P.S. Combinatorial Topology, Volume 1. Graylock Press: Rochester, 1956.

10. Aleksandrov, P.S. Combinatorial Topology, Volume 2. Graylock Press: Rochester, 1957.

11. Alexander, J.C., Thaler, A.I. The boundary count of digital pictures. J. ACM. 1971;18:105–112.

12. Alexander, J.W. A proof of the invariance of certain constants of analysis situs. Trans. American Mathematical Society. 1915;16:148–154.

13. Alexandroff, P., Hopf, H. Topologie. Erster Band. Julius Springer: Berlin, Germany, 1935.

14. Alpers, A. Digital topology: Regular sets and root images of the cross-median filter. J. Mathematical Imaging Vision. 2002;17:7–14.

15. Alt, F.L. Digital pattern recognition by moments. J. ACM. 1962;9:240–258.

16. Amarunnishad, T.M., Das, P.P. Estimation of length for digitized straight lines in three dimensions. Pattern Recognition Letters. 1990;11:207–213.

17. Ambartzumjan, R.V. Combinatorial Integral Geometry. Wiley: Chichester, 1982.

18. Amir, A., Benson, G. Two-dimensional periodicity and its applications. Proc. ACM-SIAM Symp. Discrete Algorithms. 1992:440–452.

19. Ammann, C.J., Sartori-Angus, A.G. Fast thinning algorithm for binary images. Image Vision Computing. 1985;3:71–79.

20. Anderson, T.A., Kim, C.E. Representation of digital line segments and their preimages. Computer Vision, Graphics, Image Processing. 1985;30:279–288.

21. Andres, E. Cercles discrets et rotations discrètes. Strasbourg: Université Louis Pasteur; 1992. Ph.D. Thesis

22. Andres, E. Discrete circles, rings and spheres. Computers & Graphics. 1994;18:695–706.

23. Andres, E., Acharya, R., Sibata, C. Discrete analytical hyperplanes. Graphical Models Image Processing. 1997;59:302–309.

24. , Apollonius of Perga. Conics. Green Lion Press: Annapolis, Maryland, 1998. books I-III. Translation by R.C. Taliaferro

25. Appel, K., Haken, W. Every planar map is four colorable. Part. I. Discharging. Illinois J. Math. 1977;21:429–490.

26. Arcelli, C. Pattern thinning by contour tracing. Computer Graphics Image Processing. 1981;17:130–144.

27. Arcelli, C. Topological changes in grey-tone digital pictures. Pattern Recognition. 1999;32:1019–1023.

28. Arcelli, C., Cordella, L.P., Levialdi, S. From local maxima to connected skeletons. IEEE Trans. Pattern Analysis Machine Intelligence. 1981;3:134–143.

29. Arcelli, C., Levialdi, S. Parallel shrinking in three dimensions. Computer Graphics Image Processing. 1972;1:21–30.

30. Arcelli, C., Massarotti, A. Regular arcs in digital contours. Computer Graphics Image Processing. 1975;4:339–360.

31. Arcelli, C., Massarotti, A. On the parallel generation of straight digital lines. Computer Graphics Image Processing. 1978;7:67–83.

32. Arcelli, C., Ramella, G. Finding contour-based abstractions of planar patterns. Pattern Recognition. 1993;26:1563–1577.

33. Arcelli, C., Ramella, G. Finding grey-skeletons by iterated pixel removal. Image Vision Computing. 1995;13:159–167.

34. Arcelli, C., Ramella, G. Sketching a grey-tone pattern from its distance transform. Pattern Recognition. 1996;29:2033–2045.

35. Arcelli, C., Sanniti di Baja, G. On the sequential approach to medial line transformation. IEEE Trans. Man, Cybernetics. 1978;8:139–144.

36. Arcelli, C., Sanniti di Baja, G. A thinning algorithm based on prominence detection. Pattern Recognition. 1981;13:225–235.

37. Arcelli, C., Sanniti di Baja, G. A width-independent fast thinning algorithm. IEEE Trans. Pattern Analysis Machine Intelligence. 1985;7:463–474.

38. Arcelli, C., Sanniti di Baja, G. Computing Voronoi diagrams in digital pictures. Pattern Recognition Letters. 1986;4:383–389.

39. Arcelli, C., Sanniti di Baja, G. Finding local maxima in a pseudo-Euclidean distance transform. Computer Vision, Graphics, Image Processing. 1988;43:361–367.

40. Arcelli, C., Sanniti di Baja, G. A one-pass two-operation process to detect the skeletal pixels on the 4-distance transform. IEEE Trans. Pattern Analysis Machine Intelligence. 1989;11:411–414.

41. Arcelli, C., Sanniti di Baja, G. Ridge points in Euclidean distance maps. Pattern Recognition Letters. 1992;13:237–243.

42. Arcelli, C., Sanniti di Baja, G. Euclidean skeleton via centre-of-maximal-disc extraction. Image Vision Computing. 1993;11:163–173.

43. Arcelli, C., Sanniti di Baja, G., Skeletons of planar patterns. Kong, T.Y., Rosenfeld, A., eds. Topological Algorithms for Digital Image Processing. Elsevier, Amsterdam: The Netherlands, 1996:99–143.

44. Arcelli, C., Sanniti di Baja, G., Kwok, P.C.K. Parallel pattern compression by octagonal propagation. Int. J. Pattern Recognition Artificial Intelligence. 1993;7:1077–1102.

45. Arcelli, C., Serino, L. Parallel reduction operators for gray-tone pictures. Int. J. Pattern Recognition Artificial Intelligence. 2000;14:281–295.

46. Arrebola, F., Bandera, A., Camacho, P., Sandoval, F. Corner detection by local histograms of contour chain code. Electronics Letters. 1997;23:1769–1771.

47. Arrebola, F., Camacho, P., Bandera, A., Sandoval, F. Corner detection and curve representation by circular histograms of contour chain code. Electronics Letters. 1999;35:1065–1067.

48. Artzy, E., Frieder, G., Herman, G.T. The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm. Computer Vision, Graphics, Image Processing. 1981;15:1–24.

49. Asano, T., Kawamura, Y., Klette, R., Obokkata, K. A new approximation scheme for digital objects and curve length estimations. Proc. Image Vision Computing New Zealand. 2000:26–31.

50. Asano, T., Kawamura, Y., Klette, R., Obokkata, K., Minimum-length polygons in approximation sausages. Arcelli, C., Cordella, L.P., Sanniti di Baja, G., eds. In Visual Form 2001. Springer: Berlin, 2001:103–112. LNCS 2059

51. Asano, T., Kawamura, Y., Klette, R., Obokkata, K. Digital curve approximation with length evaluation. IEICE Trans. Fundamentals Electronics Communication Computer Sciences. 2003;86:987–994.

52. Atallah, M. A linear-time algorithm for Hausdorff distance between convex polygons. Information Processing Letters. 1983;17:207–209.

53. Auslander, L., Parter, S.V. On imbedding graphs in the plane. J. Mathematics Mechanics. 1961;10:517–523.

54. Ayala, R., Domínguez, E., Francés, A.R., Quintero, A. Homotopy in digital spaces. Discrete Applied Mathematics. 2003;125:3–24.

55. Aziz, N., Bhat, S. On the computation of integral properties of objects. Advances Engineering Software. 1990;12:174–180.

56. Bakker, P., van Vliet, L.J., Verbeek, P.W. Confidence and curvature estimation of curvilinear structures in 3-D. Proc. Int. Conf. Computer Vision. 2001:139–144.

57. Bárány, I. The limit shape of convex lattice polygons. Discrete Computational Geometry. 1995;13:279–295.

58. Barcucci, E., Brunetti, S., Del Lungo, A., Nivat, M., Reconstruction of discrete sets from three or more X-rays. Proc. Italian Conf. Algorithms Complexity. Springer: Berlin, Germany, 2000:199–200. LNCS 1767

59. Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R. Reconstructing convex polyominoes from their vertical and horizontal projections. Theoretical Computer Science. 1996;155:321–347.

60. Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R., Zurli, A., Reconstructing digital pictures from X-rays. Proc. Int. Conf. Image Analysis Processing. Springer: Berlin, Germany, 1997:166–173. LNCS 1310

61. Barcucci, E., Del Lungo, A., Pinzani, R. Deco polyominoes permutations and random generation. Theoretical Computer Science. 1996;159:29–42.

62. Barneva, R.P., Brimkov, V.E., Nehlig, P. Thin discrete triangular meshes. Theoretical Computer Science. 2000;246:73–105.

63. Barnsley, M.F. 2nd. Fractals Everywhere. Academic Press: Boston, 1993.

64. Baruch, O. Line thinning by line following. Pattern Recognition Letters. 1988;8:271–276.

65. Bässmann, H., Besslich, P.W. Konturorientierte Verfahren in der digitalen Bildverarbeitung. Berlin, Germany: Springer; 1989.

66. Beckers, A.L.D., Smeulders, A.W.M. A comment on “A note on ‘Distance transformations in digital images’.”. Computer Vision, Graphics, Image Processing. 1989;47:89–91.

67. Beckers, A.L.D., Smeulders, A.W.M. Optimization of length measurements for isotropic distance transformations in three dimensions. CVGIP: Image Understanding. 1992;55:296–306.

68. Bell, S.B.M., Holroyd, F.C., Mason, D.C. A digital geometry for hexagonal pixels. Image Vision Computing. 1989;7:194–204.

69. Bender, E.A. Convex n-ominoes. Discrete Mathematics. 1974;8:219–226.

70. Bengtsson, A., Eklundh, J.-O. Shape representation by multiscale contour approximation. IEEE Trans. Pattern Analysis Machine Intelligence. 1991;13:85–93.

71. Bennett, J.R., MacDonald, J.S. On the measurement of curvature in a quantized environment. IEEE Trans. Computers. 1975;24:803–820.

72. Bentz, D.P., Pimienta, P.J.P., Garboczi, E.J., Carter, W.C. Cellular automaton simulations of surface mass transport due to curvature gradients: Simulations of sintering in 3-D. Synthesis and Proceedings of Ceramics: Scientific Issues. 1992;249:413–418.

73. Berenstein, C., Lavine, D. On the number of digital straight line segments. IEEE Trans. Pattern Analysis Machine Intelligence. 1988;10:880–887.

74. Berstel, J., Pocchiola, M. Random generation of finite Sturmian words. Discrete Mathematics. 1996;153:29–39.

75. Bertrand, G. Simple points, topological numbers and geodesic neighborhoods in cubic grids. Pattern Recognition Letters. 1994;15:1003–1011.

76. Bertrand, G. A parallel thinning algorithm for medial surfaces. Pattern Recognition Letters. 1995;16:979–986.

77. Bertrand, G. A Boolean characterization of three-dimensional simple points. Pattern Recognition Letters. 1996;17:115–124.

78. Bertrand, G., Malandain, G. A new characterization of three-dimensional simple points. Pattern Recognition Letters. 1994;15:169–175.

79. Bertrand, G., Malandain, G. A note on “Building skeleton models via 3-D medial surface/axis thinning algorithms.”. Graphical Models Image Processing. 1995;57:537–538.

80. Bertrand, G., Malgouyres, R. Some topological properties of surfaces in Z3. J. Mathematical Imaging Vision. 1999;11:207–221.

81. Bertrand, G., Malgouyres, R., Topological properties of discrete surfaces. Miguet, S., Montanvert, A., Ubéda, S., eds. Discrete Geometry for Computer Imagery. Springer: Berlin, Germany, 1996:325–336. LNCS 1176

82. Bertrand, Y., Damiand, G., Fiorio, C., Topological encoding of 3-D segmented images. Borgefors, G., Nyström, I., Sanniti di Baja, G., eds. Discrete Geometry for Computer Imagery. Springer: Berlin, Germany, 2000:311–324. LNCS 1953

83. Beucher, S., Meyer, F., The morphological approach to segmentation: The watershed transformation. Dougherty, E.R., eds. Mathematical Morphology in Image Processing. Marcel Dekker: New York, 1993:433–481.

84. Beus, H.L., Tiu, S.S.H. An improved corner detection algorithm based on chain-coded plane curves. Pattern Recognition. 1987;20:291–296.

85. Bhattacharya, P., Lu, X. A width-independent sequential thinning algorithm. Int. J. Pattern Recognition Artificial Intelligence. 1997;11:393–403.

86. Bhattacharya, P., Rosenfeld, A. α-convexity. Pattern Recognition Letters. 2000;21:955–957.

87. Bieniek, A., Moga, A. An efficient watershed algorithm based on connected components. Pattern Recognition. 2000;33:907–916.

88. Bieri, H., Nef, W. Algorithms for the Euler characteristic and related additive functionals of digital objects. Computer Vision, Graphics, Image Processing. 1984;28:166–175.

89. Biggs, N.L., Lloyd, E.K., Wilson, R.J. Graph Theory 1736–1936. Clarendon Press: Oxford, 1976.

90. Biswas, S., Pal, S.K. Approximate coding of digital contours. IEEE Trans. Pattern Analysis Machine Intelligence. 1988;18:1056–1066.

91. Bloch, I., Fuzzy geodesic distance in images. Ralescu, A., Martin, T., eds. Fuzzy Logic in Artificial Intelligence, Towards Intelligent Systems. Springer: Berlin, Germany, 1996:153–166. LNCS 1188

92. Bloch, I. On fuzzy distances and their use in image processing under imprecision. Pattern Recognition. 1999;32:1873–1895.

93. Blum, H., A transformation for extracting new descriptors of shape. Wathen-Dunn, W., eds. Models for the Perception of Speech and Visual Form. MIT Press, Cambridge: Massachusetts, 1967:362–380.

94. Blumenthal, L.M. Theory and Applications of Distance Geometry. Clarendon Press: Oxford, England, 1953.

95. Bogomolny, A. Digital geometry may not be discrete. Computer Vision, Graphics, Image Processing. 1988;43:205–220.

96. Böhm, J., Hertel, E. Jenaer Beiträge zur diskreten Geometrie. Wiss. Zeitschrift der Friedrich-Schiller-Universität Jena. 1987;1:10–21.

97. Boissonnat, J.-D., Yvinec, M. Algorithmic Geometry. Cambridge University Press: Cambridge, UK, 1998.

98. Bokowski, J., Hadwiger, H., Wills, J.M. Eine Ungleichung zwischen Volumen, Oberfläche, und Gitterpunktzahl konvexer Körper im n-dimensionalen euklidischen Raum. Mathematische Zeitschrift. 1972;127:363–364.

99. Boltcheva, D. Segmentation Anatomique du Foie à Partir des Repères Internes et Externes. Germany: Université Louis Pasteur, Strasbourg; 2003. MSc Thesis

100. Boltjanskij, V.G., Efremoviimage, V.A. Anschauliche kombinatorische Topologie. VEB deutscher Verlag der Wissenschaften: Berlin, Germany, 1986.

101. Bongiovanni, G., Luccio, F., Zorat, A. The discrete equation of the straight line. IEEE Trans. Computers. 1975;24:310–313.

102. Bonnesen, T. Über das isoperimetrische Defizit ebener Figuren. Mathematische Annalen. 1922;91:252–268.

103. Borgefors, G. Distance transformations in arbitrary dimensions. Computer Vision, Graphics, Image Processing. 1984;27:321–345.

104. Borgefors, G. Distance transformations in digital images. Computer Vision, Graphics, Image Processing. 1986;34:344–371.

105. Borgefors, G. Distance transformations on hexagonal grids. Pattern Recognition Letters. 1989;9:97–105.

106. Borgefors, G. A semiregular image grid. J. Visual Communication Image Representation. 1990;1:127–136.

107. Borgefors, G. Another comment on “A note on distance transformations in digital images.”. CVGIP: Image Understanding. 1991;54:301–306.

108. Borgefors, G. On digital distance transforms in three dimensions. Computer Vision Image Understanding. 1996;64:368–376.

109. Borgefors, G., Nyström, I. Efficient shape representation by minimizing the set of centres of maximal discs/spheres. Pattern Recognition Letters. 1997;18:465–471.

110. Borgefors, G., Nyström, I., Sanniti di Baja, G. Computing skeletons in three dimensions. Pattern Recognition. 1999;32:1225–1236.

111. Borgefors, G., Nyström, I., Sanniti di Baja, G. Discrete Geometry for Computer Imagery. Springer: Berlin, Germany, 2000. LNCS 1953

112. Bourbaki, N. 3rd. Topologie Générale. Hermann: Paris, 1961.

113. Bourbakis, N.G. A parallel-symmetric thinning algorithm. Pattern Recognition. 1989;22:387–396.

114. Boxer, L. Digitally continuous functions. Pattern Recognition Letters. 1994;15:833–839.

115. Boxer, L., Miller, R. Efficient computation of the Euclidean distance transform. Computer Vision Image Understanding. 2000;80:379–383. corrigendum, 86, 137–140, 2002

116. Boyles, S.M., Ritter, G.X. The encoding of arbitrary two-dimensional geometric configurations. Int. J. Computer Information Sciences. 1981;10:1–24.

117. Bracquelaire, J., Brun, L. Image segmentation with topological maps and interpixel representation. J. Visual Communication Image Representation. 1998;9:62–79.

118. Brandt, J.W. Convergence and continuity criteria for discrete approximations of the continuous planar skeleton. CVGIP: Image Understanding. 1994;59:116–124.

119. Brandt, J.W., Algazi, V.R. Continuous skeleton computation by Voronoi diagram. CVGIP: Image Understanding. 1992;55:329–338.

120. Breitenberger, E. Johann Benedict Listing. Neue Deutsche Biographie. 1952;14:700–701.

121. Bresenham, J. An incremental algorithm for digital plotting. Proc. ACM Nat. Conf. 1963.

122. Bresenham, J. Algorithm for computer control of a digital plotter. IBM Systems J. 1965;4:25–30.

123. Bresenham, J. A linear algorithm for incremental digital display of circular arcs. Comm. ACM. 1977;20:100–106.

124. Bretto, A. Comparability graphs and digital topology. Computer Vision Image Understanding. 2001;82:33–41.

125. Breu, H., Gil, J., Kirkpatrick, D., Werman, M. Linear time Euclidean distance transform algorithms. IEEE Trans. Pattern Analysis Machine Intelligence. 1995;17:529–533.

126. Bribiesca, E. A new chain code. Pattern Recognition. 1999;32:235–251.

127. Bribiesca, E. A chain code for representing 3D curves. Pattern Recognition. 2000;33:755–765.

128. Brice, R., Fennema, C.L. Scene analysis using regions. Artificial Intelligence. 1970;1:205–226.

129. Brimkov, V.E. Digital flatness and related combinatorial problems. New Zealand: Computer Science Department University of Auckland; 2002. CITR, TR-120

130. Brimkov, V.E., Andres, E., Barneva, R.P., Object discretizations in higher dimensions. Borgefors, G., Nyström, I., Sanniti di Baja, G., eds. Discrete Geometry for Computer Imagery. Springer: Berlin, 2000:210–221. LNCS 1953

131. Brimkov, V.E., Andres, E., Barneva, R.P. Object discretizations in higher dimensions. Pattern Recognition Letters. 2002;23:623–636.

132. Brimkov, V.E., Barneva, R. Honeycomb vs. square and cubic models. Electronic Notes in Theoretical Computer Science. 46, 2001.

133. Brimkov, V.E., Barneva, R.P. Graceful planes and lines. Theoretical Computer Science. 2002;283:151–170.

134. V.E. Brimkov and R.P. Barneva. Connectivity of discrete planes. Theoretical Computer Science, to appear.

135. Brimkov, V.E., Barneva, R., Nehlig, P., Minimally thin discrete triangulations. Chen, M., Kaufman, A., Yagel, R., eds. Volume Graphics. Springer: New York, 2000:51–70.

136. Brisson, E. Representing geometric structures in d dimensions: Topology and order. Discrete Computational Geometry. 1993;9:387–426.

137. Brons, R. Linguistic methods for description of a straight line on a grid. Computer Graphics Image Processing. 1974;2:48–62.

138. Brouwer, L.E.J., Beweis des Jordanschen Kurvensatzes. Mathematische Annalen, 69. North-Holland, Amsterdam, and American Elsevier: New York, 1910, 1976:169–175. [Also in: Collected Works, 2:377–383].

139. Brouwer, L.E.J., Beweis des Jordanschen Satzes für den n-dimensionalen Raum. Mathematische Annalen, 71. North-Holland, Amsterdam, American Elsevier: The Netherlands, New York, 1911, 1976:314–319. [Also in: Collected Works, 2:489–494].

140. Bruckstein, A.M. Self-similarity properties of digitized straight lines. Contemporary Mathematics. 1991;119:1–20.

141. Brunetti, S., Daurat, A., Del Lungo, A. Approximate X-rays reconstruction of special lattice sets. Pure Mathematics Applications. 2000;11:409–425.

142. Brunetti, S., Daurat, A. An algorithm reconstructing lattice convex sets. Theoretical Computer Science. 2003;304:35–57.

143. Bryant, A., Bryant, J. Following boundaries of discrete binary objects in space. Pattern Recognition. 1990;23:547–552.

144. Bryant, V. Metric spaces: Iteration and Application. Cambridge University Press: Cambridge, United Kingdom, 1985.

145. Brzoska, J.-B., Lesaffre, B., Coléou, C., Xu, K., Pieritz, R.A. Computation of 3D curvatures on a wet snow sample. Eur. Phys. J. Ap. 1999;7:45–57.

146. Buffon, G.L.L. Essai d’arithmétique morale. Supplément a L’Histoire Naturelle. 4, 1777.

147. Bullard, J.W., Garboczi, E.J., Carter, W.C., Fuller, E.R., Jr. Numerical methods for computing interfacial mean curvature. Computational Materials Science. 1995;4:103–116.

148. Bülow, T., Klette, R., Rubber band algorithm for estimating the length of digitized space curves. Proc. Int. Conf. Pattern Recognition, III. IEEE, 2000:551–555.

149. Bülow, T., Klette, R. Digital curves in 3D space and a linear-time length estimation algorithm. IEEE Trans. Pattern Analysis Machine Intelligence. 2002;24:962–970.

150. Bunch, B.H. Mathematical Fallacies and Paradoxes. Van Nostrand: New York, 1982.

151. Buneman, O.P., A grammar for the topological analysis of plane figures. Meltzer, B., Michie, D., eds. Machine Intelligence, 5. Edinburgh University Press: Edinburgh, Scotland, 1969:383–393.

152. Burago, Y.D., Zalgaller, V.A. Geometric Inequalities. Springer: Berlin, Germany, 1988.

153. Burckhardt, J.J. Zur Geschichte der Entdeckung der 230 Raumgruppen. Archive History Exact Sciences. 1967/1968;4:235–246.

154. Burt, P. Fast filter transforms for image processing. Computer Graphics Image Processing. 1981;16:20–51.

155. Busemann, R., Feller, W. Krümmungseigenschaften konvexer Flächen. Acta Mathematica. 1935;66:27–45.

156. Butt, M.A., Maragos, P. Optimum design of chamfer distance transforms. IEEE Trans. Image Processing. 1988;7:1477–1484.

157. Buzer, L., An incremental linear time algorithm for digital line and plane recognition using a linear incremental feasibility problem. Braquelaire, A., Lachaud, J.-O., Vialard, A., eds. Discrete Geometry for Computer Imagery. Springer: Berlin, Germany, 2002:372–381. Lecture Notes in Computer Science 2301

158. Bykov, A.I., Zerkalov, L.G. Algorithms for homotopy classification of binary images. Pattern Recognition. 1996;29:565–574.

159. Caglioti, V. On the uncertainty of straight lines in digital images. CVGIP: Graphical Models Image Processing. 1993;55:255–270.

160. Calabi, L., Hartnett, W.E. Shape recognition, prairie fires, convex deficiencies and skeletons. American Mathematical Monthly. 1968;75:335–342.

161. Campbell, D., Higgins, J. Matrix method for finding sets of contiguous non-zero elements in a 2-dimensional array—II. Pattern Recognition. 1988;21:451–453.

162. Canny, J., Reif, J.H. New lower bound techniques for robot motion planning problems. Proc. IEEE Conf. Foundations Computer Science. 1987:49–60.

163. Cardoner, R., Thomas, F. Residuals + directional gaps = skeletons. Pattern Recognition Letters. 1997;18:343–353.

164. Carrasco, R.C., Forcada, M.L. A note on the Nagendraprasad–Wang–Gupta thinning algorithm. Pattern Recognition Letters. 1995;16:539–541.

165. Cauchy, A., Recherches sur les polyèdres, 2de partie. Journal de l’Ecole Polytechnique Paris, 16. Gauthier-Villars: Paris, France, 1813, 1905:76–86. [Also in: Œuvres Completès d’Augustin Cauchy, ser.2, t.1, 13–25].

166. Cavalieri, B. 2nd. Geometria Indivisibilibus Continuorum Nova Quadam Ratione Promota. 1685, 1653. Bologna

167. Cayley, A. On contour and slope lines. London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science. 1859;18:264–268. Ser. 4

168. Cayley, A. An Elementary Treatise on Elliptic Functions. Deighton, Bell, and Co.: Cambridge, United Kingdom, 1876.

169. Cederberg, R. On the coding, processing, and display of binary images. Linköping, Sweden: Linköping University; 1980. PhD No. 57

170. Censor, Y., Matej, S., Binary steering of nonbinary iterative algorithms. Herman, G.T., Kuba, A., eds. Discrete Tomography – Foundations, Algorithms, and Applications. Birkhäuser: Boston, Massachusetts, 1999:285–296.

171. Chang, Y.-L., Aggarwal, J.K. Representing and estimating 3-D lines. Pattern Recognition. 1995;28:1181–1190.

172. Chassery, J.M. Connectivity and consecutivity in digital pictures. Computer Graphics Image Processing. 1979;9:294–300.

173. Chassery, J.M. Discrete convexity: Definition, parametrization and compatibility with continuous convexity. Computer Vision, Graphics, Image Processing. 1983;21:326–344.

174. Chassery, J.M., Montanvert, A. Géométrie Discrète en Imagerie. Hermès: Paris, 1991.

175. Chattopadhyay, S., Das, P.P. A new method of analysis for discrete straight lines. Pattern Recognition Letters. 1991;12:747–755.

176. Chattopadhyay, S., Das, P.P. Parameter estimation and reconstruction of digital conics in normal positions. CVGIP: Graphical Models Image Processing. 1992;54:385–395.

177. Chattopadhyay, S., Das, P.P. Estimation of the original length of a straight line segment from its digitization in three dimensions. Pattern Recognition. 1992;25:787–798.

178. Chattopadhyay, S., Das, P.P., Ghosh Dastidar, D. Reconstruction of a digital circle. Pattern Recognition. 1994;27:1663–1676.

179. Chaudhuri, B.B., Rosenfeld, A. On a metric distance between fuzzy sets. Pattern Recognition Letters. 1996;17:1157–1160.

180. Chaudhuri, B.B., Rosenfeld, A. On the computation of the digital convex hull and circular hull of a digital region. Pattern Recognition. 1998;31:2007–2016.

181. Chaudhuri, B.B., Rosenfeld, A. A modified Hausdorff distance between fuzzy sets. Information Sciences. 1999;118:159–171.

182. Chaudhuri, D., Murthy, C.A., Chaudhuri, B.B. A modified metric to compute distance. Pattern Recognition. 1992;25:667–677.

183. Chen, C.S., Tsai, W.H. A new fast one-pass thinning algorithm and its parallel hardware implementation. Pattern Recognition Letters. 1990;11:471–477.

184. Chen, L., Cooley, D.H., Zhang, J. The equivalence between two definitions of digital surfaces. Information Sciences. 1999;115:201–220.

185. Chen, L., Herman, G.T., Reynolds, R.A., Udupa, J.K. Surface shading in the cuberille environment. IEEE Computer Graphics Applications. 1985;5:33–43.

186. Chen, M.H., Yan, P.F. A fast algorithm to calculate the Euler number for binary images. Pattern Recognition Letters. 1988;8:295–297.

187. Chen, Y.S. Comments on “A systematic approach for designing 2-subcycle and pseudo 1-subcycle parallel thinning algorithms.”. Pattern Recognition. 1992;25:1545–1546.

188. Chen, Y.S. Hidden deletable pixel detection using vector analysis in parallel thinning to obtain bias-reduced skeletons. Computer Vision Image Understanding. 1998;71:294–311.

189. Chen, Y.S., Hsu, W.H. A modified fast parallel algorithm for thinning digital patterns. Pattern Recognition Letters. 1988;7:99–106.

190. Chen, Y.S., Hsu, W.H. Parallel algorithm for corner finding on digital curves. Pattern Recognition Letters. 1988;8:47–53.

191. Chen, Y.S., Hsu, W.H. A systematic approach for designing 2-subcycle and pseudo-subcycle parallel thinning algorithms. Pattern Recognition. 1989;22:267–282.

192. Chen, Y.S., Hsu, W.H. A comparison of some one-pass parallel thinnings. Pattern Recognition Letters. 1990;11:35–41.

193. Chen, Y.S., Yu, Y.T. Thinning approach for noisy digital patterns. Pattern Recognition. 1996;29:1802–1847.

194. Chetverikov, D., Szabo, Z. A simple and efficient algorithm for detection of high curvature points in planar curves. Proc. Workshop Austrian Pattern Recognition Group. 1999;128:175–184. Schriftenreihe der Â…CG

195. Chin, R.T., Wan, H.K., Stover, D.L., Iverson, R.D. A one-pass thinning algorithm and its parallel implementation. Computer Vision, Graphics, Image Processing. 1987;40:30–40.

196. Chleík, M., Sloboda, F. Approximation of surfaces by minimal surfaces with obstacles. Bratislava, Slovakia: Institute of Control Theory and Robotics, Slovak Academy of Sciences; 2000. Technical report

197. Choi, H.I., Choi, S.W., Moon, H.P., Wee, N.S. New algorithm for medial axis transform of plane domain. Graphical Models Image Processing. 1997;59:463–483.

198. Choi, J., Sellen, J., Yap, C.-K., Approximate Euclidean shortest path in 3-space. Proc. ACM Conf. Computational Geometry. ACM Press, 1994:41–48.

199. Choi, S.W., Seidel, H.-P. Hyperbolic Hausdorff distance for medial axis transform. Graphical Models. 2001;63:369–384.

200. Choi, S.W., Seidel, H.-P. Linear one-sided stability of MAT for weakly injective domain. J. Mathematical Imaging Vision. 2002;17:237–247.

201. Choy, S.S.O., Choy, C.S.T., Siu, W.C. New single-pass algorithm for parallel thinning. Computer Vision Image Understanding. 1995;62:69–77.

202. Clifford, W.K. The philosophy of the pure sciences. II. The postulates of the science of space. Contemporary Review. 1874;25:360–376. Also in: Gateway to the Great Books, Vol. 9: Mathematics, Encyclopaedia Britannica, 1963

203. Coeurjolly, D., Debled-Rennesson, I., Teytaud, O., Segmentation and length estimation of 3D discrete curves. Bertrand, G., Imiya, A., Klette, R., eds. Digital and Image Geometry: Advanced Lectures. Springer: Berlin, Germany, 2001:299–317. Lecture Notes in Computer Science 2243

204. Coeurjolly, D., Flin, F., Teytaud, O., Tougne, L., Multigrid convergence and surface area estimation. Asano, T., Klette, R., Ronse, C., eds. Geometry, Morphology, and Computational Imaging. Springer: Berlin, Germany, 2003:101–119. Lecture Notes in Computer Science 2616

205. Coeurjolly, D., Klette, R., A comparative evaluation of length estimators. Proc. Int. Conf. Pattern Recognition, IV. IEEE, 2002:330–334.

206. Coeurjolly, D., Klette, R. A comparative evaluation of length estimators of digital curves. IEEE Trans. Pattern Analysis Machine Intelligence. 2004;26:252–258.

207. Coeurjolly, D., Miguet, S., Tougne, L., Discrete curvature based on osculating circle estimation. Arcelli, C., Cordella, L.P., Sanniti di Baja, G., eds. Visual Form 2001. Springer: Berlin, Germany, 2001:303–312. Lecture Notes in Computer Science 2059

208. Coeurjolly, D., Teytaud, O. Multigrid convergence of discrete differential estimators: Discrete tangent and length estimation. Lyon, France: Laboratoire ERIC, Université Lumière; 2001. Research Report RR-0101

209. Cohen-Or, D., Kaufman, A. Fundamentals of surface voxelization. Graphical Models Image Processing. 1995;87:453–461.

210. Cohen-Or, D., Kaufman, A. 3D line voxelization and connectivity control. IEEE Computer Graphics Applications. 1997;17:80–87.

211. Cohen-Or, D., Kaufman, A., Kong, T.Y., On the soundness of surface voxelizations. Kong, T.Y., Rosenfeld, A., eds. Topological Algorithms for Digital Image Processing. Elsevier, Amsterdam: The Netherlands, 1996:181–204.

212. Coquin, D., Bolon, P. Discrete distance operator on rectangular grids. Pattern Recognition Letters. 1995;16:911–923.

213. Cordella, L.P., Sanniti di Baja, G. Geometric properties of the union of maximal neighborhoods. IEEE Trans. Pattern Analysis Machine Intelligence. 1989;11:214–217.

214. Cori, R. Graphes Planaires et Systèmes de Parenthèses. Centre National de la Recherche Scientifique, Institut Blaise Pascal: Paris, France, 1969.

215. Cormack, A.M., Early tomography and related topics. Herman, G.T., Natterer, F., eds. Mathematical Aspects of Computerized Tomography. Springer: Berlin, Germany, 1980:1–6. LNM 1497

216. Cotes, R., Logometria. Phil. Trans. Roy Soc. Lond., 29. Cambridge University Press: Cambridge, United Kingdom, 1983:169–171. [No. 338. 1714. English translation from Latin in R. Gowing, editor. Roger Cotes – Natural Philosopher, Appendix 1].

217. Couprie, M., Bertrand, G. Tessellations by connection. Pattern Recognition Letters. 2002;23:637–647.

218. Couprie, M., Bezerra, F.N., Bertrand, G. Grayscale image processing using topological operators. SPIE Vision Geometry VIII. 1999;3811:261–272.

219. Coven, E.M., Hedlund, G.A. Sequences with minimal block growth. Mathematical Systems Theory. 1973;7:138–153.

220. Coxeter, H.S.M. 3rd. Regular Polytopes. Dover: New York, 1973:122–123.

221. Coxeter, H.S.M. Introduction to Geometry. Wiley: New York, 1989.

222. Creutzburg, E. A. Hübler, and O. Sýkora. Geometric methods for on-line recognition of digital straight segments. Computers Artificial Intelligence. 1988;7:253–276.

223. Creutzburg, E., Hübler, A., Wedler, V., On-line Erkennung digitaler Geradensegmente in linearer Zeit. Klette, R., Mecke, J., eds. Proc. Geometric Problems of Image Processing. Jena University: Germany, 1982:48–65. [(See also: On-line recognition of digital straight line segments. Proc. Int. Conf. AI Inf. Control Systems Robots, Smolenice, 42–46, 1982.)].

224. Cuisenaire, O. Distance transformations: Fast algorithms and applications to medical image processing. Université Catholique de Louvain, Louvain-la-Neuve: France, 1999. PhD Thesis

225. Cuisenaire, O., Macq, B. Fast Euclidean distance transformation by propagation using multiple neighborhoods. Computer Vision Image Understanding. 1999;76:163–172.

226. Czyzowicz, J., Rivera-Campo, E., Urrutia, J. Illuminating rectangles and triangles in the plane. J. Combinatorial Theory. 1993;B57:1–17.

227. d’Amore, F., Franciosa, P.G. On the optimal binary plane partition for sets of isothetic rectangles. Information Processing Letters. 1992;44:255–259.

228. Danielsson, N.A. Axiomatic discrete geometry. London, United Kingdom: Internal report, Department of Computing, Imperial College; 2002.

229. Danielsson, P.E. Euclidean distance mapping. Computer Graphics Image Processing. 1980;14:227–248.

230. Danielsson, P.E. An improved segmentation and coding algorithm for binary and nonbinary images. IBM J. Research Development. 1982;26:698–707.

231. Das, P.P. An algorithm for computing the number of the minimal paths in digital images. Pattern Recognition Letters. 1989;9:107–116.

232. Das, P.P. More on path generated digital metrics. Pattern Recognition Letters. 1989;10:25–31.

233. Das, P.P. Metricity preserving transforms. Pattern Recognition Letters. 1989;10:73–76.

234. Das, P.P. Lattice of octagonal distances in digital geometry. Pattern Recognition Letters. 1990;11:663–667.

235. Das, P.P. Counting minimal paths in digital geometry. Pattern Recognition Letters. 1991;12:595–603.

236. Das, P.P. A note on “Distance functions in digital geometry.”. Information Sciences. 1992;58:181–190.

237. Das, P.P., Chakrabarti, P.P. Distance functions in digital geometry. Information Sciences. 1987;42:113–136.

238. Das, P.P., Chakrabarti, P.P., Chatterji, B.M. Generalized distances in digital geometry. Information Sciences. 1987;42:51–67.

239. Das, P.P., Chatterji, B.N. A note on “Distance transformations in arbitrary dimensions.”. Computer Vision, Graphics, Image Processing. 1988;43:368–385.

240. Das, P.P., Chatterji, B.N. Knight’s distance in digital geometry. Pattern Recognition Letters. 1988;7:215–226.

241. Das, P.P., Chatterji, B.N. Estimation of errors between Euclidean and m-neighbor distance. Information Sciences. 1989;48:1–26.

242. Das, P.P., Chatterji, B.N. Hyperspheres in digital geometry. Information Sciences. 1990;50:73–91.

243. Das, P.P., Chatterji, B.N. Octagonal distances for digital pictures. Information Sciences. 1990;50:123–150.

244. Das, P.P., Mukherjee, J. Metricity of super-knight’s distance in digital geometry. Pattern Recognition Letters. 1990;11:601–604.

245. Das, P.P., Mukherjee, J., Chatterji, B.N. The t-cost distance in digital geometry. Information Sciences. 1992;59:1–20.

246. Datta, A., Parui, S.K. A robust parallel thinning algorithm for binary images. Pattern Recognition. 1994;27:1181–1192.

247. Daurat, A., Del Lungo, A., Nivat, M. The medians of discrete sets according to a linear distance. Discrete Computational Geometry. 2000;23:465–483.

248. Davenport, H. On a principle of Lipschitz. J. London Mathematical Society. 1951;26:179–183.

249. Davies, A., Samuels, P. An Introduction to Computational Geometry for Curves and Surfaces. Clarendon Press: Oxford, United Kingdom, 1996.

250. Davies, E.R., Plummer, A.P.N. Thinning algorithms: A critique and a new methodology. Pattern Recognition. 1982;14:53–63.

251. Davis, L.S. Understanding shape: Angles and sides. IEEE Trans. Computers. 1977;26:236–242.

252. Davis, T.J. Fast decomposition of digital curves into polygons using the Haar transform. IEEE Trans. Pattern Analysis Machine Intelligence. 1999;21:786–790. PhD Thesis

253. Debled-Rennesson, I. Etude et reconnaissance des droites et plans discrets. Université Louis Pasteur: Strasbourg, Germany, 1995.

254. Debled-Rennesson, I., Remy, J.-L., Royer-Degli, J., Segmentation of discrete curves into fuzzy segments. Del Lungo, A., Di Gesù, V., Kuba, A., eds. Electronic Notes in Discrete Mathematics, 12. Elsevier, 2003.

255. Debled-Rennesson, I., Reveillès, J.-P. A new approach to digital planes. SPIE Vision Geometry III. 1994;2356:12–21.

256. Debled-Rennesson, I., Reveillès, J.-P. A linear algorithm for segmentation of digital curves. Int. J. Pattern Recognition Artificial Intelligence. 1995;9:635–662.

257. Deguchi, K., Multi-scale curvatures for contour feature extraction. Proc. Int. Conf. Pattern Recognition. IEEE, 1988:1113–1115.

258. Dehn, M., Heegard, P., Analysis situs. Enzyklopädie der Math. Wiss, III.1.1. Teubner: Leipzig, Germany, 1907:153–220.

259. Delaunay, B.N. Sur la sphère vide. Bull. Academy Science USSR (VII), Classe Sci. Mat. Nat. 1934;7:793–800.

260. Dellepiane, S., Fontana, F. Extraction of intensity connectedness for image processing. Pattern Recognition Letters. 1995;16:313–324.

261. Del Lungo, A., Nivat, N., Reconstruction of connected sets from two projections. Herman, G.T., Kuba, A., eds. Discrete Tomography – Foundations, Algorithms, and Applications. Birkhäuser: Boston, Massachusetts, 1999:163–188.

262. Del Lungo, A., Nivat, N., Pinzani, R. The number of convex polyominoes reconstructible from their orthogonal projections. Discrete Mathematics. 1996;157:65–78.

263. Deniau, L. Proposition d’un operateur géométrique pour l’analyse et l’identification de signaux et images. France: Université Paris-Sud (Orsay); 1997. PhD Thesis

264. Descartes, R. Discours de la Méthode pour Bien Conduire sa Raison et Chercher la Vérité dans les Sciences. Plus La Dioptrique, et La Géométrie, qui Sont des Essais de cette Méthode. Dover: Leyden, New York, 1637, 1954. [English translation of the appendix La Géométrie by D.E. Smith and M.L. Latham: The Geometry].

265. Devroye, L., Toussaint, G.T. A note on linear expected time algorithms for finding convex hulls. Computing. 1981;26:361–366.

266. Diaz-de-Leon, J.L.S., Sossa-Azuela, J.H. On the computation of the Euler number of a binary object. Pattern Recognition. 1996;29:471–476.

267. Di Gesu, V., Valenti, C., Detection of regions of interest via the pyramid discrete symmetry transform. Solina, F., Kropatsch, W.G., Klette, R., Bajcsy, R., eds. Advances in Computer Vision. Springer: Vienna, Austria, 1997:129–136.

268. Dijkstra, E.W. A note on two problems in connection with graphs. Numerische Mathematik. 1959;1:269–271.

269. Dillencourt, M.B., Samet, H., Tamminen, M. A general approach to connected-component labeling for arbitrary image representations. J. ACM. 1992;39:253–280.

270. Dimauro, G., Impedovo, S., Pirlo, G. A new thinning algorithm based on controlled deletion of edge regions. Int. J. Pattern Recognition Artificial Intelligence. 1993;7:969–986.

271. Dinneen, G.P., Programming pattern recognition. Proc. Western Joint Computer Conf. Inst. Electrical Engineers: New York, 1955:94–100.

272. Dirac, G.A. Some Theorems on Abstract Graphs. Proc. London Mathematical Society. 1952;2:69–81.

273. Dirichlet, G.L. Über die Reduktion der positiven quadratischen Formen mit drei unbestimmten ganzen Zahlen. J. Reine Angewandte Mathematik. 1850;40:209–227.

274. Döhler, H.-U., Zamperoni, P. Compact contour codes for convex binary patterns. Signal Processing. 1985;8:23–39.

275. Dokládal, P. Grey-scale image segmentation: A topological approach. Université de Marne-La-Vallée: France, 2000. PhD Thesis

276. Doros, M. Algorithms for generation of discrete circles, rings, and disks. Computer Graphics Image Processing. 1979;10:366–371.

277. Doros, M. On some properties of the generation of discrete circular arcs on a square grid. Computer Vision Graphics Image Processing. 1984;28:377–383.

278. Dorst, L., Duin, R.P.W. Spirograph theory: A framework for calculations on digitized straight lines. IEEE Trans. Pattern Analysis Machine Intelligence. 1984;6:632–639.

279. Dorst, L., Smeulders, A.W.M. Discrete representations of straight lines. IEEE Trans. Pattern Analysis Machine Intelligence. 1984;6:450–462.

280. Dorst, L., Smeulders, A.W.M. Best linear unbiased estimators for properties of digitized straight lines. IEEE Trans. Pattern Analysis Machine Intelligence. 1986;8:276–282.

281. Dorst, L., Smeulders, A.W.M. Length estimators for digitized contours. Computer Vision, Graphics, Image Processing. 1987;40:311–333.

282. Dorst, L., Smeulders, A.W.M. Discrete straight line segments: Parameters, primitives and properties. Contemporary Mathematics. 1991;119:45–62.

283. Dorst, L., Smeulders, A.W.M. Decomposition of discrete curves into piecewise segments in linear time. Contemporary Mathematics. 1991;119:169–195.

284. Du, D.Z., Kleitman, D.J. Diameter and radius in the Manhattan metric. Discrete Computational Geometry. 1990;5:351–356.

285. Dubois, D., Prade, H. Fuzzy Sets and Systems: Theory and Applications. Academic Press: New York, 1980.

286. Duda, R.O., Hart, P.E., Munson, J.H. Graphical-data-processing research study and experimental investigation. Menlo Park, California: Stanford Research Institute; 1967. TR ECOM-01901–26, March

287. Dufourd, J.F., Puitg, F. Functional specification and prototyping with combinatorial maps. Computational Geometry – Theory and Applications. 2000;16:129–156.

288. Dulucq, S., Gouyou-Beauchamps, D. Sur les facteurs des suites de Sturm. Theoretical Computer Science. 1991;71:381–400.

289. Dyer, C.R., Rosenfeld, A. Thinning algorithms for grayscale pictures. IEEE Trans. Pattern Analysis Machine Intelligence. 1979;1:88–89.

290. Dyer, C.R., Rosenfeld, A., Samet, H. Region representation: Boundary codes from quadtrees. Comm. ACM. 1980;23:171–179.

291. Eberly, D., Level set extraction from gridded 2D and 3D data. 2002 [www.magic-software.com/Documentation]

292. Eberly, D., Triangulation by ear clipping. 2002 [www.magic-software.com/Documentation]

293. Eberly, D., Lancaster, J., On gray scale image measurements. I: Arc length and area. CVGIP: Graphical Models Image Processing. 1991;53:538–549.

294. Eberly, D., Lancaster, J. On gray scale image measurements. II. Surface area and volume. CVGIP: Graphical Models Image Processing. 1991;53:550–562.

295. Eccles, M.J., McQueen, M.P.C., Rosen, D. Analysis of digitized boundaries of planar objects. Pattern Recognition. 1977;9:31–41.

296. Eckhardt, U. A note on Rutovitz’ method for parallel thinning. Pattern Recognition Letters. 1988;8:35–38.

297. Eckhardt, U., Latecki, L. Topologies for the digital spaces Z2 and Z3. Computer Vision Image Understanding. 2003;90:295–312.

298. Eckhardt, U., Maderlechner, G. Invariant thinning. Int. J. Pattern Recognition Artificial Intelligence. 1993;7:1115–1144.

299. Edelsbrunner, H. Algorithms in Combinatorial Geometry. Springer: Heidelberg, Germany, 1987.

300. Edelsbrunner, H. Geometry and Topology for Mesh Generation. Cambridge University Press: Cambridge, United Kingdom, 2001.

301. Edmonds, J. A combinatorial representation for polyhedral surfaces (abstract). Notices American Mathematical Society. 1960;7:646.

302. Efron, B. The convex hull of a random set of points. Biometrika. 1965;52:331–343.

303. Eggers, H. Parallel Euclidean distance transformations in image. Pattern Recognition Letters. 1996;17:751–757.

304. Eggers, H. Two fast Euclidean distance transformations in Z2 based on sufficient propagation. Computer Vision Image Understanding. 1998;69:106–116.

305. Ellis, T.J., Proffitt, D., Rosen, D., Rutkowski, W. Measurement of the lengths of digitized curved lines. Computer Graphics Image Processing. 1979;10:333–347.

306. Embrechts, H., Roose, D. A parallel Euclidean distance transformation algorithm. Computer Vision Image Understanding. 1996;63:15–26.

307. Erdös, P. Integral distances. Bull. American Mathematical Society. 1945;51:996.

308. Erdös, P., Grünwald, T., Vàzsonyi, E. Über Euler-Linien unendlicher Graphen. J. Math. Phys. Mass. Inst. of Tech. 1938;17:59–75.

309. Euler, L., Elementa doctrinae solidorum. Novi Commentarii Acad. Sc. Petrop. 1758;4:104–160. [(for 1752/3). Also in: Opera Omnia (Series I), 26: 72–108, 1975].

310. Fabbri, R., Estrozi, L.F., da Fontoura Costa, L. On Voronoi diagrams and medial axes. J. Mathematical Imaging Vision. 2002;17:27–40.

311. Faddeeva, V.N. Computational Methods of Linear Algebra. Dover: New York, 1959:154–155. Translated from Russian by C.D. Benster

312. Fam, A., Sklansky, J. Cellularly straight images and the Hausdorff metric. Proc. IEEE Conf. Pattern Recognition Image Processing. 1977:242–247.

313. Fan, K.C., Chen, D.F., Wen, M.G. Skeletonization of binary images with nonuniform width via block decomposition and contour vector matching. Pattern Recognition. 1998;31:823–838.

314. Faugeras, O.D., Hebert, M., Mussi, P., Boissonnat, J.D. Polyhedral approximation of 3-D objects without holes. Computer Vision, Graphics, Image Processing. 1984;25:169–183.

315. Favre, A., Keller, H. Parallel syntactic thinning by recoding of binary pictures. Computer Vision, Graphics, Image Processing. 1983;23:99–112.

316. Feder, J. Languages of encoded line patterns. Information Control. 1968;13:230–244.

317. Fedorov, E.S. The symmetry of regular systems of figures (in Russian). Proc. Imperial St. Petersburg Mineralogical Society. 1891;28:1–146. Series 2

318. Fedorov, E.S. Symmetry in the plane (in Russian). Proc. Imperial St. Petersburg Mineralogical Society. 1891;28:345–390. Series 2

319. Fejes Tóth, L. Lagerungen in der Ebene, auf der Kugel und im Raum. Springer: Berlin, Germany, 1953.

320. Fell, H. Detectable properties of planar figures. Information Control. 1976;31:107–128.

321. Ferguson, M.M., Jr. Matrix method for finding sets of contiguous non-zero elements in a 2-dimensional array. Pattern Recognition. 1986;19:73.

322. Ferreira, A., Ubeda, S. Computing the medial axis transform in parallel with eight scan operations. IEEE Trans. Pattern Analysis Machine Intelligence. 1999;21:277–282.

323. Feschet, F., Tougne, L., Optimal time computation of the tangent of a discrete curve: Application to the curvature. Bertrand, G., Couprie, M., Perroton, L., eds. Discrete Geometry for Computer Imagery. Springer: Berlin, Germany, 1999:31–40. Lecture Notes in Computer Science 1568

324. Feschet, F., Tougne, L., On the min DSS problem of closed discrete curves. Del Lungo, A., Di Gesù, V., Kuba, A., eds. Electronic Notes in Discrete Mathematics, 12. Elsevier, 2003.

325. Figueiredo, O., Reveillès, J.P., A contribution to 3D digital lines. Proc. Discrete Geometry for Computer Imagery. Clermond-Ferrand: France, 1995:187–198. Universit d’Auvergne (Laboratoire de Logique, Algorithmique et Informatique de Clermont 1)

326. Fiorio, C. Approche interpixel en analyse d’images, une topologie et des algorithmes de segmentation. Université des Sciences et Techniques du Languedoc: Montpellier, France, 1995. PhD Thesis

327. Fischler, M., Bolles, R. Perceptual organization and curve partitioning. IEEE Trans. Pattern Analysis Machine Intelligence. 1986;8:100–105.

328. Fisk, S. Separating point sets by circles, and the recognition of digital disks. IEEE Trans. Pattern Analysis Machine Intelligence. 1986;8:554–556.

329. Fitzgibbon, A., Pilu, M., Fisher, R.B. Direct least square fitting of ellipses. IEEE Trans. Pattern Analysis Machine Intelligence. 1999;21:476–480. to appear

330. Flin, J.-B. Brzoska, D. Coeurjolly, R.A. Pieritz, B. Lesaffre, C. Coléou, P. Lamboley, O. Teytaud, G. Vignoles, and J.-E Delesse. Adaptive estimation of normals and surface area for discrete 3D objects: Application to snow binary data from X-ray tomography. IEEE Trans. Image Processing, to appear.

331. Flin, F., Brzoska, J.-B., Lesaffre, B., Coléou, C., Lamboley, P. Computation of normal vectors of discrete 3D objects: Application to natural snow images from X-ray tomography. Image Analysis Stereology. 2001;20:187–191.

332. Forchhammer, S. Digital plane and grid point segments. Computer Vision, Graphics, Image Processing. 1989;47:373–384.

333. Forchhammer, S., Kim, C.E. Digital squares. Pullman, Washington: Washington State University; 1988. Technical report CS-88–182

334. Forder, H.G. The Foundations of Euclidean Geometry. Cambridge University Press: Cambridge, United Kingdom, 1927.

335. Forder, H.G. Coordinates in geometry. New Zealand: Auckland University College; 1953. Mathematical Series No. 1, Bulletin No. 41

336. Fourey, S., Kong, T.Y., Herman, G.T., Generic axiomatized digital surface-structures. Electronic Notes in Theoretical Computer Science, 46. Elsevier, 2001.

337. Fourey, S., Malgouyres, R., A concise characterization of 3D simple points. Borgefors, G., Nyström, I., Sanniti di Baja, G., eds. Discrete Geometry for Computer Imagery. Springer: Berlin, Germany, 2000:27–36. Lecture Notes in Computer Science 1953

338. Fourey, S., Malgouyres, R. A digital linking number for discrete curves. Int. J. Pattern Recognition Artificial Intelligence. 2001;15:1053–1074.

339. Françon, J. Discrete combinatorial surfaces. Graphical Models Image Processing. 1995;57:20–26.

340. Françon, J., Papier, L., Polyhedrization of the boundary of a voxel object. Bertrand, G., Couprie, M., Perroton, L., eds. Discrete Geometry for Computer Imagery. Springer: Berlin, Germany, 1999:425–434. Lecture Notes in Computer Science 1568

341. Françon, J., Schramm, J.-M., Tajine, M., Recognizing arithmetic straight lines and planes. Miguet, S., Montanvert, A., Ubéda, S., eds. Discrete Geometry for Computer Imagery. Springer: Berlin, Germany, 1996:141–150. Lecture Notes in Computer Science 1176

342. Freeman, H. Techniques for the digital computer analysis of chain-encoded arbitrary plane curves. Proc. Nat. Electronics Conf. 1961;17:421–432.

343. Freeman, H., A review of relevant problems in the processing of line-drawing data. Grasselli, A., eds. Automatic Interpretation and Classification of Images. Academic Press: New York, 1969:155–174.

344. Freeman, H., Boundary encoding and processing. Lipkin, B.S., Rosenfeld, A., eds. Picture Processing and Psychopictorics. Academic Press: New York, 1970:241–263.

345. Freeman, H. Computer processing of line-drawing images. ACM Computing Surveys. 1974;6:57–97.

346. Freeman, H., Davis, L.S. A corner finding algorithm for chain-coded curves. IEEE Trans. Computers. 1977;26:297–303.

347. Freeman, H., Shapira, R. Determining the minimum-area enclosing rectangle of an arbitrary closed curve. Comm. ACM. 1975;18:409–413.

348. Gaafar, M. Convexity verification, block-chords and digital straight lines. Computer Graphics Image Processing. 1977;6:361–370.

349. Gagvani, N., Silver, D. Parameter-controlled volume thinning. Graphical Models Image Processing. 1999;61:149–164.

350. Gale, D. A theorem on flows in networks. Pacific J. Mathematics. 1957;7:1073–1082.

351. Galil, Z., Park, K. Truly alphabet-independent two-dimensional pattern matching. Proc. IEEE Symp. Foundations Computer Science. 1992:247–256.

352. Galvin, F., Shore, S.D. Distance functions and topologies. American Mathematical Monthly. 1991;98:620–623.

353. Gardner, R.J., Gritzmann, P. Successive determination and verification of polytopes by their X-rays. J. London Mathematical Society. 1994;50:375–391. Second Series

354. Gardner, R.J., Gritzmann, P. Discrete tomography: Determination of finite sets by x-rays. Trans. American Mathematical Society. 1997;349:2271–2295.

355. Gardner, R.J., McMullen, P. On Hammer’s X-ray problem. J. London Mathematical Society. 1980;21:171–175.

356. Garey, M.R., Johnson, D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman: New York, 1983.

357. Gauss, J.C.F., Disquisitiones generales circa superficies curva. Commentationes Gottingensis, 6. Raven Press: Hewlett, New York, 1965:1823–1827. [English translation: General Investigations of Curved Surfaces. Introduction by R. Courant, translated from the Latin and German by A. Hiltebeitel and J. Morehead].

358. Gawehn, I. Über unberandete zweidimensionale Mannigfaltigkeiten. Mathematische Annalen. 1927;98:321–354.

359. Ge, Y., Fitzpatrick, J.M. On the generation of skeletons from discrete Euclidean distance maps. IEEE Trans. Pattern Analysis Machine Intelligence. 1996;18:1055–1066.

360. Gill, A. Minimum-scan pattern recognition. IRE Trans. Information Theory. 1959;5:52–57.

361. Giraldo, A., Gross, A., Latecki, L.J. Digitizations preserving shape. Pattern Recognition. 1999;32:365–370.

362. Giuliano, V.E., Jones, P.E., Kimball, G.E., Meyer, R.F., Stein, B.A. Automatic pattern recognition by a Gestalt method. Information and Control. 1961;4:332–345.

363. Gödel, K. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme, I. Monatshefte für Mathematik und Physik. 1931;38:173–198.

364. Goh, S.C., Lee, C.N. Counting minimal paths in 3D digital geometry. Pattern Recognition Letters. 1992;13:765–771.

365. Goh, S.-C., Lee, C.-N. Counting minimal 18-paths in 3D digital space. Pattern Recognition Letters. 1993;14:39–52.

366. Gokmen, M., Hall, R.W. Parallel shrinking algorithms using 2-subfields approaches. Computer Vision, Graphics, Image Processing. 1990;52:191–209.

367. Goldstein, A.J., An efficient and constructive algorithm for testing whether a graph can be embedded in a plane. Proc. Graph Combinatorics Conf. Princeton University: Princeton, New Jersey, 1963.

368. Golomb, S.W. 2nd. Polyominoes. Scribner’s, Princeton University Press: Princeton, New Jersey, New York, 1965, 1996.

369. Gong, W., Bertrand, G. A note on “Thinning of 3-D images using the Safe Point Thinning Algorithm (SPTA).”. Pattern Recognition Letters. 1990;11:499–500.

370. Gonzalez, R.C., Woods, R.E. 2nd. Digital Image Processing. Prentice Hall, Upper Saddle River: New Jersey, 2002.

371. Goodman, J.E., O’Rourke, J. Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton: Florida, 1997.

372. Gordon, R., Bender, R., Herman, G.T. Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and X-ray photography. J. Theoretical Biology. 1970;29:471–481.

373. Gotsman, C., Lindenbaum, M. Euclidean Voronoi labeling on the multidimensional grid. Pattern Recognition Letters. 1995;16:409–415.

374. Govindan, V.K., Shivaprasad, A.P. A pattern adaptive thinning algorithm. Pattern Recognition. 1987;20:623–637.

375. Graham, R.L. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters. 1972;7:175–180.

376. Gray, F., Pulse code communication, 1953. United States Patent 2,632,058, March 17

377. Gray, S.B. Local properties of binary images in two dimensions. IEEE Trans. Computers. 1971;20:551–561.

378. Greville, T.N.E. Theory and Applications of Spline Functions. Academic Press: New York, 1969.

379. Gries, D., Stojmenoviimage, I. A note on Graham’s convex hull algorithm. Information Processing Letters. 1987;25:323–327.

380. Gritzmann, P., Nivat, M. Discrete tomography: Algorithms and complexity. Wadern, Germany: Informatik-Zentrum Dagstuhl; 1997. Dagstuhl Seminar Report 165

381. Gritzmann, P., Prangenberg, D., de Vries, S., Wiegelmann, M. Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography. Int. J. Imaging Systems Technology. 1998;9:101–109.

382. Gross, A., Latecki, L.J. A realistic digitization model of straight lines. Computer Vision Image Understanding. 1997;67:131–142.

383. Gross, J.L., Alpert, S.R. The topological theory of current graphs. J. Combinatorial Theory. 1974;B17:218–233.

384. Grzegorczyk, A. An Outline of Mathematical Logic. Reidel: Dordrecht, The Netherlands, 1974.

385. Guan, W., Ma, S. A list-processing approach to compute Voronoi diagrams and the Euclidean distance transform. IEEE Trans. Pattern Analysis Machine Intelligence. 1998;20:757–761.

386. Gueziec, A., Hummel, R. Exploiting triangulated surface extraction using tetrahedral decomposition. IEEE Trans. Visualization Computer Graphics. 1995;1:328–342.

387. Guo, Z., Hall, R.W. Parallel thinning with two-subiteration algorithms. Comm. ACM. 1989;32:359–373.

388. Guo, Z., Hall, R.W. Fast fully parallel thinning algorithms. CVGIP: Image Understanding. 1992;55:317–328.

389. Hadwiger, H. Über die rationalen Hauptwinkel der Goniometrie. Elemente der Mathematik. 1946;1:98–100.

390. Hadwiger, H. Minkowskische Addition und Subtraktion beliebiger Punktmengen und die Theoreme von Erhard Schmidt. Mathematische Zeitschrift. 1950;53:210–218.

391. Hadwiger, H. Altes und Neues über konvexe Körper. Birkhäuser: Basel, Switzerland, 1955.

392. Hadwiger, H. Vorlesungen über Inhalt, Oberfläche, und Isoperimetrie. Springer: Berlin, Germany, 1957.

393. Hadwiger, H. Gitterperiodische Punktmengen und Isoperimetrie. Monatsh. Math. 1972;76:410–418.

394. Hadwiger, H., Debrunner, H. Combinatorial Geometry in the Plane. Holt, Rinehart and Winston: New York, 1964.

395. Hafford, K.J., Preston, K., Jr. Three-dimensional skeletonization of elongated solids. Computer Vision, Graphics, Image Processing. 1984;27:78–91.

396. Hagen, H., Heinz, S., Thesing, M., Schreiber, T. Simulation-based modeling. J. Shape Modeling. 1998;4:143–164.

397. Hakalahti, H., Harwood, D., Davis, L. Two-dimensional object recognition by matching local properties of contour points. Pattern Recognition Letters. 1984;2:227–234.

398. Hall, P., Molchanov, I.S. Corrections for systematic boundary effects in pixel-based area counts. Pattern Recognition. 1999;32:1519–1528.

399. Hall, R.W. Fast parallel thinning algorithms: Parallel speed and connectivity preservation. Comm. ACM. 1989;32:124–131.

400. Hall, R.W. Comments on “A parallel-symmetric thinning algorithm” by Bourbakis. Pattern Recognition. 1992;25:435–441.

401. Hall, R.W. Tests for connectivity preservation for parallel reduction operators. Topology and Its Applications. 1992;46:199–217.

402. Hall, R.W. Optimally small operator supports for fully parallel thinning algorithms. IEEE Trans. Pattern Analysis Machine Intelligence. 1993;15:828–833.

403. Hall, R.W., Parallel connectivity-preserving thinning algorithms. Kong, T.Y., Rosenfeld, A., eds. Topological Algorithms for Digital Image Processing. Elsevier: Amsterdam, The Netherlands, 1996:145–179.

404. Hall, R.W., Hu, C.Y. Time-efficient computation of 3D topological functions. Pattern Recognition Letters. 1996;17:1017–1033.

405. Hall, R.W., Kong, T.Y., Rosenfeld, A., Shrinking binary images. Kong, T.Y., Rosenfeld, A., eds. Topological Algorithms for Digital Image Processing. Elsevier: Amsterdam, The Netherlands, 1996:31–98.

406. Hammer, P.C., Problem 2. Proc. Symp. Pure Mathematics: Convexity, Vol. VII. American Mathematical Society, Providence: Rhode Island, 1963:498–499.

407. Han, J.H., Poston, T. Chord-to-point distance accumulation and planar curvature: A new approach to discrete curvature. Pattern Recognition Letters. 2001;22:1133–1144.

408. Hankins, T.L. Sir William Rowan Hamilton. Johns Hopkins University Press: Baltimore, Maryland, and London, United Kingdom, 1980:341–343.

409. Haralick, R.M., Shapiro, L.G. Computer and Robot Vision, Volume II. Addison-Wesley, Reading: Massachusetts, 1993.

410. Harary, F., The four color conjecture and other graphical diseases. Proc. Ann Arbor Graph Theory Conf. Academic Press: New York, 1969:1–9.

411. Harary, F., Melter, R.A., Tomescu, I. Digital metrics: A graph-theoretical approach. Pattern Recognition Letters. 1984;2:159–163.

412. Hardy, G.H., On the expressions of a number as the sum of two squares. Quarterly J. Mathematics, 46. Clarendon Press: Oxford, United Kingdom, 1915, 1967:263–283. [Also in: Collected Papers of G.H. Hardy 2:243–263].

413. Harper, L.H. Optimal numberings and isoperimetric problems on graphs. J. Combinatorial Theory. 1966;1:385–393.

414. Hausdorff, F. Mengenlehre. Gruyter: Berlin, Germany, 1927.

415. Heffter, L. Über das Problem der Nachbargebiete. Mathematische Annalen. 1891;8:17–20.

416. Heijmans, H.J.A.M., Morphological discretization. Eckhardt, U., Hübler, A., Nagel, W., Werner, G., eds. Geometrical Problems in Image Processing. Akademie Verlag: Berlin, Germany, 1991:99–106.

417. Heijmans, H.J.A.M. Morphological Image Operators. Academic Press: Boston, Massachusetts, 1994.

418. Heijmans, H.J.A.M., Ronse, C. The algebraic basis of mathematical morphology I: Dilations and erosions. Computer Vision Graphics Image Processing. 1990;50:245–295.

419. Heijmans, H.J.A.M., Toet, A. Morphological sampling. CVGIP: Image Understanding. 1991;54:384–400.

420. Held, A., Abe, K. On approximate convexity. Pattern Recognition Letters. 1994;15:611–618.

421. Held, A., Abe, K., Arcelli, C. Towards a hierarchical contour description via dominant point detection. IEEE Trans. Man, Cybernetics. 1994;24:942–949.

422. Helly, E. Über Mengen konvexer Körper mit gemeinschaftlichen Punkten. Jahresbericht Deutscher Mathematiker Vereinigung. 1923;32:175–176.

423. Herman, G.T., Reconstruction of binary patterns from a few projections. Günther, A., Levrat, B., Lipps, H., eds. Int. Computing Symposium. North-Holland: Amsterdam, The Netherlands, 1973:371–378.

424. Herman, G.T. On topology as applied to image analysis. Computer Vision, Graphics, Image Processing. 1990;52:409–415.

425. Herman, G.T. Discrete multidimensional Jordan surfaces. Contemporary Mathematics. 1991;119:85–94.

426. Herman, G.T. Discrete multidimensional Jordan surfaces. Graphical Models Image Processing. 1992;54:507–515.

427. Herman, G.T. Oriented surfaces in digital spaces. Graphical Models Image Processing. 1993;55:381–396.

428. Herman, G.T., Boundaries in digital spaces: Basic theory. Kong, T.Y., Rosenfeld, A., eds. Topological Algorithms for Digital Image Processing. Elsevier: Amsterdam, The Netherlands, 1996:233–261.

429. Herman, G.T. Geometry of digital spaces. SPIE Vision Geometry VII. 1998;3454:2–13.

430. Herman, G.T. Geometry of Digital Spaces. Birkhäuser: Boston, Massachusetts, 1998.

431. Herman, G.T., Kuba, A. Discrete Tomography – Foundations, Algorithms, and Applications. Birkhäuser: Boston, Massachusetts, 1999.

432. Herman, G.T., Webster, D., Surfaces of organs in discrete three-dimensional space. Herman, G., Natterer, F., eds. Mathematical Aspects of Computerized Tomography, 1980;8:204–224.

433. Herman, G.T., Webster, D. A topological proof of a surface tracking algorithm. Computer Vision, Graphics, Image Processing. 1983;23:162–177.

434. Hermann, S., Klette, R. Multigrid analysis of curvature estimators. Proc. Image Vision Computing New Zealand. 2003:108–112.

435. Hilbert, D. Über die stetige Abbildung einer Linie auf ein Flächenstück. Mathematische Annalen. 1891;38:459–460.

436. Hilbert, D. 13th, 1st. Grundlagen der Geometrie. B.G. Teubner: Leipzig, Germany, Stuttgart, 1899, 1987. (mit Suppl. von Paul Bernays),

437. Hilditch, C.J., Linear skeletons from square cupboards. Meltzer, B., Michie, D., eds. Machine Intelligence 4. Edinburgh University Press: Edinburgh, Scotland, 1969:403–420.

438. Hilditch, C.J. Comparison of thinning algorithms on a parallel processor. Image Vision Computing. 1983;1:115–132.

439. Hodes, L. The logical complexity of geometric properties in the plane. J. ACM. 1970;17:339–347.

440. Hodes, L. Discrete approximation of continuous convex blobs. SIAM J. Applied Mathematics. 1970;19:477–485.

441. Hölder, O. Beiträge zur Potentialtheorie. Diss. Tübingen: Stuttgart, Germany, 1882.

442. Holt, C.M., Stewart, A., Clint, M., Perrott, R.H. An improved parallel thinning algorithm. Comm. ACM. 1987;30:156–160.

443. Hopcroft, J., Tarjan, R. Efficient planarity testing. J. ACM. 1974;21:549–568.

444. Hu, G., Li, Z.N. An X-crossing preserving skeletonization algorithm. Int. J. Pattern Recognition Artificial Intelligence. 1993;7:1031–1053.

445. Hu, J., Yan, H. Polygonal approximation of digital curves based on the principles of perceptual organization. Pattern Recognition. 1997;30:701–718.

446. Hu, M.K. Visual pattern recognition by moment invariants. IRE Trans. Information Theory. 1962;8:179–187.

447. Huang, F., Wei, S.K., Klette, R., Geometrical fundamentals of polycentric panoramas. Proc. Int. Conf. Computer Vision. IEEE, 2001:560–565.

448. Huang, S.-C., Sun, Y.-N. Polygonal approximation using genetic algorithms. Pattern Recognition. 1999;32:1409–1420.

449. Hübler, A. Diskrete Geometrie für die digitale Bildverarbeitung. Jena, Germany: Habilitationschrift, Friedrich-Schiller-Universität; 1989.

450. Hübler, A., Motions in the discrete plane. Hübler, A., Nagel, W., Ripley, B.D., Werner, G., eds. Geometrical Problems in Image Processing. Akademie-Verlag: Berlin, Germany, 1989:29–36.

451. Hübler, A., Klette, R., Voss, K. Determination of the convex hull of a finite set of planar points within linear time. Elektronische Informationsverarbeitung Kybernetik. 1981;17:121–140.

452. Hübler, A., Klette, R., Werner, G. Shortest path algorithms for graphs of restricted in-degree and out-degree. Elektronische Informationsverarbeitung Kybernetik. 1982;18:141–151.

453. Hufnagl, P., Schlosser, A., Voss, K. Ein Algorithmus zur Konstruktion von Voronoidiagramm und Delaunaygraph. Bild und Ton. 1985;38:241–245.

454. Hung, S.H.Y. On the straightness of digital arcs. IEEE Trans. Pattern Analysis Machine Intelligence. 1985;7:1264–1269.

455. Hung, S.H.Y., Kasvand, T. Critical points on a perfectly 8- or 6-connected thin binary line. Pattern Recognition. 1983;16:297–306.

456. Hung, S.H.Y., Kasvand, T., On the chord property and its equivalences. Proc. Int. Conf. Pattern Recognition. IEEE, 1984:116–119.

457. Huttenlocher, D.P., Kedem, L., Computing the minimum Hausdorff distance for point sets under translation. Proc. ACM Symp. Computational Geometry. ACM Press, 1990:340–349.

458. Huttenlocher, D.P., Rucklidge, W.J. A multi-resolution technique for comparing images using the Hausdorff distance. Proc. IEEE Conf. Computer Vision Pattern Recognition. 1993:705–706.

459. Huxley, M.N. Exponential sums and lattice points. II. Proc. London Mathematical Society. 1993;66:279–301.

460. Huxley, M.N., The integer points close to a curve III. Iwaniec, H., Urbanowicz, J., Schinzel, A., eds. Number Theory in Progress. Walter de Gruyter: Berlin, Germany, 1999:911–940.

461. Imiya, A., Eckhardt, U. The Euler characteristics of discrete objects and discrete quasi-objects. Computer Vision Image Understanding. 1999;75:307–318.

462. Imiya, A., Saito, M., Tatara, K., Nakamura, K. Digital curvature flow and its application for skeletonization. J. Mathematical Imaging Vision. 2003;18:55–68.

463. Imiya, A., Ueno, T., Fermin, I. Discovery of symmetry by voting method. Engineering Applications Artificial Intelligence. 2002;15:161–168.

464. Irwin, M.C. Geometry of continued fractions. American Mathematical Monthly. 1989;96:696–703.

465. Iviimage, A., Koplowitz, J., Žuniimage, J.D. On the number of digital convex polygons inscribed into an (m, m)-grid. IEEE Trans. Information Theory. 1994;40:1681–1686.

466. Jacques, A. Sur le genre d’une paire de substitutions. C. R. Acad. Sci. Paris. 1968;7:625–627.

467. Jacques, A., Constellations et graphes topologiques. Proc. Colloque Math. Sot. János Bolyai. 1970: 657–672. North-Holland

468. Jain, R., Kasturi, R., Schunck, B.G. Machine Vision. McGraw-Hill: New York, 1995.

469. Jaisimha, M.Y., Haralick, R.M., Dori, D., Quantitative performance evaluation of thinning algorithms in the presence of noise. Arcelli, C., Cordella, L.P., Sanniti di Baja, G., eds. Aspects of Visual Form Processing. World Scientific: Singapore, 1994:261–286.

470. Jang, B.K., Chin, R.T. Analysis of thinning algorithms using mathematical morphology. IEEE Trans. Pattern Analysis Machine Intelligence. 1990;12:541–551.

471. Jang, B.K., Chin, R.T. One-pass parallel thinning: Analysis, properties, and quantitative evaluation. IEEE Trans. Pattern Analysis Machine Intelligence. 1992;14:1128–1140.

472. Jang, B.K., Chin, R.T. Reconstructable parallel thinning. Int. J. Pattern Recognition Artificial Intelligence. 1993;7:1145–1181.

473. Janos, L., Rosenfeld, A. Some results on fuzzy (digital) convexity. Pattern Recognition. 1982;15:379–382.

474. Janos, L., Rosenfeld, A. Digital connectedness: An algebraic approach. Pattern Recognition Letters. 1983;1:135–139.

475. Jarnik, I.V. Über die Gitterpunkte auf konvexen Kurven. Mathematische Zeitschrift. 1925;24:500–518.

476. Ji, L., Piper, J. Fast homotopy-preserving skeletons using mathematical morphology. IEEE Trans. Pattern Analysis Machine Intelligence. 1992;14:653–664.

477. Johnston, E.G., Rosenfeld, A., Geometrical operations on digitized pictures. Lipkin, B.S., Rosenfeld, A., eds. Picture Processing and Psychopictorics. Academic Press: New York, 1970:217–240.

478. Jolion, J.M. Stochastic pyramids. Pattern Recognition Letters. 2003;24:1035–1042.

479. Jolion, J.M., Rosenfeld, A. A Pyramid Framework for Early Vision. Kluwer: Dordrecht, The Netherlands, 1994.

480. Jonas, A., Kiryati, N. Digital representation schemes for 3-D curves. Pattern Recognition. 1997;30:1803–1816.

481. Jonas, A., Kiryati, N. Length estimation in 3-D using cube quantization. J. Mathematical Imaging Vision. 1998;8:215–238.

482. Jonker, P.P. Skeletons in N dimensions using shape primitives. Pattern Recognition Letters. 2002;23:677–686.

483. Jordan, C. Cours d’Analyse de l’École Polytechnique, Vol. 4. Gauthier-Villars: Paris, France, 1887,1961. [Also in: Œuvres de Camille Jordan].

484. Jordan, C., Remarques sur les intégrales définies. Journal de Mathématiques 1892;8:69–99. [(4e Série)].

485. Jung, H.W.E. Über die kleinste Kugel, die eine räumliche Figur einschliesst. J. Reine Angewandte Mathematik. 1901;123:241–257.

486. Kakarala, R., On symmetry in digital geometry. Klette, R., Rosenfeld, A., Sloboda, F., eds. Advances in Digital and Computational Geometry. Springer: Singapore, 1998:317–339.

487. Kalles, D., Morris, D.T. A novel fast and reliable thinning algorithm. Image Vision Computing. 1993;11:588–603.

488. Kameswara Rao, C.V., Danielsson, P.E., Kruse, B. Checking connectivity preservation properties of some types of picture processing operations. Computer Graphics Image Processing. 1978;8:299–309.

489. Kameswara Rao, C.V., Prasada, B., Sarma, K.R. A parallel shrinking algorithm for binary patterns. Computer Graphics Image Processing. 1976;5:265–270.

490. Kantorowitsch, L.W., Akilow, G.P. Funktionalanalysis in normierten Räumen. Akademie-Verlag: Berlin, Germany, 1964.

491. Kaufmann, A. Introduction to the Theory of Fuzzy Subsets. Academic Press: New York, 1975.

492. Kawai, S. On the topology preserving property of local parallel operations. Computer Graphics Image Processing. 1982;19:265–280.

493. Kawai, S. Topology quasi-preservation by local parallel operations. Computer Vision, Graphics, Image Processing. 1983;23:353–365.

494. Keller, S.R. On the surface area of the ellipsoid. Mathematics of Computation. 1979;33:310–314.

495. Kenmochi, Y., Imiya, A. Discretization of three-dimensional objects: Approximation and convergence. SPIE. Vision Geometry VII. 1998;3454:64–74.

496. Kenmochi, Y., Imiya, A., Ichikawa, A. Discrete combinatorial geometry. Pattern Recognition. 1997;30:1719–1728.

497. Kenmochi, Y., Imiya, A., Ichikawa, A. Boundary extraction of discrete objects. Computer Vision Image Understanding. 1998;71:281–293.

498. Kenmochi, Y., Klette, R. Surface area estimation for digitized regular solids. SPIE. Vision Geometry IX. 2000;4117:100–111.

499. Kenmochi, Y., Kotani, K., Imiya, A. Marching cubes method with connectivity. Proc. IEEE Conf. Image Processing. 1999;4:361–365.

500. Keppel, E. Approximation of complex surfaces by triangulation of contour lines. IBM J. Research Development. 1975;19:2–11.

501. Keskes, N., Faugeras, O. Surfaces simples dans Z3. Proc. Congrès Reconaissance des Formes et Intelligence Artificielle. 1981:718–729. AFRIF-AFIA

502. Khachan, M., Chenin, P., Deddi, H. Polyhedral representation and adjacency graph in n-dimensional digital images. Computer Vision Image Understanding. 2000;79:428–441.

503. Khalimsky, E., Pattern analysis of N-dimensional digital images. Proc. Int. Conf. Systems, Man, Cybernetics. IEEE, 1986:1559–1562.

504. Khalimsky, E., Motion, deformation, and homotopy in finite spaces. Proc. Int. Conf. Systems, Man, Cybernetics. IEEE, 1987:227–234.

505. Khalimsky, E., Kopperman, R., Meyer, P.R. Computer graphics and connected topologies on finite ordered sets. Topology and its Applications. 1990;36:1–17.

506. Khanna, V., Gupta, P., Hwang, C.J. Finding connected components in digital images by aggressive reuse of labels. Image Vision Computing. 2002;20:557–568.

507. Khuller, S., Rosenfeld, A., Wu, A. Centers of sets of pixels. Discrete Applied Mathematics. 2000;103:297–306.

508. Kim, C.E. On the cellular convexity of complexes. IEEE Trans. Pattern Analysis Machine Intelligence. 1981;3:617–625.

509. Kim, C.E. On cellular straight line segments. Computer Graphics Image Processing. 1982;18:369–381.

510. Kim, C.E. Digital convexity, straightness, and convex polygons. IEEE Trans. Pattern Analysis Machine Intelligence. 1982;4:618–626.

511. Kim, C.E. Three-dimensional digital line segments. IEEE Trans. Pattern Analysis Machine Intelligence. 1983;5:231–234.

512. Kim, C.E. Digital disks. IEEE Trans. Pattern Analysis Machine Intelligence. 1984;6:372–374.

513. Kim, C.E. Three-dimensional digital planes. IEEE Trans. Pattern Analysis Machine Intelligence. 1984;6:639–645.

514. Kim, C.E., Rosenfeld, A., On the convexity of digital regions. Proc. Int. Conf. Pattern Recognition. IEEE, 1980:1010–1015.

515. Kim, C.E., Rosenfeld, A., Digital straightness and convexity. Proc. ACM Symp. Theory of Computing. ACM Press, 1981:80–89.

516. Kim, C.E., Rosenfeld, A. Digital straight lines and convexity of digital regions. IEEE Trans. Pattern Analysis Machine Intelligence. 1982;4:149–153.

517. Kim, C.E., Rosenfeld, A. Convex digital solids. IEEE Trans. Pattern Analysis Machine Intelligence. 1982;4:612–618.

518. Kim, C.E., Sklansky, J. Digital and cellular convexity. Pattern Recognition. 1982;15:359–367.

519. Kim, C.E., Stojmenovic, I. On the recognition of digital planes in three-dimensional space. Pattern Recognition Letters. 1991;12:665–669.

520. Kimmel, R., Kiryati, N., Bruckstein, A.M. Sub-pixel distance maps and weighted distance transforms. J. Mathematical Imaging Vision. 1996;6:223–233.

521. Kimmel, R., Shaked, D., Kiryati, N., Bruckstein, A.M. Skeletonization via distance maps and level sets. Computer Vision Image Understanding. 1995;62:382–391.

522. Kiryati, N., Jonas, A. Length estimation in 3D using cube quantization. J. Mathematical Imaging Vision. 1998;8:215–238.

523. Kiryati, N., Kübler, O. Chain code probabilities and optimal length estimators for digitized three-dimensional curves. Pattern Recognition. 1995;28:361–372.

524. Kiryati, N., Lindenbaum, M., Bruckstein, A.M. Digital or analog Hough transform? Pattern Recognition Letters. 1991;12:291–297.

525. Kiryati, N., Székely, G. Estimating shortest paths and minimal distances on digitized three-dimensional surfaces. Pattern Recognition. 1993;26:1623–1637.

526. Kiselman, C.O. Regularity properties of distance transformations in image analysis. Computer Vision Image Understanding. 1996;64:390–398.

527. Kiselman, C.O., Digital Jordan curve theorem. Borgefors, G., Nyström, I., Sanniti di Baja, G., eds. Discrete Geometry for Computer Imagery. Springer: Berlin, Germany, 2000. Lecture Notes in Computer Science 1953,

528. Kishimoto, K. Characterizing digital convexity and straightness in terms of “length” and “total absolute curvature.”. Computer Vision Image Understanding. 1996;63:326–333.

529. Klaasman, H. Some aspects of the accuracy of the approximated position of a straight line on a square grid. Computer Graphics Image Processing. 1975;4:225–235.

530. Klarner, D.A. Cell growth problems. Canadian J. Mathematics. 1967;19:851–863.

531. Klette, G. A comparative discussion of distance transforms and simple deformations in digital image processing. Machine Graphics Vision. 2003;12:235–256.

532. Klette, R., Wir konstruieren einen vierdimensionalen Würfel. Wurzel, 6. Mathematics Department, University of Jena: Germany, 1972:88–91.

533. Klette, R. A parallel computer for digital image processing. Elektronische Informationsverarbeitung Kybernetik. 1979;15:237–263.

534. Klette, R. Parallel operations on binary pictures. Computer Graphics Image Processing. 1980;14:145–158.

535. Klette, R., Hüllen für endliche Punktmengen. Klette, R., Mecke, J., eds. Proc. Geometric Problems of Image Processing. Jena University: Germany, 1982:74–83.

536. Klette, R., M-dimensional cellular spaces. Computer Science Dep., TR-1266. University of Maryland: College Park, Maryland, 1983.

537. Klette, R. On the approximation of convex hulls of finite grid point sets. Pattern Recognition Letters. 1983;2:19–22.

538. Klette, R., Grundbegriffe der digitalen Geometrie. Proc. Automatische Bildverarbeitung. Jena University: Germany, 1983:94–126.

539. Klette, R. Mathematische Probleme der digitalen Bildverarbeitung. Bild und Ton. 1983;36:107–113.

540. Klette, R. The m-dimensional grid point space. Computer Vision, Graphics, Image Processing. 1985;30:1–12.

541. Klette, R. Measurement of object surface area. Computer Assisted Radiology. 1998:147–152.

542. Klette, R. Cell complexes through time. SPIE. Vision Geometry IX. 2000;4117:134–145.

543. Klette, R., Multigrid convergence of geometric features. Bertrand, G., Imiya, A., Klette, R., eds. Digital and Image Geometry: Advanced Lectures. Springer: Berlin, Germany, 2001:314–333. Lecture Notes in Computer Science 2243

544. Klette, R., Digital geometry – The birth of a new discipline. Davis, L.S., eds. Foundations of Image Understanding. Kluwer: Boston, Massachusetts, 2001:33–71.

545. Klette, R., Switches may solve adjacency problems. Proc. Int. Conf. Pattern Recognition, III. IEEE, 2002:907–910.

546. Klette, R., Bülow, T., Minimum-length polygons in simple cube-curves. Borgefors, G., Nyström, I., Sannati di Baja, G., eds. Discrete Geometry for Computer Imagery. Springer: Berlin, Germany, 2000:467–478. Lecture Notes in Computer Science 1953

547. Klette, R., Krishnamurthy, E.V. Algorithms for testing convexity of digital polygons. Computer Graphics Image Processing. 1981;16:177–184.

548. Klette, R., Schlüns, K., Koschan, A. Computer Vision – Three-Dimensional Data from Images. Springer: Singapore, 1998.

549. Klette, R., Stojmenoviimage, I., Žuniimage, J. A parametrization of digital planes by least square fits and generalizations. Graphical Models Image Processing. 1996;58:295–300.

550. Klette, R., Sun, H.-J., Digital planar segment based polyhedrization for surface area estimation. Arcelli, C., Cordella, L.P., Sanniti di Baja, G., eds. Visual Form 2001. Springer: Berlin, Germany, 2001:356–366. Lecture Notes in Computer Science 2059

551. Klette, R., Voss, K. Theoretische Grundlagen der digitalen Bildverarbeitung, Part III: Gebietsnachbarschaftsgraphen. Bild und Ton. 1986;39:45–50. 55

552. Klette, R., Voss, K. Theoretische Grundlagen der digitalen Bildverarbeitung, Part VII: Planare reguläre Gitter und Polygone im Gitter. Bild und Ton. 1987;40:112–118.

553. Klette, R., Voss, K., The three basic formulas of oriented graphs. Pattern Recognition Image Analysis, 1. University of Maryland: College Park, Maryland, 1991,1987:385–405. Also in: Center for Automation Research, TR-305

554. Klette, R., Voss, K., Hufnagl, P. Theoretische Grundlagen der digitalen Bildverarbeitung, Part II: Nachbarschaftsstrukturen. Bild und Ton. 1985;38:325–331.

555. Klette, R., Yip, B., The length of digital curves. Machine Graphics Vision 2000;9:673–703. [(Extended verison of: R. Klette, V.V. Kovalevsky and B. Yip. Length estimation of digital curves. SPIE Vision Geometry VIII3811:117–129, 1999.].

556. Klette, R., Zamperoni, P. Measures of correspondence between binary patterns. Image Vision Computing. 1987;5:287–295.

557. Klette, R., Zamperoni, P. Handbook of Image Processing Operators. Wiley, Chichester: United Kingdom, 1996.

558. Klette, R., Žuniimage, J. Digital approximation of moments of convex regions. Graphical Models Image Processing. 1999;61:274–298.

559. Klette, R., Žuniimage, J. Interactions between number theory and image analysis. SPIE. Vision Geometry IX. 2000;4117:210–221.

560. Klette, R., Žuniimage, J. Multigrid convergence of calculated features in image analysis. J. Mathematical Imaging Vision. 2000;13:173–191.

561. Klette, R., Žuniimage, J., Multigrid error bounds for moments of arbitrary order. Proc. Int. Conf. Pattern Recognition, III. IEEE, 2000:790–793.

562. Klette, R., Žuniimage, J. Towards experimental studies of digital moment convergence. SPIE. Vision Geometry IX. 2000;4117:12–23.

563. Klotzek, B. Kombinieren, Parkettieren, Färben. Aulis, Köln: Germany, 1985.

564. Knorr, W.R. Evolution of the Elements: A Study of the Theory of Incommensurable Magnitudes and its Significance for Early Greek Geometry. Reidel: Dordrecht, The Netherlands, 1975.

565. Knorr, W.R. The Ancient Tradition of Geometric Problems. Dover: New York, 1993.

566. Knuth, D.E. The Art of Computer Programming, Vol. 2. Addison-Wesley, Reading: Massachusetts, 1969:316–332. 309

567. Kong, T.Y. A digital fundamental group. Computers & Graphics. 1989;13:159–166.

568. Kong, T.Y. On topology preservation in 2-D and 3-D thinning. Int. J. Pattern Recognition Artificial Intelligence. 1995;9:813–844.

569. Kong, T.Y., Digital topology. Davis, L.S., eds. Foundations of Image Understanding. Kluwer: Boston, Massachusetts, 2001:33–71.

570. Kong, T.Y. Topological adjacency relations on Zn. Theoretical Computer Science. 2002;283:3–28.

571. Kong, T.Y., Kopperman, R., Meyer, P.R. A topological approach to digital topology. American Mathematical Monthly. 1991;92:901–917.

572. Kong, T.Y., Litherland, R., Rosenfeld, A., Problems in the topology of binary digital images. van Mill J., Reed G.M., eds. Open Problems in Topology. 1990: 376–385. North-Holland, Amsterdam, The Netherlands

573. Kong, T.Y., Roscoe, A.W. Continuous analogs of axiomatized digital surfaces. Computer Vision, Graphics, Image Processing. 1985;29:60–86.

574. Kong, T.Y., Roscoe, A.W. A theory of binary digital pictures. Computer Vision, Graphics, Image Processing. 1985;32:221–243.

575. Kong, T.Y., Roscoe, A.W. Characterizations of simply-connected finite polyhedra in 3-space. Bull. London Mathematical Society. 1985;17:575–578.

576. Kong, T.Y., Roscoe, A.W., Rosenfeld, A. Concepts of digital topology. Topology and its Applications. 1992;46:219–262.

577. Kong, T.Y., Rosenfeld, A. Digital topology: Introduction and survey. Computer Vision, Graphics, Image Processing. 1989;48:357–393.

578. Kong, T.Y., Rosenfeld, A. If we use 4- or 8-connectedness for both the objects and the background, the Euler characteristic is not locally computable. Pattern Recognition Letters. 1990;11:231–232.

579. Kong, T.Y., Rosenfeld, A. Digital topology: A comparison of the graph-based and topological approaches. In: Reed G.M., Roscoe A.W., Wachter R.F., eds. Topology and Category Theory in Computer Science. Oxford, United Kingdom: Oxford University Press; 1991:273–289.

580. Kong, T.Y., Rosenfeld, A. Topological Algorithms for Digital Image Processing. 1996. North-Holland, Amsterdam, The Netherlands

581. Kong, T.Y., Rosenfeld, A., Digital topology: A brief introduction and bibliography. Kong T.Y., Rosenfeld A., eds. Topological Algorithms for Digital Image Processing. 1996: 263–292. North-Holland, Amsterdam, The Netherlands

582. Kong, T.Y., Udupa, J.K. A justification of a fast surface tracking algorithm. Graphical Models Image Processing. 1992;54:162–170.

583. Koplowitz, J. On the performance of chain codes for quantization of line drawings. IEEE Trans. Pattern Analysis Machine Intelligence. 1981;3:180–185.

584. Koplowitz, J., Bruckstein, A.M. Design of perimeter estimators for digitized planar shapes. IEEE Trans. Pattern Analysis Machine Intelligence. 1989;11:611–622.

585. Koplowitz, J., Lindenbaum, M., Bruckstein, A.M. The number of digital straight lines on an N × N grid. IEEE Trans. Information Theory. 1990;36:192–197.

586. Koplowitz, J., Plante, S. Corner detection for chain coded curves. Pattern Recognition. 1995;28:843–852.

587. Kopperman, R., Meyer, P.R., Wilson, R. A Jordan surface theorem for three-dimensional digital spaces. Discrete Computational Geometry. 1991;6:155–161.

588. Kovalevsky, V. Bilderkennung mit Hilfe einer Kreisbogenapproximation mit Minmax-Eigenschaften. Tagungsbericht Akad. Landwirtsch-Wiss. DDR. 1982;204:5–17.

589. Kovalevsky, V. Discrete topology and contour definition. Pattern Recognition Letters. 1984;2:281–288.

590. Kovalevsky, V., Strukturen der Bildträger und Bilder. Proc. Automatische Bildverarbeitung. Jena University: Germany, 1986:122–149.

591. Kovalevsky, V. Finite topology as applied to image analysis. Computer Vision, Graphics, Image Processing. 1989;46:141–161.

592. Kovalevsky, V., New definition and fast recognition of digital straight segments and arcs. Proc. Int. Conf Pattern Recognition. IEEE, 1990:31–34.

593. Kovalevsky, V., Applications of digital straight segments to economical image encoding. Ahronovitz E., Fiorio C., eds. Discrete Geometry for Computer Imagery. 1997: 51–62. Lecture Notes in Computer Science 1347, Springer, Berlin, Germany

594. Kovalevsky, V., Algorithms and data structures for computer topology. Bertrand G., Imiya A., Klette R., eds. Digital and Image Geometry Advanced Lectures. 2001: 38–58. Lecture Notes in Computer Science 2243, Springer, Berlin, Germany

595. Kovalevsky, V. Curvature in digital 2D images. Int. J. Pattern Recognition Artificial Intelligence. 2001;15:1183–1200.

596. Kovalevsky, V. Multidimensional cell lists for investigating 3-manifolds. Discrete Applied Mathematics. 2003;125:25–44.

597. Kovalevsky, V., Fuchs, S. Theoretical and experimental analysis of the accuracy of perimeter estimates. In: Förstner W., Ruwiedel S., eds. Robust Computer Vision. Karlsruhe, Germany: Wichmann; 1992:218–242.

598. Krätzel, E. Zahlentheorie. VEB Deutscher Verlag der Wissenschaften: Berlin, Germany, 1981.

599. Krishnaswamy, R., Kim, C.E. Digital parallelism, perpendicularity, and rectangles. IEEE Trans. Pattern Analysis Machine Intelligence. 1987;9:316–321.

600. Kritikos, N. Über konvexe Flächen und einschließende Kugeln. Mathematische Annalen. 1926;95:583–587.

601. Kropatsch, W.G., Tockner, H. Detecting the straightness of digital curves in O(N) steps. Computer Vision, Graphics, Image Processing. 1989;45:1–21.

602. Kruse, B. A fast algorithm for segmentation of connected components in binary images. Proc. Scandinavian Conf. Image Analysis. 1980:57–63.

603. Kruse, B., Rao, C.V.K., A matched filtering technique for corner detection. Proc. Int. Conf Pattern Recognition. IEEE, 1978:642–644.

604. Kulkarni, S.R., Mitter, S.K., Richardson, T.J., Tsitsiklis, J.N. Local versus nonlocal computation of length of digitized curves. IEEE Trans. Pattern Analysis Machine Intelligence. 1994;16:711–718.

605. Kulpa, Z. Area and perimeter measurements of blobs in discrete binary pictures. Computer Graphics Image Processing. 1977;6:434–454.

606. Kulpa, Z. On the properties of discrete circles, rings, and disks. Computer Graphics Image Processing. 1979;10:348–365.

607. Kulpa, Z. More about areas and perimeters of quantized objects. Computer Vision, Graphics, Image Processing. 1983;22:268–276.

608. Kulpa, Z., Kruse, B. Algorithm for circular propagation in discrete images. Computer Vision, Graphics, Image Processing. 1983;24:305–328.

609. Kumar, P., Bhatnagar, D., Unapathi Rao, P.S. Pseudo one pass thinning algorithm. Pattern Recognition Letters. 1991;12:543–555.

610. Kundu, M.K., Chaudhuri, B.B., Dutta Majumder, D. A parallel greytone thinning algorithm. Pattern Recognition Letters. 1991;12:491–496.

611. Kuratowski, C., Sur le probleme des courbes gauches en topologie. Fundamenta Mathematica, 15. Polish Scientific Publishers: Warszawa, Poland,, 1930, 1988:271–283. Also in: K. Borsuk editor. Selected Papers 345–357 PWN –

612. Kwok, P.C.K. A thinning algorithm by contour generation. Comm. ACM. 1988;31:1314–1324.

613. Lachaud, J.-O., Montanvert, A. Continuous analogs of digital boundaries: A topological approach to isosurfaces. Graphical Models. 2000;62:129–164.

614. Lakatos, I. Proofs and Refutations: The Logic of Mathematical Discovery. Cambridge University Press: Cambridge, United Kingdom, 1976.

615. Lam, L., Lee, S.W., Suen, C.Y. Thinning methodologies—A comprehensive survey. IEEE Trans. Pattern Analysis Machine Intelligence. 1992;14:869–885.

616. Landau, E. Vorlesungen über Zahlentheorie. 1927. Reprint: Chelsea, New York, 1955., Hirzel, Leipzig, Germany

617. Landau, E. Ausgewählte Abhandlungen zur Gitterpunktlehre. Deutscher Verlag der Wissenschaften: Berlin, Germany, 1962.

618. Langridge, D.J. On the computation of shape. In: Watanabe S., ed. Frontiers of Pattern Recognition. London, United Kingdom: Academic Press; 1972:347–366.

619. Lantuejoul, C., Maisonneuve, F. Geodesic methods in quantitative image analysis. Pattern Recognition. 1984;17:177–187.

620. Latecki, L. Topological connectedness and 8-connectedness in digital pictures. CVGIP: Image Understanding. 1993;57:261–262.

621. Latecki, L. Multicolor well-composed pictures. Pattern Recognition Letters. 1995;16:425–431.

622. Latecki, L.J. 3D well-composed pictures. Graphical Models Image Processing. 1997;59:164–172.

623. Latecki, L.J. Discrete Representation of Spatial Objects in Computer Vision. 1998. Kluwer, Dordrecht, The Netherlands

624. Latecki, L., Conrad, C., Gross, A. Preserving topology by a digitization process. J. Mathematical Imaging Vision. 1998;8:131–159.

625. Latecki, L., Eckhardt, U., Rosenfeld, A. Well-composed sets. Computer Vision Image Understanding. 1995;61:70–83.

626. Latecki, L., Ma, C.M. An algorithm for a 3D simplicity test. Computer Vision Image Understanding. 1996;63:388–393.

627. Latecki, L.J., Rosenfeld, A. Supportedness and tameness: Differentialless geometry of plane curves. Pattern Recognition. 1998;31:607–622.

628. Lawden, D.F. Elliptic Functions and Applications. 1989: 100–102. Springer, New York

629. Lee, C.-N., Poston, T., Rosenfeld, A. Representation of orthogonal regions by vertices. CVGIP: Graphical Models Image Processing. 1991;53:149–156.

630. Lee, C.-N., Poston, T., Rosenfeld, A. Winding and Euler numbers in 2D and 3D digital images. CVGIP: Graphical Models Image Processing. 1991;53:522–537.

631. Lee, C.-N., Poston, T., Rosenfeld, A. Holes and genus of 2D and 3D digital images. CVGIP: Graphical Models Image Processing. 1993;55:20–47.

632. Lee, C.-N., Rosenfeld, A. Simple connectivity is not locally computable for connected 3D images. Computer Vision, Graphics, Image Processing. 1990;51:87–95.

633. Lee, C.Y., Wang, P.S.P. A simple and robust thinning algorithm. Int. J. Pattern Recognition Artificial Intelligence. 1999;13:357–366.

634. Lee, D.T. Medial axis transformation of a planar shape. IEEE Trans. Pattern Analysis Machine Intelligence. 1982;4:363–369.

635. Lee, H.C., Fu, K.S. Using the FFT to determine digital straight line chain codes. Computer Graphics Image Processing. 1982;18:359–368.

636. Lee, S.W., Lam, L., Suen, C.Y. A systematic evaluation of skeletonization algorithms. Int. J. Pattern Recognition Artificial Intelligence. 1993;7:1203–1225.

637. Lee, T.C., Kashyap, R.L., Chu, C.N. Building skeleton models via 3-D medial surface/axis thinning algorithms. Graphical Models Image Processing. 1994;56:462–478.

638. Lee, Y.H., Horng, S.J. Optimal[ly] computing the chessboard distance transform on parallel processing systems. Computer Vision Image Understanding. 1999;73:374–390.

639. Lefschetz, S. Introduction to Topology. Princeton University Press: Princeton, New Jersey, 1949.

640. Legendre, A.-M. Traite de Fonctions Élliptiques tome 1. Huzard-Courchier: Paris, 1825.

641. Leighton, R.B., et al. Mariner 6 television pictures: First report. Science. 1969;165:684–690.

642. Lenoir, A. Des outils pour les surfaces discrètes. Université de Caen: France, 1999. PhD Thesis

643. Lenoir, A. Fast estimation of mean curvature on the surface of a 3D discrete object. ISMRA. 2001;6:303–312.

644. Lenoir, A., Malgouyres, R., Revenu, R., Fast computation of the normal vector field of the surface of a 3-D discrete object. Miguet S., Montanvert A., Ubéda S., eds. Discrete Geometry for Computer Imagery. 1996: 101–112. Lecture Notes in Computer Science 1176, Springer, Berlin, Germany

645. Levi, G., Montanari, U. A gray-weighted skeleton. Information Control. 1970;17:62–91.

646. Levialdi, S. On shrinking binary picture patters. Comm. ACM. 1972;15:7–10.

647. Levitt, N. The Euler characteristic is the unique locally determined numerical homotopy invariant of finite complexes. Discrete Computational Geometry. 1992;7:59–67.

648. Leymarie, F., Levine, M.D. Fast raster scan distance propagation on the discrete rectangular lattice. CVGIP: Image Understanding. 1992;55:84–94.

649. Lhuilier, A.-J. Mémoire sur la polyédrométrie, contenant une démonstration directe du théoréme d’Euler sur les polyédres, et un examen de diverses exceptions auxquelles ce théoréme est assujetti (extrait par M. Gergonne). Annales de Mathématiques Pures et Appliquées par Gergonne. 1812;III:169ff.

650. Li, B., Suen, C.Y. A knowledge-based thinning algorithm. Pattern Recognition. 1991;24:1211–1221.

651. Li, S.X., Loew, M.H., Analysis and modeling of digitized straight-line segments. Proc. Int. Conf Pattern Recognition. IEEE, 1988:294–296.

652. Lienhardt, P. Topological models for boundary representation: A comparison with n-dimensional generalized maps. Computer Aided Design. 1991;23:59–81.

653. Lindeberg, T. Scale-Space Theory in Computer Vision. Kluwer: Dordrecht, The Netherlands, 1994.

654. Lindenbaum, M. Compression of chain codes using digital straight line sequences. Pattern Recognition Letters. 1988;7:167–171.

655. Lindenbaum, M., Bruckstein, A.M. On recursive, O(N) partitioning of a digitized curve into digital straight segments. IEEE Trans. Pattern Analysis Machine Intelligence. 1993;15:949–953.

656. Lindenbaum, M., Koplowitz, J. A new parametrization of digital straight lines. IEEE Trans. Pattern Analysis Machine Intelligence. 1991;13:847–852.

657. Lindenbaum, M., Koplowitz, J., Bruckstein, A.M., On the number of digital straight lines on an N × N grid. Proc. IEEE Conf. Computer Vision Pattern Recognition. 1988: 610–615.

658. Linh, T.K., Imiya, A. Nonlinear optimization for polygonalization. IEICE Technical Report. 2003;102:43–48.

659. Lipschitz, R. Asymptotische Gesetze gewisser zahlentheoretischer Functionen. Monatsbericht Königl. Akademie der Wissenschaften zu Berlin. 1865:174–184.

660. Listing, J.B. Vorstudien zur Topologie. Göttinger Studien, 1. Abteilung math. und naturw. Abh., 1847 811–875. Several missing proofs were later published by P.G. Tait On knots. Proc. Roy. Soc Edinburgh. 1875–1878;9:306–317. A more recent review: A. Tripodi L’introduzione alla topologia di Johann Benedict Listing. Mem. Acad. Naz Sci. Lett. Arti Modena 13:3–14, 1971

661. Listing, J.B. Der Census räumlicher Complexe oder Verallgemeinerungen des Euler’schen Satzes von den Polyëdern. Abhandlungen der Mathematischen Classe der Königlichen Gesellschaft der Wissenschaften zu Göttingen. 1861 and 1862;10:97–182.

662. Liu, H.-C., Srinath, M.D. Corner detection from chain code. Pattern Recognition. 1990;23:51–68.

663. Lobregt, S., Verbeek, P.W., Groen, F.C.A. Three-dimensional skeletonization: Principle and algorithm. IEEE Trans. Pattern Analysis Machine Intelligence. 1980;2:75–77.

664. Lochovsky, A.F. Algorithms for realtime component labelling of images. Image Vision Computing. 1988;6:21–27.

665. Loeb, J. Communication theory of transmission of simple drawings. In: Jackson W., ed. Communication Theory. London, United Kingdom: Butterworths; 1953:317–327.

666. Lohou, C., Contribution à l’analyse topologique des images: Etude d’algorithmes de squelettisation pour images 2D et 3D, selon une approche topologie digitale ou topologie discrète. Université de Marne-La-Vallée: France, 2001. PhD Thesis

667. Lorensen, W.E., Cline, H.E. Marching cubes – A high-resolution 3D surface construction algorithm. Computer Graphics. 1987;21:163–169.

668. Lothaire, M. Lothaire, M., eds. 2nd. Combinatorics on Words. Cambridge University Press: Cambridge, United Kingdom, 1987.

669. Lothaire, M. Lothaire, M., eds. Algebraic Combinatorics on Words. Cambridge University Press: Cambridge, United Kingdom, 2002.

670. Ada, Augusta, Countess of Lovelace. Note F to her translation (1843) of L.F. Menabrea. Morrison, P.E., eds. Sketch of the Analytical Engine Invented by Charles Babbage. Dover: New York, 1961:281. Charles Babbage and his Calculating Engines

671. Lowen, R. Convex fuzzy sets. Fuzzy Sets Systems. 1980;3:291–310.

672. Lu, H.E., Wang, P.S.P. A comment on “A fast parallel algorithm for thinning digital patterns.”. Comm. ACM. 1986;29:239–242.

673. Luczak, E., Rosenfeld, A. Distance on a hexagonal grid. IEEE Trans. Computers. 1976;25:532–533.

674. Lumia, R. A new three-dimensional connected components algorithm. Computer Vision, Graphics, Image Processing. 1983;23:207–217.

675. Lumia, R., Shapiro, L., Zuniga, O. A new connected components algorithm for virtual memory computers. Computer Vision, Graphics, Image Processing. 1983;22:287–300.

676. Lunnon, W.F., Pleasants, P.A.B. Characterization of two-distance sequences. J. Australian Mathematical Society. 1992;A53:198–218.

677. Ma, C.M. On topology preservation in 3D thinning. CVGIP Image Understanding. 1994;59:328–339.

678. Ma, C.M. A 3D fully parallel thinning algorithm for generating medial faces. Pattern Recognition Letters. 1995;16:83–87.

679. Ma, C.M. Connectivity preservation of 3D 6-subiteration thinning algorithms. Graphical Models Image Processing. 1996;58:382–386.

680. Ma, C.M., Sonka, M. A fully parallel 3D thinning algorithm and its applications. Computer Vision Image Understanding. 1996;64:420–433.

681. Ma, C.M., Wan, S.Y. Parallel thinning algorithms on 3D (18,6) binary images. Computer Vision Image Understanding. 2000;80:364–378.

682. Ma, C.M., Wan, S.Y., Chang, H.K. Extracting medial curves on 3-D images. Pattern Recognition Letters. 2002;23:895–904.

683. Ma, C.M., Wan, S.Y., Lee, J.D. Three-dimensional topology preserving reduction on the 4-subfields. IEEE Trans. Pattern Analysis Machine Intelligence. 2002;24:1594–1605.

684. Maes, M. Digitization of straight line segments: Closeness and convexity. Computer Vision, Graphics, Image Processing. 1990;52:297–305.

685. Magillo, P. Spatial operations on multiresolution cell complexes. Università di Genova: Italy, 1999. PhD Thesis

686. Malandain, G., Bertrand, G., Ayache, N. Topological segmentation of discrete surfaces. Int. J. Computer Vision. 1993;10:183–197.

687. Malandain, G., Fernández-Vidal, S. Euclidean skeletons. Image Vision Computing. 1998;16:317–327.

688. Malgouyres, R. Graphs generalizing closed curves with linear construction of the Hamiltonian cycle. Theoretical Computer Science. 1995;143:189–249.

689. Malgouyres, R. There is no local characterization of separating and thin objects in Z2. Theoretical Computer Science. 1996;116:303–308.

690. Malgouyres, R. A definition of surfaces of Z3: A new 3D discrete Jordan theorem. Theoretical Computer Science. 1997;186:1–41.

691. Malgouyres, R. Local characterization of strong surfaces within strongly separating objects. Pattern Recognition Letters. 1998;19:341–349.

692. Malgouyres, R. Homotopy in two-dimensional digital images. Theoretical Computer Science. 2000;230:221–233.

693. Malgouyres, R. Computing the fundamental group in digital spaces. Int. J. Pattern Recognition Artificial Intelligence. 2001;15:1075–1088.

694. Malgouyres, R., Bertrand, G. Complete local characterization of strong 26-surfaces: Continuous analogs for strong 26-surfaces. Int. J. Pattern Recognition Artificial Intelligence. 1999;13:465–484.

695. Malgouyres, R., Lenoir, A. Topology preservation within digital surfaces. Graphical Models. 2002;62:71–84.

696. Mangoldt, H.v., Knopp, K. Einführung in die höhere Mathematik (III. Band 12. Auflage). Hirzel: Leipzig, Germany, 1965.

697. Manzanera, A., Bernard, T.M., Prêteux, F., Longuet, B., Ultra-fast skeleton based on an isotropic fully parallel algorithm. Bertrand G., Couprie M., Perroton L., eds. Discrete Geometry for Computer Imagery. 1999: 313–324. Lecture Notes in Computer Science 1568, Springer, Berlin, Germany

698. Manzanera, A., Bernard, T.M., Prêteux, F., Longuet, B. A unified mathematical framework for a compact and fully parallel n-D skeletonisation procedure. SPIE. Vision Geometry VIII. 1999;3811:57–68.

699. Manzanera, A., Bernard, T.M., A coherent collection of 2D parallel thinning algorithms Ecole Nationale Supérieure de Techniques Avancées, Laboratoire d’Electronique de Informatique, TR 02-002, 2002. Paris, France

700. Marchand-Maillet, S., Sharaiha, Y.M. Discrete convexity, straightness, and the 16-neighborhood. Computer Vision Image Understanding. 1997;66:316–329.

701. Marchand-Maillet, S., Sharaiha, Y.M. Skeleton location and evaluation based on local digital width in ribbon-like images. Pattern Recognition. 1997;30:1855–1865.

702. Marchand-Maillet, S., Sharaiha, Y.M. Euclidean ordering via chamfer distance calculations. Computer Vision Image Understanding. 1999;73:404–413.

703. Marchand-Maillet, S., Sharaiha, Y.M. Binary Digital Image Processing – A Discrete Approach. San Diego, California: Academic Press, 2000.

704. Marji, M. On the detection of dominant points on digital planar curves. Detroit, Michigan: Wayne State University, 2003. PhD Thesis

705. Martin, G.E. Transformation Geometry: An Introduction to Symmetry. New York: Springer, 1992.

706. Martinez-Perez, M.P., Jimenez, J., Navalon, J.L. A thinning algorithm based on contours. Computer Vision, Graphics, Image Processing. 1987;39:186–201.

707. Matheron, G. Random Sets and Integral Geometry. Wiley: New York, 1975.

708. Matheron, G., Examples of topological properties of skeletons. Serra, J., eds. Mathematical Morphology and Image Analysis II: Theoretical Advances. Academic Press: London, United Kingdom, 1988:217–237.

709. Matheron, G., Serra, J., The birth of mathematical morphology. Talbot, H., Beare, R., eds. Proc. Int. Society for Math. Morphology. 2002: 1–16.

710. Maunder, C.R.F. 2nd. Algebraic Topology. Cambridge University Press, Dover: Cambridge, United Kingdom, New York, 1980, 1996. Reprint

711. Maxwell, J.C. On hills and dales. London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science. 1870;40:421–427. Series 4

712. Mazurkiewicz, S., Sur les lignes de Jordan. Fundamenta Mathematica, 1. PWN – Polish Scientific Publishers: Warszawa, Poland, 1920, 1969:166–209. Also in: Travaux de Topologie et ses Applications 77–113.

713. McIlroy, M.D. Best approximate circles on integer grids. ACM Trans. Graphics. 1983;2:237–263.

714. McIvor, A.M. A cubic facet based method for estimating the principal quadric. Proc. Image Vision Computing New Zealand. 1998:136–141.

715. McIvor, A.M., Valkenburg, R.J. A comparison of local surface geometry estimation methods. Machine Vision Applications. 1997;10:17–26.

716. Medioni, G., Yasumoto, Y. Corner detection and curve representation using cubic B-splines. Computer Vision, Graphics, Image Processing. 1987;39:267–278.

717. Megiddo, N. Linear programming in linear time when the dimension is fixed. J. ACM. 1984;31:114–127.

718. Mehnert, A.J.H., Jackway, P.T. On computing the exact Euclidean distance transform on rectangular and hexagonal grids. J. Mathematical Imaging Vision. 1999;11:223–230.

719. Melter, R.A. Some characterizations of city block distance. Pattern Recognition Letters. 1987;6:235–240.

720. Melter, R.A. Convexity is necessary—A correction. Pattern Recognition Letters. 1988;8:59.

721. Melter, R.A. A survey of digital metrics. Contemporary Mathematics. 1991;119:95–106.

722. Melter, R.A., Rosenfeld, A. New views of linearity and connectedness in digital geometry. Pattern Recognition Letters. 1989;10:9–16.

723. Melter, R.A., Stojmenovic, I., Zunic, J. A new characterization of digital lines by least square fits. Pattern Recognition Letters. 1993;14:83–88.

724. Melter, R.A., Tomescu, I. Path generated digital metrics. Pattern Recognition Letters. 1983;1:151–154.

725. Melter, R.A., Tomescu, I. Metric bases in digital geometry. Computer Vision, Graphics, Image Processing. 1984;25:113–121.

726. Menger, K. Kurventheorie. Teubner: Leipzig, Germany, 1932.

727. Meusnier, J.B. Mémoire sur la courbure des surfaces. Mém. des savans étrangers. 1776;10:477–510.

728. Meyer, F. Topographic distance and watershed lines. Signal Processing. 1994;38:113–125.

729. Mignosi, F. On the number of factors of Sturmian words. Theoretical Computer Science. 1991;82:71–84.

730. Milun, E.H., Walters, D.K.W., Li, Y. General ribbon-based thinning algorithms for stylus-generated images. Computer Vision Image Understanding. 1999;76:267–277.

731. Milun, E.H., Walters, D.K.W., Li, Y., Atanacio, B. General ribbons: A model for stylus-generated images. Computer Vision Image Understanding. 1999;76:259–266.

732. Minkowski, H. Volumen und Oberfläche. Mathematische Annalen. 1903;57:447–495.

733. Minkowski, H. Geometrie der Zahlen. Teubner: Leipzig, Germany, 1910.

734. Minsky, M., Papert, S. Perceptrons—An Introduction to Computational Geometry. MIT Press: Cambridge, Massachusetts, 1969.

735. Möbius, A.F., Über die Bestimmung des Inhaltes eines Polyëders. Leipziger Sitzungsberichte math.phys. Classe, 17, 2. Hirzel: Stuttgart, Germany, 1867, 1886:473–512. Also in: Gesammelte Werke, (Facsimile edition: Dr. Martin Saendig oHG, Wiesbaden, Germany, 1967.)

736. Moga, A.N. Parallel image component labelling with watershed transformations. IEEE Trans. Pattern Analysis Machine Intelligence. 1997;19:441–450.

737. Mokhtarian, F., Mackworth, A. Scale-based description and recognition of planar curves and two-dimensional shapes. IEEE Trans. Pattern Analysis Machine Intelligence. 1986;8:34–43.

738. Montanari, U. A method for obtaining skeletons using a quasi-Euclidean distance. J. ACM. 1968;15:600–624.

739. Montanari, U. A note on minimal length polygonal approximation to a digitized contour. Comm. ACM. 1970;13:41–47.

740. Montanari, U. On limit properties of digitization schemes. J.ACM. 1970;17:348–360.

741. Montani, C., Scanteni, R., Scopigno, R. Discretized marching cubes. Proc. IEEE Visualization. 1994:281–286.

742. Moon, B.S. A representation of digitized patterns and an edge tracking thinning method. Pattern Recognition. 2001;34:2155–2161.

743. Moore, E.F., The shortest path through a maze. Proc. Int. Symp. Switching Theory, II. Harvard University Press: Cambridge, Massachusetts, 1959:285–292.

744. Moore, G.A., Automatic scanning and computer processes for the quantitative analysis of micrographs and equivalent subjects. Cheng, G.C., Ledley, R.S., Pollock, D.K., Rosenfeld, A., eds. Pictorial Pattern Recognition. Thompson: Washington, DC, 1968:275–326.

745. Moreau, P. Transformations et modélisation de dégradés dans le plan discret. France: Université Bordeaux − 1; 1995. PhD Thesis

746. Morgan, F. 3rd. Geometric Measure Theory. Academic Press: San Diego, California, 2000.

747. Morgenthaler, D.G., Rosenfeld, A. Surfaces in three-dimensional digital images. Information Control. 1981;51:227–247.

748. Morse, M., Hedlund, G.A. Symbolic dynamics II: Sturmian sequences. American J. Mathematics. 1940;61:1–42.

749. Mott-Smith, J.C., Medial axis transformations. Lipkin, B.S., Rosenfeld, A., eds. Picture Processing and Psychopictorics. Academic Press: New York, 1970:266–278.

750. Mukherjee, J., Chatterji, B.N. Thinning of 3-D images using the Safe Point Thinning Algorithm (SPTA). Pattern Recognition Letters. 1989;10:167–173.

751. Mukherjee, J., Aswatha Kumar, M., Das, P.P., Chatterji, B.N. Use of medial axis transforms for computing normals at boundary points. Pattern Recognition Letters. 2002;23:1649–1656.

752. Mukherjee, J., Das, P.P., Aswatha Kumar, M., Chatterji, B.N. On approximating Euclidean metrics by digital distances in 2D and 3D. Pattern Recognition Letters. 2000;21:573–582.

753. Mukherjee, J., Das, P.P., Chatterji, B.N. On connectivity issues of ESPTA. Pattern Recognition Letters. 1990;11:643–648.

754. Mullikin, J.C. The vector distance transform in two and three dimensions. Graphical Models Image Processing. 1992;54:526–535.

755. Murthy, I.S.N., Udupa, K.J. A search algorithm for skeletonization of thick patterns. Computer Graphics Image Processing. 1974;3:247–259.

756. Mylopoulos, J.P., Pavlidis, T., On the topological properties of quantized spaces. I: The notion of dimension. J. ACM. 1971;18:239–246.

757. Mylopoulos, J.P., Pavlidis, T. On the topological properties of quantized spaces. II. Connectivity and order of connectivity. J. ACM. 1971;18:247–254.

758. Naccache, N.J., Shinghal, R. SPTA: A proposed algorithm for thinning binary patterns. IEEE Trans. Man, Cybernetics. 1984;14:409–418.

759. Naccache, N.J., Shinghal, R. An investigation into the skeletonization approach of Hilditch. Pattern Recognition. 1984;17:279–284.

760. Naccache, N.J., Shinghal, R., In: response to “A comment on an investigation into the skeletonization approach of Hilditch.”. Pattern Recognition, 1986;19:111.

761. Nacken, P.F.M. Chamfer metrics in mathematical morphology. J. Mathematical Imaging Vision. 1994;4:233–253.

762. Nakagawa, Y., Rosenfeld, A. A note on the use of local min and max operations in digital picture processing. IEEE Trans. Man, Cybernetics. 1978;8:899–901.

763. Nakamura, A., Aizawa, K. Digital circles. Computer Vision, Graphics, Image Processing. 1984;26:242–255.

764. Nakamura, A., Aizawa, K. Digital images of geometric pictures. Computer Vision, Graphics, Image Processing. 1985;30:107–120.

765. Nakamura, A., Aizawa, K. Digital squares. Computer Vision, Graphics, Image Processing. 1990;49:357–368.

766. Nakamura, A., Aizawa, K. Some results concerning connected fuzzy digital pictures. Pattern Recognition Letters. 1991;12:335–341.

767. Nakamura, A., Rosenfeld, A. Digital calculus. Information Sciences. 1997;98:83–98.

768. Nakamura, A., Rosenfeld, A. Digital knots. Pattern Recognition. 2000;33:1541–1553.

769. Nassimi, D., Sahni, S. Finding connected components and connected ones on a mesh-connected parallel computer. SIAMJ. Computing. 1980;9:744–757.

770. Neumann, R., Teisseron, G. Extraction of dominant points by estimation of the contour fluctuations. Pattern Recognition. 2002;35:1447–1462.

771. Newman, M.H.A. 2nd. Elements of the Topology of Plane Sets of Points. Cambridge University Press: London, United Kingdom, 1939, 1954.

772. Newman, J.R. William Kingdon Clifford. Scientific American. 1953;188(2):78–84.

773. Newman, W.M., Sproull, R.F. 2nd. Principles of Interactive Computer Graphics. McGraw Hill: New York, 1979.

774. Niblack, C.W., Gibbons, P.B., Capson, D.W. Generating skeletons and centerlines from the distance transform. Graphical Models Image Processing. 1992;54:420–437.

775. Nielson, G.M., Hamann, B. The asymptotic decider: Resolving the ambiguity in marching cubes. Proc. IEEE Visualization. 1991:83–91.

776. Nielson, G.M., Huang, A., Sylvester, S. Approximating normals for marching cubes applied to locally supported isosurfaces. Proc. IEEE Visualization. 2002:459–466.

777. Nilsson, F., Danielsson, P.E. Finding the minimal set of maximum disks for binary objects. Graphical Models Image Processing. 1997;59:55–60.

778. L. Noakes and R. Kozera. More-or-less uniform sampling and lengths of curves. Quarterly J. Applied Mathematics, to appear.

779. Noakes, L., Kozera, R., Klette, R., Length estimation for curves with different samplings. Bertrand, G., Imiya, A., Klette, R., eds. Digital and Image Geometry: Advanced Lectures. Springer, Berlin: Germany, 2001:334–346. Lecture Notes in Computer Science 2243

780. Nogly, D., Schladt, M. Digital topology on graphs. CVGIP: Image Understanding. 1996;63:394–396.

781. Novikov, S.P., Fomenko, A.T. Basic Elements of Differential Geometry and Topology. Nauka: Moscow, Russia, 1987. (in Russian)

782. Ogawa, H. Corner detection on digital curves based on local symmetry of the shape. Pattern Recognition. 1989;22:351–357.

783. O’Gorman, L. k × k thinning. Computer Vision, Graphics, Image Processing. 1990;51:195–215.

784. O’Handley, D.A., Green, W.D. Recent developments in digital image processing at the Image Processing Laboratory at the Jet Propulsion Laboratory. Proc. IEEE. 1972;60:821–828.

785. Okabe, N., Toriwaki, J., Fukumura, T. Paths and distance functions on three-dimensional digitized pictures. Pattern Recognition Letters. 1983;1:205–212.

786. Ore, O. Theory of Graphs. American Mathematical Society: Rhode Island, 1962. Providence

787. Osgood, W.F. On the existence of the Green’s function for the most general simply connected plane region. Trans. American Mathematical Society. 1900;1:310–314. 2:484–485, 1901

788. Osserman, R. The isoperimetric inequality. Bulletin American Mathematical Society. 1978;84:1182–1238.

789. Pach, J., Agarwal, P.K. Combinatorial Geometry. Wiley: New York, 1995.

790. Pal, S.K. Fuzzy skeletonization of an image. Pattern Recognition Letters. 1989;10:17–23.

791. Pal, S., Bhattacharya, P. Analysis of template matching thinning algorithms. Pattern Recognition. 1992;25:497–505.

792. Pal, S.K., Rosenfeld, A. A fuzzy medial axis transformation based on fuzzy disks. Pattern Recognition Letters. 1991;12:585–590.

793. Palagyi, K. A 3-subiteration thinning algorithm for extracting medial surfaces. Pattern Recognition Letters. 2002;23:663–675.

794. Palagyi, K., Kuba, A. A 3D 6-subiteration thinning algorithm for extracting medial lines. Pattern Recognition Letters. 1998;19:613–627.

795. Palagyi, K., Kuba, A. A parallel 3D 12-subiteration thinning algorithm. Graphical Models Image Processing. 1999;61:199–221.

796. Papier, L. Polyédrisation et visualisation d’objets discrets tridimensionnels. Strasbourg, Germany: Université Louis Pasteur; 2000. PhD Thesis

797. Papier, L., Francon, J. Evaluation de la normale au bord d’un object discret 3D. Revue de CFAO et d’Informatique Graphique. 1998;13:205–226.

798. Parchomenko, A.S. Was ist eine Kurve ?. VEB Deutscher Verlag der Wissenschaften: Berlin, Germany, 1957.

799. Parui, S.K. A parallel algorithm for decomposition of binary objects through skeletonization. Pattern Recognition Letters. 1991;12:235–240.

800. Passat, N. Caractérisation des Empreintes Anatomiques sur le Foie. Strasbourg, Germany: Université Louis Pasteur; 2002.

801. Paterson, M., Yao, F. Optimal binary space partitions for orthogonal objects. J. Algorithms. 1992;13:99–113.

802. Pavlidis, T. Structural Pattern Recognition. Springer: New York, 1977.

803. Pavlidis, T. A thinning algorithm for discrete binary images. Computer Graphics Image Processing. 1980;12:142–157.

804. Pavlidis, T. An asynchronous thinning algorithm. Computer Graphics Image Processing. 1982;20:133–157.

805. Pavlidis, T. Algorithms for Graphics and Image Processing. Computer Science Press: Rockville, Maryland, 1982.

806. Peano, G., Sur une courbe que remplit toute une aire plane. Mathematische Annalen, 36. George Allen & Unwin: London, United Kingdom, 1890, 1973:157–160. [English translation by H.C. Kennedy. Selected Works of Giuseppe Peano, 143–148.].

807. Pedoe, D. Notes on the history of geometrical ideas: Homogeneous coordinates. Mathematics Magazine. 1975;48:215–217.

808. Peleg, S., Rosenfeld, A. A min-max medial axis transformation. IEEE Trans. Pattern Analysis Machine Intelligence. 1981;3:208–210.

809. Perroton, L. A new 26-connected objects surface tracking algorithm and its related PRAM version. Int. J. Pattern Recognition Artificial Intelligence. 1995;9:719–734.

810. Pfaltz, J.L., Rosenfeld, A. Computer representation of planar regions by their skeletons. Comm. ACM. 1967;10:119–122. 125

811. Pham, S. Digital straight segments. Computer Vision, Graphics, Image Processing. 1986;36:10–30.

812. Pham, S. Parallel, overlapped, and intersected digital straight lines. The Visual Computer. 1988;4:247–258.

813. Pham, S. Digital circles with non-lattice point centers. The Visual Computer. 1992;9:1–24.

814. Philbrick, O. A study of shape recognition using the medial axis transform. Cambridge, Massachusetts: Air Force Cambridge Research Laboratory; 1966.

815. Phillips, T.Y., Rosenfeld, A. A method for curve partitioning using arc-chord distance. Pattern Recognition Letters. 1987;5:285–288.

816. Pick, G. Geometrisches zur Zahlenlehre. Sitzungsberichte des deutschen naturw.-med. Vereins für Böhmen “Lotos” in Prag. 1899;47:315–323.

817. Piper, J. Efficient implementation of skeletonisation using interval coding. Pattern Recognition Letters. 1985;3:389–397.

818. Piper, J., Granum, E. Computing distance transformations in convex and non-convex domains. Pattern Recognition. 1987;20:599–615.

819. Pitas, I., Performance analysis of morphological Voronoi tessellation algorithms. Klette, R., Rosenfeld, A., Sloboda, F., eds. Advances in Digital and Computational Geometry. Springer: Singapore, 1998:227–254.

820. Poincaré, H., Analysis situs. J. Ecole Polytechnique, 1. Gauthier-Villars: Paris, 1895,1953:1–121. Also in: Œuvres, 6: 193–288

821. Poston, T., Wong, T.-T., Heng, P.-A. Multiresolution isosurface extraction with adaptive skeleton climbing. Computer Graphics Forum. 1998;17:137–148.

822. Poty, V., Ubeda, S. A parallel thinning algorithm using K × K masks. Int. J. Pattern Recognition Artificial Intelligence. 1993;7:1183–1202.

823. Preparata, F.P., Shamos, M.I. 3rd. Computational Geometry: An Introduction. Springer: New York, 1985, 1990.

824. Preteux, F. Watershed and skeleton by influence zones: A distance-based approach. J. Mathematical Imaging Vision. 1992;1:239–255.

825. Prewitt, J.M.S., Object enhancement and extraction. Lipkin, B.S., Rosenfeld, A., eds. Picture Processing and Psychopictorics. Academic Press: New York, 1970:14–75.

826. Proffitt, D., Rosen, D. Metrication errors and coding efficiency of chain-encoding schemes for the representation of lines and edges. Computer Graphics Image Processing. 1979;10:318–332.

827. Pudney, C. Distance-ordered homotopic thinning: A skeletonization algorithm for 3D digital images. Computer Vision Image Understanding. 1998;72:404–413.

828. Qi, X., Li, X. A 3D surface tracking algorithm. Computer Vision Image Understanding. 1996;64:147–156.

829. Qian, K., Cao, S., Bhattacharya, P. Gray image skeletonization with hollow preprocessing using distance transformation. Int. J. Pattern Recognition Artificial Intelligence. 1999;13:881–892.

830. Rademacher, H., Toeplitz, O. 2nd. Proben Mathematischen Denkens für Liebhaber der Mathematik. Julius Springer, Princeton University Press: Berlin, Germany, Princeton, New Jersey, 1957. English translation by H. Zuckerman. The Enjoyment of Mathematics. 1933

831. Ragnemalm, I. Generation of Euclidean distance maps. Sweden: Linköping University; 1990. PhD Thesis

832. Ragnemalm, I., Contour processing distance transforms. Cantoni, V., Cordella, L., Levialdi, S., Sanniti di Baja, G., eds. Progress in Image Analysis and Processing. World Scientific: Singapore, 1990:204–212.

833. Ragnemalm, I. Neighborhoods for distance transformations using ordered propagation. CVGIP: Image Understanding. 1992;56:399–409.

834. Ragnemalm, I. The Euclidean distance transformation in arbitrary dimensions. Pattern Recognition Letters. 1993;14:883–888.

835. Randell, B. 3rd. The Origins of Digital Computers—Selected Papers. Springer: Berlin, Germany, 1982:5–6.

836. Ranwez, V., Soille, P. Order independent homotopic thinning for binary and grey tone anchored skeletons. Pattern Recognition Letters. 2002;23:687–702.

837. Ray, B.K., Ray, K.S. An algorithm for detecting dominant points and polygonal approximation of digitized curves. Pattern Recognition Letters. 1992;13:849–856.

838. Reche, P., Urdiales, C., Bandera, A., Trazegnies, C., Sandoval, F. Corner detection by means of contour local vectors. Electronics Letters. 2002;38:699–701.

839. Redelmeier, D.H. Counting polyominoes: Yet another attack. Discrete Mathematics. 1981;36:191–203.

840. Reed, G.M. On the characterization of simple closed surfaces in three-dimensional digital images. Computer Vision, Graphics, Image Processing. 1984;25:226–235.

841. Reed, G.M., Rosenfeld, A. Recognition of surfaces in three-dimensional images. Information Control. 1982;53:108–120.

842. Reeve, J.E. On the volume of lattice polyhedra. Proc. London Mathematical Society. 1957;7:378–395.

843. Reggiori, G.B. Digital computer transformations for irregular line drawings. New York: New York University; 1972. Technical Report 403–22

844. Reidemeister, K. 2nd. Topologie der Polyeder und kombinatorische Topologie der Komplexe. Akad. Verlagsgesellschaft Geest & Portig: Leipzig, Germany, 1938, 1953.

845. Remy, E., Thiel, E., Computing 3D medial axis for chamfer distances. Borgefors, G., Nyström, I., Sanniti di Baja, G., eds. Discrete Geometry for Computer Imagery. Springer: Berlin, Germany, 2000:418–430. Lecture Notes in Computer Science 1953

846. Remy, E., Thiel, E. Medial axis for chamfer distances: Computing look-up tables and neighbourhoods in 2D or 3D. Pattern Recognition Letters. 2002;23:649–661.

847. Rényi, A., Sulanke, R. Über die konvexe Hülle von n zufällig gewählten Punkten, Parts I and II. Zeitschrift für Wahrscheinlichkeitstheorie. 1963;2:75–84. 3:138–147, 1964

848. Reveillès, J.-P. Géométrie discrète, calcul en nombres entiers et algorithmique. Strasbourg, Germany: Thèse d’état, Université Louis Pasteur; 1991.

849. Reveillès, J.-P. Combinatorial pieces in digital lines and planes. SPIE Vision Geometry IV. 1995;2573:23–34.

850. Rhodes, F. Some characterizations of the chessboard metric and the city block metric. Pattern Recognition Letters. 1990;11:669–675.

851. Rhodes, F. Discrete Euclidean metrics. Pattern Recognition Letters. 1992;13:623–628.

852. Rhodes, F. On the metrics of Chaudhuri, Murthy and Chaudhuri. Pattern Recognition. 1995;28:745–752.

853. Riazanoff, S., Cervelle, B., Chorowicz, J. Parametrisable skeletonization of binary and multi-level images. Pattern Recognition Letters. 1990;11:25–33.

854. Richter, M., Some concepts of convexity in gridpoint spaces. Nagel, W., eds. Proc. Geometric Problems of Image Processing. Jena University: Germany, 1985:87–91.

855. Riesz, F., Sz.-Nagy, B. 3rd. Leçons d’Analyse Fonctionelle. Gauthier-Villars, Akadémiai Kiado: Paris, France, Budapest, Hungary, 1955.

856. Ringel, G., Youngs, J.W.T. Solution of the Heawood map-coloring problem. Proc. Nat. Acad Sci. U.S.A. 1968;60:438–445.

857. Rinow, W. Lehrbuch der Topologie. Deutscher Verlag der Wissenschaften: Berlin, Germany, 1975.

858. Ripley, B.D. Spatial Statistics. Wiley: New York, 1981.

859. Rital, S., Bretto, A., Aboutajdine, D., Cherifi, H., Application of adaptive hypergraph model to impulsive noise detection. Proc. Computer Analysis of Images and Patterns. Springer: Berlin, Germany, 2001:555–562. Lecture Notes in Computer Science 2124

860. Ritter, G.X., Wilson, J.N. 2nd. Handbook of Computer Vision Algorithms in Image Algebra. CRC Press: Boca Raton, Florida, 2001.

861. Roberts, J.C. An overview of rendering from volume data including surface and volume rendering. United Kingdom: University of Kent at Canterbury; 1993.

862. Robertson, N., Sanders, D.P., Seymour, P.D., Thomas, R. A new proof of the four colour theorem. Electronic Research Announcements American Mathematical Society. 1996;2:17–25.

863. Robinson, J.J. Line symmetry of convex digital regions. Computer Vision Image Understanding. 1996;64:263–285.

864. Ronse, C. A simple proof of Rosenfeld’s characterization of digital straight line segments. Pattern Recognition Letters. 1985;3:323–326.

865. Ronse, C. Definitions of convexity and convex hulls in digital images. Bulletin de la Société Mathématique de Belgique. 1985;37:71–85.

866. Ronse, C. Criteria for approximation of linear and affine functions. Archiv der Mathematik. 1986;46:371–384.

867. Ronse, C. A strong chord property for 4-connected convex digital sets. Computer Vision, Graphics, Image Processing. 1986;35:259–269.

868. Ronse, C. A topological characterization of thinning. Theoretical Computer Science. 1986;43:31–41.

869. Ronse, C. Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images. Discrete Applied Mathematics. 1988;21:67–79.

870. Ronse, C. A bibliography on digital and computational convexity (1961–1988). IEEE Trans. Pattern Analysis Machine Intelligence. 1989;11:181–190.

871. Ronse, C. A note on the approximation of linear and affine functions: The case of bounded slope. Archiv der Mathematik. 1990;54:601–609.

872. Ronse, C. Set-theoretical algebraic approaches to connectivity in continuous or digital spaces. J. Mathematical Imaging Vision. 1998;8:41–58.

873. Ronse, C., Devijver, P.A. Connected Components in Binary Images: The Detection Problem. Wiley: New York, 1984.

874. Ronse, C., Heijmans, H.J.A.M. The algebraic basis of mathematical morphology II: Openings and closings. CVGIP: Image Understanding. 1991;54:74–97.

875. Ronse, C., Tajine, M. Discretization in Hausdorff space. J. Mathematical Imaging Vision. 2000;12:219–242.

876. Ronse, C., Tajine, M. Hausdorff discretization for cellular distances, and its relation to cover and supercover discretizations. J. Visual Communication Image Representation. 2001;12:169–200.

877. Rosen, D. On the area and boundaries of quantized objects. Computer Graphics Image Processing. 1980;13:94–98.

878. Rosen, D. Errors in digitized area measurements: Circles and rectangles. Pattern Recognition Letters. 1992;13:613–621.

879. Rosenberg, B. Computing dominant points on simple shapes. Int. J. Man-Machine Studies. 1974;6:1–12.

880. Rosenfeld, A. Picture Processing by Computer. Academic Press: New York, 1969.

881. Rosenfeld, A. Connectivity in digital pictures. J. ACM. 1970;17:146–160.

882. Rosenfeld, A. Arcs and curves in digital pictures. J. ACM. 1973;20:81–87.

883. Rosenfeld, A. Digital straight line segments. IEEE Trans. Computers. 1974;23:1264–1269.

884. Rosenfeld, A. Compact figures in digital pictures. IEEE Trans. Man, Cybernetics. 1974;4:221–223.

885. Rosenfeld, A. A note on perimeter and diameter in digital pictures. Information Control. 1974;24:384–388.

886. Rosenfeld, A. Adjacency in digital pictures. Information Control. 1974;26:24–33.

887. Rosenfeld, A. A characterization of parallel thinning algorithms. Information Control. 1975;29:286–291.

888. Rosenfeld, A. A converse to the Jordan curve theorem for digital curves. Information Control. 1975;29:292–293.

889. Rosenfeld, A. Geodesics in digital pictures. Information Control. 1978;36:74–84.

890. Rosenfeld, A. Clusters in digital pictures. Information Control. 1978;39:19–33.

891. Rosenfeld, A. Picture Languages. Academic Press: New York, 1979. Chapter 2 on digital geometry

892. Rosenfeld, A. Fuzzy digital topology. Information Control. 1979;40:76–87.

893. Rosenfeld, A. Digital topology. American Mathematical Monthly. 1979;86:621–630.

894. Rosenfeld, A. Three-dimensional digital topology. Information Control. 1981;50:119–127.

895. Rosenfeld, A. On connectivity properties of grayscale pictures. Pattern Recognition. 1983;16:47–50.

896. Rosenfeld, A. Some notes on digital triangles. Pattern Recognition Letters. 1983;1:147–150.

897. Rosenfeld, A. A note on “geometric transforms” of digital sets. Pattern Recognition Letters. 1983;1:223–225.

898. Rosenfeld, A. Parallel image processing using cellular arrays. IEEE Computer. 1983;16(1):62–67.

899. Rosenfeld, A. Multiresolution Image Processing and Analysis. Springer: Berlin, Germany, 1984.

900. Rosenfeld, A. The fuzzy geometry of image subsets. Pattern Recognition Letters. 1984;4:311–317.

901. Rosenfeld, A. Distances between fuzzy sets. Pattern Recognition Letters. 1985;3:229–233.

902. Rosenfeld, A. Measuring the sizes of concavities. Pattern Recognition Letters. 1985;3:71–75.

903. Rosenfeld, A. “Continuous” functions on digital pictures. Pattern Recognition Letters. 1986;4:177–184.

904. Rosenfeld, A. A note on average distances in digital sets. Pattern Recognition Letters. 1987;5:281–283.

905. Rosenfeld, A. Fuzzy rectangles. Pattern Recognition Letters. 1990;11:677–679.

906. Rosenfeld, A. Fuzzy plane geometry: Triangles. Pattern Recognition Letters. 1994;15:1261–1264.

907. Rosenfeld, A., Digital geometry—Introduction and bibliography. Klette, R., Rosenfeld, A., Sloboda, F., eds. Advances in Digital and Computational Geometry. Springer: Singapore, 1998:1–85.

908. Rosenfeld, A., Davis, L.S. A note on thinning. IEEE Trans. Man, Cybernetics. 1976;6:226–228.

909. Rosenfeld, A., Haber, S. The perimeter of a fuzzy set. Pattern Recognition. 1985;18:125–130.

910. Rosenfeld, A., Johnston, E. Angle detection on digital curves. IEEE Trans. Computers. 1973;22:875–878.

911. Rosenfeld, A., Kak, A.C. 2nd. Digital Picture Processing, two. Academic Press: New York, 1976, 1982.

912. Rosenfeld, A., Kim, C.E. How a digital computer can tell whether a line is straight. American Mathematical Monthly. 1982;89:230–235.

913. Rosenfeld, A., Klette, R. Degree of adjacency or surroundedness. Pattern Recognition. 1985;18:169–177.

914. Rosenfeld, A., Klette, R., Digital straightness. Electronic Notes in Theoretical Computer Science, 46. Elsevier, 2001.

915. Rosenfeld, A., Kong, T.Y. Connectedness of a set, its complement, and their common boundary. Contemporary Mathematics. 1991;119:125–128.

916. Rosenfeld, A., Kong, T.Y., Nakamura, A. Topology-preserving deformations of two-valued digital pictures. Graphical Models Image Processing. 1998;60:24–34.

917. Rosenfeld, A., Kong, T.Y., Wu, A.Y. Digital surfaces. CVGIP: Graphical Models Image Processing. 1991;53:305–312.

918. Rosenfeld, A., Melter, R.A. Digital geometry. College Park, Maryland: University of Maryland; 1987. Center for Automation Research, TR-323

919. Rosenfeld, A., Nakamura, A. Local deformations of digital curves. Pattern Recognition Letters. 1997;18:613–620.

920. Rosenfeld, A., Nakamura, A. Two simply connected sets that have the same area are IP-equivalent. Pattern Recognition. 2002;35:537–541.

921. Rosenfeld, A., Pfaltz, J.L. Sequential operations in digital picture processing. J. ACM. 1966;13:471–494.

922. Rosenfeld, A., Pfaltz, J.L. Distance functions on digital pictures. Pattern Recognition. 1968;1:33–61.

923. Rosenfeld, A., Saha, P.K., Nakamura, A. Interchangeable pairs of pixels in two-valued digital images. Pattern Recognition. 2001;34:1833–1865.

924. Rosenfeld, A., Weszka, J.S. An improved method of angle detection on digital curves. IEEE Trans. Computers. 1975;24:940–941.

925. Rosenfeld, A., Wu, A.Y. “Digital geometry” on graphs. Contemporary Mathematics. 1991;119:129–136.

926. Rosenfeld, A., Wu, A.Y. Geodesic convexity in discrete spaces. Information Sciences. 1994;80:127–132.

927. Rosenfeld, B.A., Jaglom, I.M., Mehrdimensionale Räume. Alexandroff, P.S., Markuschewitsch, A.I., Chintschin, A.J., eds. Enzyklopädie der Elementarmathematik, Vol. 5. Deutscher Verlag der Wissenschaften: Berlin, Germany, 1971:369–371.

928. Rosin, P.L. Techniques for assessing polygonal approximations of curves. IEEE Trans. Pattern Analysis Machine Intelligence. 1997;19:659–666.

929. Rosin, P.L., West, G.A.W. Salience distance transforms. Graphical Models Image Processing. 1995;57:483–521.

930. Rösler, U., Schwarze, G. Maskenverfahren zur Manipulation von binären Rasterbildern linienförmiger Objekte. Elektronische Informationsverarbeitung Kybernetik. 1980;16:171–184.

931. Rothstein, J., Weiman, C. Parallel and sequential specification of a context sensitive language for straight line grids. Computer Graphics Image Processing. 1976;5:106–124.

932. Rutkowski, W.S., Rosenfeld, A. A comparison of corner-detection techniques for chain-coded curves. College Park, Maryland: University of Maryland; 1978. Computer Science Dep., TR-623

933. Rutovitz, D., Data structures for operations on digital images. Cheng, G.C., Ledley, R.S., Pollock, D.K., Rosenfeld, A., eds. Pictorial Pattern Recognition. Thompson: Washington, DC, 1968:105–133.

934. Ryser, H.J. Combinatorial properties of matrices of zeros and ones. Canadian J. Mathematics. 1957;9:371–377.

935. Sagan, H. Space-Filling Curves. Springer: Berlin, Germany, 1994.

936. Saha, P.K., Chanda, B., Dutta Majumder, D. A single scan boundary removal thinning algorithm for 2-D binary object[s]. Pattern Recognition Letters. 1993;14:173–179.

937. Saha, P.K., Chaudhuri, B.B. Detection of 3-D simple points for topology preserving transformations with application to thinning. IEEE Trans. Man, Cybernetics. 1994;16:1028–1032.

938. Saha, P.K., Chaudhuri, B.B. A new approach to computing the Euler characteristic. Pattern Recognition. 1995;28:1955–1963.

939. Saha, P.K., Chaudhuri, B.B. 3D digital topology under binary transformation with applications. Computer Vision Image Understanding. 1996;63:418–429.

940. Saha, P.K., Chaudhuri, B.B., Chanda, B., Dutta Majumder, D. Topology preservation in 3D digital space. Pattern Recognition. 1994;27:295–300.

941. Saha, P.K., Chaudhuri, B.B., Dutta Majumder, D. A new shape preserving parallel thinning algorithm for 3D digital images. Pattern Recognition. 1997;30:1939–1955.

942. Saha, P.K., Rosenfeld, A. The digital topology of sets of convex voxels. Graphical Models. 2000;62:343–352.

943. Saha, P.K., Rosenfeld, A. Determining simplicity and computing topological change in strongly normal partial tilings of image2 or image3. Pattern Recognition. 2000;33:105–118.

944. Saha, P.K., Rosenfeld, A. Local and global topology preservation in locally finite sets of tiles. Information Sciences. 2001;137:303–311.

945. Saha, P.K., Wehrli, F.W., Gomberg, B.R. Fuzzy distance transform: Theory, algorithms, and applications. Computer Vision Image Understanding. 2002;86:171–190.

946. Saito, T., Toriwaki, J. New algorithms for Euclidean distance transformation of an n-dimensional digitized picture with applications. Pattern Recognition. 1994;27:1551–1565.

947. Saito, T., Toriwaki, J. A sequential thinning algorithm for three dimensional digital pictures using the Euclidean distance transformation. Proc. Scandinavian Conf. Image Analysis. 1995:507–516.

948. Salari, E., Siy, P. The ridge-seeking method for obtaining the skeleton[s] of digital images. IEEE Trans. Man, Cybernetics. 1984;14:524–528.

949. Samet, H. Applications of Spatial Data Structures. Addison-Wesley: Massachusetts, 1993. Reading

950. Sanchez-Marin, F.J. The curvature function evolved in scale space as a representation of biological shapes. Computers Biology Medicine. 1997;27:77–85.

951. Sankar, P.V. Grid intersect quantization schemes for solid object digitization. Computer Graphics Image Processing. 1978;8:25–42.

952. Sankar, P.V., Krishnamurthy, E.V. On the compactness of subsets of digital pictures. Computer Graphics Image Processing. 1978;8:136–143.

953. Sanniti di Baja, G. Well-shaped, stable, and reversible skeletons from the (3,4)-distance transform. J. Visual Communication Image Representation. 1994;5:107–115.

954. Sanniti di Baja, G., Svensson, S. A new shape descriptor for surfaces in 3D images. Pattern Recognition Letters. 2002;23:703–711.

955. Sanniti di Baja, G., Thiel, E. (3,4)-weighted skeleton decomposition for pattern representation and description. Pattern Recognition. 1994;27:1039–1049.

956. Sanniti di Baja, G., Thiel, E. Skeletonization algorithm running on path-based distance maps. Image Vision Computing. 1996;14:47–57.

957. Santaló, L.A. Complemento a la nota: Un teorema sôbre conjuntos de paralelipipedos de aristas paralelas. Publ. Inst. Mat. Univ. Nac. Litoral. 1940;2:49–60.

958. Santaló, L.A. Integral Geometry and Geometric Probability. Addison-Wesley: Massachusetts, 1976. Reading

959. Schaeffer, G. Conjugaison d’arbres et cartes combinatoires aleatoires. L’Université Bordeaux − 1: France, 1998. PhD Thesis

960. Scherrer, W. Ein Satz über Gitter und Volumen. Mathematische Annalen. 1922;86:99–107.

961. Scherrer, W. Die Einlagerung eines regulären Vielecks in ein Gitter. Elemente der Mathematik. 1946;1:97–98.

962. Schläfli, L. Theorie der Vielfachen Kontinuität. Neue Denkschriften der allgemeinen schweizerischen Gesellschaft für die gesamten Naturwissenschaften. 1901;38:1–237.

963. Schmidt, W.M. Volume, surface area, and the number of integer points covered by a convex set. Archiv der Mathematik. 1972;23:537–543.

964. Schneider, R., Weil, W. Integralgeometrie. Teubner: Stuttgart, Germany, 1992:226.

965. Schnell, U. Lattice inequalities for convex bodies and arbitrary lattices. Monatshefte der Mathematik. 1993;116:331–337.

966. Schönflies, A. Kristallsysteme und Kristallstruktur. Leipzig, Germany: Teubner, 1891.

967. Schroeder, W.J., Zarge, J.A., Lorensen, W.E. Decimation of triangle meshes. Computer Graphics. 1992;26:65–70.

968. Schwarz, H.A. Sur une définition erronée de l’aire d’une surface courbe. Gesammelte mathematische Abhandlungen. 1890;2:309–311.

969. Serra, J. Image Analysis and Mathematical Morphology. London, United Kingdom: Academic Press, 1982.

970. Serra, J., Mathematical morphology for Boolean lattices. Serra, J., eds. Image Analysis and Mathematical Morphology, II: Theoretical Advances. Academic Press: London, United Kingdom, 1988:37–58.

971. Shafer, S.A. Shadows and Silhouettes in Computer Vision. Boston, Massachusetts: Kluwer, 1985.

972. Shaked, D., Bruckstein, A.M. Pruning medial axes. Computer Vision Image Understanding. 1998;69:156–169.

973. Shaked, D., Koplowitz, J., Bruckstein, A.M. Star-shapedness of digitized planar shapes. Contemporary Mathematics. 1991;119:137–158.

974. Shamos, M.I. Computational geometry. New Haven, Connecticut: Yale University, 1978. PhD Thesis

975. Shapiro, B., Pisa, J., Sklansky, J. Skeleton generation from x,y boundary sequences. Computer Graphics Image Processing. 1981;15:136–153.

976. Shapiro, L.G., Connected component labeling and adjacency graph construction. Kong, T.Y., Rosenfeld, A., eds. Topological Algorithms for Digital Image Processing. Elsevier: Amsterdam, The Netherlands, 1996:1–30.

977. Sharaiha, Y.M., Christofides, N. A graph-theoretic approach to distance transformations. Pattern Recognition Letters. 1994;15:1035–1041.

978. Sharaiha, Y.M., Garat, P. A compact chord property for digital arcs. Pattern Recognition. 1993;26:799–803.

979. Sharaiha, Y.M., Garat, P. Digital straightness and the skeleton property. Pattern Recognition Letters. 1995;16:417–423.

980. Shen, J., Shen, W., Shen, D. On geometric and orthogonal moments. Int. J. Pattern Recognition Artificial Intelligence. 2000;14:875–894.

981. Shi, H. Image algebra techniques for binary image component labeling with local operators. J. Mathematical Imaging Vision. 1995;5:159–170.

982. Shih, F.Y., Liu, J.J. Size-invariant four-scan Euclidean distance transformation. Pattern Recognition. 1998;31:1761–1766.

983. Shih, F.Y.C., Mitchell, O.R. A mathematical morphology approach to Euclidean distance transformation. IEEE Trans. Image Processing. 1992;1:197–204.

984. Shih, F.Y., Pu, C.C. A skeletonization algorithm by maxima tracking on [the] Euclidean distance transform. Pattern Recognition. 1995;28:331–341.

985. Shih, F.Y., Wong, W.T. Fully parallel thinning with tolerance to boundary noise. Pattern Recognition. 1994;27:1677–1695.

986. Shih, F.Y., Wong, W.T. A new safe-point thinning algorithm based on (the) mid-crack code tracing. IEEE Trans. Man, Cybernetics. 1995;25:370–378.

987. Shih, F.Y., Wu, H. Optimization on Euclidean distance transformation using grayscale morphology. J. Visual Communication Image Representation. 1992;3:104–114.

988. Shlien, S. Segmentation of digital curves using linguistic techniques. Computer Vision, Graphics, Image Processing. 1983;22:277–286.

989. Shonkwiler, R. Computing the Hausdorff set distance in linear time for any Lp point distance. Information Processing Letters. 1991;38:201–207.

990. Shoucri, R., Benesch, R., Thomas, S. Note on the determination of a digital straight line from chain codes. Computer Vision, Graphics, Image Processing. 1985;29:133–139.

991. Sierpinski, W. Elementary Theory of Numbers. Warszawa, Poland: Paimagestwowe Wydawnictwo Naukowe, 1964.

992. Simon, H., Kunze, K., Voss, K., Herrmann, W.R. Automatische Bildverarbeitung in Medizin und Biologie. Dresden, Germany: Steinkopff, 1975.

993. Sinai, Y.G. Probabilistic approach to analyze the statistics of convex polygonal curves (in Russian). Funksional Anal. Appl. 1994;28:41–48.

994. Sinha, R.M.K. Comments on “Fast thinning algorithm for binary images.”. Image Vision Computing. 1986;4:57–58.

995. Sirjani, A., Cross, G.R. On representation of a shape’s skeleton. Pattern Recognition Letters. 1991;12:149–154.

996. Skarbek, W., Generalized Hilbert scan in image printing. Klette, R., Kropatsch, W.G., eds. Theoretical Foundations of Computer Vision. Akademie Verlag: Berlin, Germany, 1992:47–58.

997. Skiena, S. Implementing Discrete Mathematics. Redwood City, California: Addison-Wesley, 1990.

998. Sklansky, J. Recognition of convex blobs. Pattern Recognition. 1970;2:3–10.

999. Sklansky, J. Measuring concavity on a rectangular mosaic. IEEE Trans. Computers. 1972;21:1355–1364.

1000. Sklansky, J., Chazin, R.L., Hansen, B.J. Minimum-perimeter polygons of digitized silhouettes. IEEE Trans. Computers. 1972;21:260–268.

1001. Sklansky, J., Kibler, D.F. A theory of nonuniformly digitized binary pictures. IEEE Trans. Man, Cybernetics. 1976;6:637–647.

1002. Sloboda, F., Zaťko, B. On one-dimensional grid continua in image2. In Technical report, Institute of Control Theory and Robotics. Bratislava, Slovakia: Slovak Academy of Sciences; 1996.

1003. Sloboda, F., Zaťko, D. On polyhedral form for surface representation. In Technical report, Institute of Control Theory and Robotics. Bratislava, Slovakia: Slovak Academy of Sciences; 2000.

1004. Sloboda, F., Zaťko, B. On approximation and representation of surfaces in implicit form. Bratislava, Slovakia: Slovak Academy of Sciences, 2002. Unpublished manuscript

1005. Sloboda, F., Zaťko, B., Klette, R. On the topology of grid continua. SPIE. Vision Geometry VII. 1998;3454:52–63.

1006. Sloboda, F., Zaťko, B., Stoer, J., On approximation of planar one-dimensional continua. Klette, R., Rosenfeld, A., Sloboda, F., eds. Advances in Digital and Computational Geometry. 1998: 113–160. Springer, Singapore

1007. Smeulders, A.W.M., Dorst, L. Decomposition of discrete curves into piecewise segments in linear time. Contemporary Mathematics. 1991;119:169–195.

1008. Smith, J.T. Methods of Geometry. New York: Wiley, 2000.

1009. Smyth, M.B. Region-based discrete geometry. J. Universal Computer Science. 2000;6:447–459.

1010. Soille, P. Spatial distribution from contour lines: An efficient methodology based on distance transformations. J. Visual Communication Image Representation. 1991;2:138–150.

1011. Soille, P. Generalized geodesy via geodesic time. Pattern Recognition Letters. 1994;15:1235–1240.

1012. Soille, P. 2nd. Morphological Image Analysis: Principles and Applications. 2003. Springer, Heidelberg, Germany

1013. Sossa, J.H. An improved parallel algorithm for thinning digital patterns. Pattern Recognition Letters. 1989;10:77–80.

1014. Spivak, M. A Comprehensive Introduction to Differential Geometry. Boston, Massachusetts: Publish or Perish, 1975. three volumes

1015. Staunton, R.C. An analysis of hexagonal thinning algorithms and skeletal shape representation. Pattern Recognition. 1996;29:1131–1146.

1016. Steen, L.A., Seebach, J.A. 2nd. Counterexamples in Topology. 1978. Reprint: Dover, New York, 1995, Springer, New York

1017. Stefanelli, R. A comment on an investigation into the skeletonization approach of Hilditch. Pattern Recognition. 1986;19:13–14.

1018. Stefanelli, R., Rosenfeld, A. Some parallel thinning algorithms for digital pictures. J. ACM. 1971;18:255–264.

1019. Steiner, J. Einfache Beweise der isoperimetrischen Hauptsätze. J. Reine Angewandte Mathematik. 1838;18:289–296.

1020. Steiner, J. Über parallele Flächen. Monatsbericht preussischen Akademie Wissenschaften. 1840:114–118. Also in: Gesammelte Werke Vol. 2, 173-176, 1882

1021. Steiner, J. Sur le maximum et le minimum des figures dans le plan, sur la sphére et dans l’espace en géneral. J. Reine Angewandte Mathematik. 1842;24:93–152.

1022. Steinhaus, H. Praxis der Rektifikation und zum Längenbegriff. Berichte Sächsischen Akad. Wiss. Leipzig. 1930;82:120–130.

1023. Steinhaus, H. Sur un théoréme de M.V. Jarník. Colloq. Math. 1947;1:1–5.

1024. Steinhaus, H. Mathematical Snapshots. New York: Oxford University Press, 1960.

1025. Steinitz, E. Beiträge zur Analysis. Sitzungsberichte der Berliner Mathematischen Gesellschaft. 1908;7:29–49.

1026. Steinitz, E. Vorlesungen über die Theorie der Polyeder, 1934. Julius Springer, Berlin, Germany

1027. Stewart, A. A one-pass thinning algorithm with interference guards. Pattern Recognition Letters. 1994;15:825–832.

1028. Stojmenovic, I., Tosic, R. Digitization schemes and the recognition of digital straight lines, hyperplanes, and flats in arbitrary dimensions. Contemporary Mathematics. 1991;119:197–212.

1029. Stout, L.N. Two discrete forms of the Jordan Curve Theorem. American Mathematical Monthly. 1988;95:332–336.

1030. Straszewicz, S. Über eine Verallgemeinerung des Jordanschen Kurvensatzes. Fundamenta Mathematica. 1923;4:128–135.

1031. Struik, D.J. A Source Book in Mathematics, 1200 – 1800. Harvard University Press: Cambridge, Massachusetts, 1969:209–219.

1032. Suenaga, Y., Kamae, T., Kobayashi, T. A high-speed algorithm for the generation of straight lines and circular arcs. IEEE Trans. Computers. 1979;28:729–736.

1033. Sutherland, I.E. Sketchpad: A man-machine graphical communication system. Proc. AFIP Spring Joint Computer Conf. 1963:329–346.

1034. Suzuki, S., Abe, K. Topological structural analysis of digitized binary images by border following. Computer Vision, Graphics, Image Processing. 1985;30:32–46.

1035. Suzuki, S., Abe, K. Binary picture thinning by an iterative parallel two-subcycle operation. Pattern Recognition. 1987;20:297–307.

1036. Suzuki, S., Veda, N., Sklansky, J. Graph-based thinning for binary images. Int. J. Pattern Recognition Artificial Intelligence. 1993;7:1009–1030.

1037. Svensson, S., Borgefors, G. Digital distance transforms in 3D images using information from neighborhoods up to 5 × 5 × 5. Computer Vision Image Understanding. 2002;88:24–53.

1038. Svensson, S., Borgefors, G., Nyström, I. On reversible skeletonization using anchor-points from distance transforms. J. Visual Communication Image Representation. 1999;10:379–397.

1039. Svensson, S., Nyström, I., Sanniti di Baja, G. Curve skeletonization of surface-like objects in 3D images guided by voxel classification. Pattern Recognition Letters. 2002;23:1419–1426.

1040. Svensson, S., Sanniti di Baja, G. Using distance transforms to decompose 3D discrete objects. Image Vision Computing. 2002;20:529–540.

1041. Tait, P.G. Johann Benedict Listing. Nature. 1883;27:316–317.

1042. M. Tajine and A. Daurat. On local definitions of length of digital curves. In: G. Sanniti di Baja, S. Svensson, and I. Nyström, editors. Discrete Geometry for Computer Imagery, 114-123, Lecture Notes in Computer Science 2886, Springer, Berlin, Germany.

1043. Tajine, M., Ronse, C. Topological properties of Hausdorff discretization, and comparison to other discretization schemes. Theoretical Computer Science. 2002;283:243–268.

1044. Tajine, M., Wagner, D., Ronse, C., Hausdorff discretization and its comparison to other discretization schemes. Bertrand, G., Couprie, M., Perroton, L., eds. Discrete Geometry for Computer Imagery. 1999: 399–410. Lecture Notes in Computer Science 1568, Springer, Berlin, Germany

1045. Tanimoto, S., Pavlidis, T. A hierarchical data structure for picture processing. Computer Graphics Image Processing. 1975;4:104–119.

1046. Tari, S.G., Shah, J., Pien, H. Extraction of shape skeletons from grayscale images. Computer Vision Image Understanding. 1997;66:133–146.

1047. Tee, G.J. Up with determinants!. IMAGE. 2003;30:5–9.

1048. Tellier, P., Debled-Rennesson, I., Bertrand, G., Couprie, M., Perroton, L., 3D discrete normal vectors. Bertrand, G., Couprie, M., Perroton, L., eds. Discrete Geometry for Computer Imagery. 1999: 447–458. Lecture Notes in Computer Science 1568, Springer, Berlin, Germany

1049. Thanisch, P., McNally, B.V., Robin, A. Linear time algorithm for finding a picture’s connected components. Image Vision Computing. 1984;2:191–197.

1050. Thiessen, A.H., Alter, J.C. Climatological data for July 1911 District No. 10, Great Basin. Monthly Weather Review. 1911:1082–1089.

1051. Thompson, S., Rosenfeld, A. Discrete nonlinear curvature-dependent contour evolution. Pattern Recognition. 1998;31:1949–1959.

1052. Thong, T. A symmetric linear algorithm for line segment generation. Computers & Graphics. 1982;6:15–17.

1053. Thurfjell, L., Bengtsson, E., Nordin, B. A new three-dimensional connected components labeling algorithm with simultaneous object feature extraction capability. CVGIP: Graphical Models Image Processing. 1992;54:357–364.

1054. Toivanen, P.J. New geodesic distance transforms for gray-scale images. Pattern Recognition Letters. 1996;17:437–450.

1055. Toriwaki, J., Kato, N., Fukumura, T. Parallel local operations for a new distance transformation of a line pattern and their applications. IEEE Trans. Man, Cybernetics. 1979;9:628–643.

1056. Toriwaki, J., Mori, K., Distance transformations and skeletonizations of 3D pictures and their applications to medical images. Bertrand, G., Imiya, A., Klette, R., eds. Digital and Image Geometry Advanced Lectures. 2001: 412–428. Lecture Notes in Computer Science 2243, Springer, Berlin, Germany

1057. Toriwaki, J.I., Tanaka, M., Fukumura, T. A generalized distance transformation of a line pattern with gray values and its applications. Computer Graphics Image Processing. 1982;20:319–346.

1058. Toriwaki, J., Yokoi, S., Yonekura, T., Fukumura, T. Topological properties and topology-preserving transformation of a three-dimensional binary picture. Proc. Int. Conf Pattern Recognition. 1982:414–419. IEEE

1059. Toriwaki, J., Yonekura, T. Local patterns and connectivity indexes in a three dimensional digital picture. Forma. 2002;17:275–291.

1060. Tourlakis, G. Homological methods for the classification of discrete Euclidean structures. SIAM J. Applied Mathematics. 1977;33:51–54.

1061. Tourlakis, G., Mylopoulos, J. Some results in computational topology. J. ACM. 1973;20:430–455.

1062. Toussaint, G.T., Pattern recognition and geometrical complexity. Proc. Int. Conf Pattern Recognition. IEEE, 1980:1324–1346.

1063. Toussaint, G.T., McAlear, J.A. A simple O(nlogn) algorithm for finding the maximum distance between two finite planar sets. Pattern Recognition Letters. 1982;1:21–24.

1064. Tripodi, A. Sviluppi della topologia secondo Johann Benedict Listing. Accad. Naz. Sci. Lett. Arti Modena Atti Mem. 1971;13:5–14.

1065. Tsai, D.M., Hou, H.T., Sou, H.J. Boundary-based corner detection using eigenvalues of covariance matrices. Pattern Recognition Letters. 1999;20:31–40.

1066. Tsao, Y.F., Fu, K.S. A parallel thinning algorithm for 3-D pictures. Computer Graphics Image Processing. 1981;17:315–331.

1067. Tsao, Y.F., Fu, K.S. A general scheme for constructing skeleton models. Information Sciences. 1982;27:53–87.

1068. Tsao, Y.F., Fu, K.S. Stochastic skeleton modeling of objects. Computer Vision, Graphics, Image Processing. 1984;25:348–370.

1069. Tucker, A.W. An abstract approach to manifolds. Annals Mathematics. 1933;34:191–243.

1070. Turner, J. A graph-theoretical model for periodic discrete structures. Proc. Ann Arbor Graph Theory Conf. 1969:155–160.

1071. Tutschke, W. VEB Deutscher Verlag der Wissenschaften, Berlin, Germany. Grundlagen der reellen Analysis. 1971.

1072. Tutte, W.T., “What is a map?”. New Directions in the Theory of Graphs. Academic Press: New York, 1973:309–325.

1073. Tutte, W.T. Addison-Wesley, Reading. Graph Theory. 1984.

1074. Ubeda, S. A parallel thinning algorithm using (the) bounding boxes techniques. Int. J. Pattern Recognition Artificial Intelligence. 1993;7:1103–1114.

1075. Udupa, J.K. Multidimensional digital boundaries. Graphical Models Image Processing. 1994;56:311–323.

1076. Udupa, J.K., Connected oriented, closed boundaries in digital spaces: Theory and algorithms. Kong, T.Y., Rosenfeld, A., eds. Topological Algorithms for Digital Image Processing. Elsevier: Amsterdam, The Netherlands, 1996:205–231.

1077. Udupa, J.K., Ajjanagadde, V.G. Boundary and object labelling in three-dimensional images. Computer Vision, Graphics, Image Processing. 1990;51:355–369.

1078. Udupa, J.K., Srihari, S.N., Herman, G.T. Boundary detection in multidimensions. IEEE Trans. Pattern Analysis Machine Intelligence. 1982;4:41–50.

1079. Underwood, E.E. Quantitative Stereology. Addison-Wesley, Reading: Massachusetts, 1970.

1080. Unger, S.H. A computer oriented toward spatial problems. Proc. IRE. 1958;46:1744–1750.

1081. Urysohn, P. Über die allgemeinen Cantorischen Kurven. Marbourg, Germany: Deutsche Mathematiker Vereinigung; 1923. Annual meeting

1082. Urysohn, P. Mémoire sur les multiplicités Cantoriennes. Fundamenta Mathematica. 1925;6:30–130.

1083. van der Waerden, B.L. Geometry and Algebra in Ancient Civilizations. Springer: Berlin, Germany, 1983.

1084. van Lierop, M.L.P., van Overveld, C.W.A.M., van de Wetering, H.M.M. Line rasterization algorithms that satisfy the subset line property. Computer Vision, Graphics, Image Processing. 1988;41:210–228.

1085. Veblen, O. Theory of plane curves in non-metrical analysis situs. Trans. American Mathematical Society. 1905;6:83–98.

1086. Veblen, O. Decomposition of an n-space by a polyhedron. Trans. American Mathematical Society. 1912;13:65–72.

1087. Veblen, O. The Cambridge Colloquium 1916 – Part II: Analysis Situs. American Mathematical Society: New York, 1922.

1088. Veelaert, P. On the flatness of digital hyperplanes. J. Mathematical Imaging Vision. 1993;3:205–221.

1089. Veelaert, P. Digital planarity of rectangular surface segments. IEEE Trans. Pattern Analysis Machine Intelligence. 1994;16:647–652.

1090. Veelaert, P. Geometric constructions in the digital plane. J. Mathematical Imaging Vision. 1999;11:99–118.

1091. Verbeek, P., van Vliet, L., van de Weijer, J., Improved curvature and anisotropy estimation for curved line bundles. Proc. Int. Conf Pattern Recognition. 1998: 528–533. IEEE

1092. Vershik, A.M. Limit shape of convex lattice polygons and related topics (in Russian). Funksional Anal. Appl. 1994;28:16–25.

1093. Verwer, B.J.H. Local distances for distance transformations in two and three dimensions. Pattern Recognition Letters. 1991;12:671–682.

1094. Verwer, B.J.H., Van Vliet, L.J., Verbeek, P.W. Binary and grey-value skeletons: Metrics and algorithms. Int. J. Pattern Recognition Artificial Intelligence. 1993;7:1287–1308.

1095. Verwer, B.J.H., Verbeek, P.W., Dekker, S.T. An efficient uniform cost algorithm applied to distance transforms. IEEE Trans. Pattern Analysis Machine Intelligence. 1989;11:425–429.

1096. Vialard, A., Geometrical parameter(s) extraction from discrete paths. Miguet, S., Montanvert, A., Ubéda, S., eds. Discrete Geometry for Computer Imagery. Springer, Berlin: Germany, 1996:24–35. Lecture Notes in Computer Science 1176

1097. Vincent, L. Exact Euclidean distance function by chain propagations. IEEE Conf. Computer Vision Pattern Recognition. 1991:520–525.

1098. Vincent, L., Soille, P. Watersheds in digital spaces: An efficient algorithm based on immersion simulations. IEEE Trans. Pattern Analysis Machine Intelligence. 1991;13:583–598.

1099. Vittone, J. Caractérisation et reconnaissance de droites et plans en géométrié discréte. PhD Thesis Université Joseph Fourier, Grenoble, France. 1999.

1100. Vittone, J., Chassery, J.M., Recognition of digital naive planes and polyhedrization. Borgefors, G., Nyström, I., Sanniti di Baja, G., eds. Discrete Geometry for Computer Imagery. Springer, Berlin: Germany, 2000:296–307. Lecture Notes in Computer Science 1953

1101. Voronoi, G.F. Nouvelles applications des paramètres continus à la théorie des formes quadratiques. J. Reine Angewandte Mathematik. 1908;133:97–178. 134:198-287, 1908, 136:67-181, 1909.

1102. Voss, K. Digitalisierungseffekte in der automatischen Bildverarbeitung. Elektronische Informationsverarbeitung Kybernetik. 1975;11:469–477.

1103. Voss, K. Theoretische Grundlagen der digitalen Bildverarbeitung, Part V: Planare Strukturen und homogene Netze. Bild und Ton. 1986;39:303–307.

1104. Voss, K. Theoretische Grundlagen der digitalen Bildverarbeitung. Akademie-Verlag, Berlin,: Germany, 1988.

1105. Voss, K. Coding of digital straight lines by continued fractions. Computers Artificial Intelligence. 1991;10:75–80.

1106. Voss, K. Images, objects, and surfaces in Zn. Intl. J. Pattern Recognition Artificial Intelligence. 1991;5:797–808.

1107. Voss, K. Discrete Images, Objects, and Functions in Zn. Springer, Berlin: Germany, 1993.

1108. Voss, K., Discrete integral geometry and stochastic images. Klette, R., Rosenfeld, A., Sloboda, F., eds. Advances in Digital and Computational Geometry. Springer: Singapore, 1998:87–111.

1109. Voss, K., Hufnagl, P., Klette, R. Theoretische Grundlagen der digitalen Bildverarbeitung, Part I: Einleitung. Bild und Ton. 1985;38:299–303.

1110. Voss, K., Klette, R. On the maximal number of edges of convex digital polygons included into a square. Computers Artificial Intelligence. 1982;1:549–558.

1111. Voss, K., Klette, R. Theoretische Grundlagen der digitalen Bildverarbeitung, Part IV: Orientierte Nachbarschaftsstrukturen. Bild und Ton. 1986;39:213–219.

1112. Voss, K., Roth, K. Discontinuous point sets and digital curves in the two-dimensional orthogonal lattice. Computers Artificial Intelligence. 1984;3:539–549.

1113. Voss, K., Süsse, H. Adaptive Modelle und Invarianten für zweidimensionale Bilder. Shaker, Aachen: Germany, 1995.

1114. Vossepoel, A.M. A note on “Distance transformations in digital images.”. Computer Vision, Graphics, Image Processing. 1988;43:88–97.

1115. Vossepoel, A.M., Smeulders, A.W.M. Vector code probability and metrication error in the representation of straight lines of finite length. Computer Graphics Image Processing. 1982;20:347–364.

1116. Wagner, D., Tajine, M., Ronse, C., An approach to discretization based on Hausdorff metric. Heijmans, H.J.A.M., Roerdink, J.B.T.M., eds. Mathematical Morphology and its Applications to Image and Signal Processing IV. Kluwer: Amsterdam, The Netherlands, 1998:67–74.

1117. Wang, P.S.P., Zhang, Y.Y. A fast and flexible thinning algorithm. IEEE Trans. Computers. 1989;38:741–745.

1118. Wang, S., Rosenfeld, A., Wu, A.Y. A medial axis transformation for gray scale pictures. IEEE Trans. Pattern Analysis Machine Intelligence. 1982;4:419–421.

1119. Wang, X., Bertrand, G. Some sequential algorithms for a generalized distance transformation based on Minkowski operations. IEEE Trans. Pattern Analysis Machine Intelligence. 1992;14:1114–1121.

1120. Welzl, E. Smallest enclosing disks (balls and ellipsoids). In: Maurer H., ed. New Results and New Trends in Computer Science. Berlin, Germany,: Springer; 1991:359–370. Lecture Notes in Computer Science 555

1121. Werman, M., Wu, A.Y., Melter, R.A. Recognition and characterization of digitized curves. Pattern Recognition Letters. 1987;5:207–213.

1122. Weyl, H. Symmetry. Princeton University Press: Princeton, New Jersey, 1952.

1123. Whitehead, J.H.C., On the realizability of homotopy groups. Annals Mathematics, 50. Pergamon Press: Oxford, United Kingdom, 1949:261–263. Also in: The Mathematical Works of J. H. C. Whitehead Vol. 3, 221–223,1962

1124. Whiting, P.D., Hillier, J.A. A method for finding the shortest route through a road network. Operational Research Quarterly. 1960;11:37–40.

1125. Wilhelms, J., Gelder, A.V. Octrees for faster isosurface generation. ACM Trans. Graphics. 1992;11:201–227.

1126. Wilhelms, J., Gelder, A.V., Topological considerations in isosurface generation. Technical Report UCSC-CRL. University of California: Santa Cruz, California, 1994:31–94.

1127. Winston, P.H. Learning structural descriptions from examples. In: Winston P.H., ed. The Psychology of Computer Vision. New York: McGraw-Hill; 1975:157–209.

1128. Wood, D., An isothetic view of computational geometry. Toussaint G.T., ed. Computational Geometry. 1985: 429–459. North Holland, Amsterdam, The Netherlands

1129. Woodard, D.W. On two-dimensional analysis situs with special reference to the Jordan curve theorem. Fundamenta Mathematicae. 1929;13:121–145.

1130. Wolfram, S. 4th. The Mathematica Book. Cambridge University Press: Cambridge, United Kingdom, 1999.

1131. Worring, M., Smeulders, A.W.M. Digital curvature estimation. Computer Vision, Graphics, Image Processing. 1993;58:366–382.

1132. Worring, M., Smeulders, A.W.M. Digitized circular arcs: Characterization and parameter estimation. IEEE Trans. Pattern Analysis Machine Intelligence. 1995;17:587–598.

1133. Wright, M.W., Cipolla, R., Giblin, P.J. Skeletonization using an extended Euclidean distance transform. Image Vision Computing. 1995;13:367–375.

1134. Wu, A.Y., Rosenfeld, A. Geodesic visibility in graphs. Information Sciences. 1998;108:5–12.

1135. Wu, K.Y., Tsai, W.H. A new one-pass parallel thinning algorithm for binary images. Pattern Recognition Letters. 1992;13:715–723.

1136. Wu, L., On the Freeman’s conjecture about the chain code of a line. Proc. Int. Conf Pattern Recognition. 1980: 32–34. IEEE

1137. Wu, L.D. On the chain code of a line. IEEE Trans. Pattern Analysis Machine Intelligence. 1982;4:347–353.

1138. Wu, L.D., Weng, F.L., Chain code for a line segment and formal language. Proc. Int. ConfPattern Recognition. 1986: 1124–1126. IEEE

1139. Wu, X., Rokne, J. On properties of discretized convex curves. IEEE Trans. Pattern Analysis Machine Intelligence. 1989;2:217–223.

1140. Wyse, F. A special topology for the integers. American Mathematical Monthly. 1970;77:1119.

1141. Wyvill, G., McPheeters, C., Wyvill, B. Data structures for soft objects. The Visual Computer. 1986;2:227–234.

1142. Xia, Y. Skeletonization via the realization of the fire front’s propagation and extinction in digital binary shapes. IEEE Trans. Pattern Analysis Machine Intelligence. 1989;11:1076–1086.

1143. Xu, W., Wang, C. CGT: A fast thinning algorithm implemented on a sequential computer. IEEE Trans. Man, Cybernetics. 1987;17:847–851.

1144. Yagel, R., Cohen, D., Kaufman, A. Normal estimation in 3D discrete space. The Visual Computer. 1992;8:278–291.

1145. Yaglom, I.M., Boltjanskij, V.G. Kelly, P.J., Walton, L.F., eds. Convex Figures(in Russian). JHolt, Rinehart and Winston: New York, 1961. Gosudarstv. Izdat Tehn. -Teor. Lit. Moscow, Russia, English translation

1146. Yamashita, M., Honda, N. Distance functions defined by variable neighborhood sequences. Pattern Recognition. 1984;17:509–513.

1147. Yamashita, M., Ibaraki, T. Distances defined by neighborhood sequences. Pattern Recognition. 1986;19:237–246.

1148. Yan, L., Shiran, D. Crossley, N., Lun, W.C., eds. Chinese Mathematics: A Concise History. Clarendon Press: Oxford, United Kingdom, 1987:66–68. translated by

1149. Yip, B., Klette, R. Angle counts for isothetic polygons and polyhedra. Pattern Recognition Letters. 2003;24:1275–1278.

1150. Yokoi, S., Toriwaki, J., Fukumura, T. An analysis of topological properties of digitized binary pictures using local features. Computer Graphics Image Processing. 1975;4:63–73.

1151. Yokoi, S., Toriwaki, J., Fukumura, T. On generalized distance transformation of digitized pictures. IEEE Trans. Pattern Analysis Machine Intelligence. 1981;3:424–443.

1152. Young, D.P., Melvin, R.G., Bieterman, M.B., Johnson, F.T., Samant, S.S. A locally refined rectangular grid finite element method: Application to computational fluid dynamics and computational physics. J. Computational Physics. 1991;82:1–66.

1153. Youngs, J.W.T. Minimal imbeddings and the genus of a graph. J. Mathematics Mechanics. 1963;12:303–315.

1154. Yu, L., Klette, R. An approximative calculation of relative convex hulls for surface area estimation. Proc. Image Vision Computing New Zealand. 2001:69–74.

1155. Yuan, J., Suen, C.Y. An optimal O(n)algorithm for identifying line segments from a sequence of chain codes. Pattern Recognition. 1995;28:635–646.

1156. Yuen, P.C., Feng, G.C. A novel method for parameter estimation of [a] digital arc. Pattern Recognition Letters. 1996;17:929–938.

1157. Zadeh, L. Fuzzy sets. Information Control. 1965;8:338–353.

1158. Zhang, T.Y., Suen, C.Y. A fast parallel algorithm for thinning digital patterns. Comm. ACM. 1984;27:236–239.

1159. Zhang, Y.Y. Redundancy of parallel thinning. Pattern Recognition Letters. 1997;18:27–35.

1160. Zhang, Y.Y., Wang, P.S.P. Analytical comparison of thinning algorithms. Int. J. Pattern Recognition Artificial Intelligence. 1993;7:1227–1246.

1161. Zhang, Y.Y., Wang, P.S.P. A new parallel thinning methodology. Int. J. Pattern Recognition Artificial Intelligence. 1994;8:999–1011.

1162. Zhang, Y.Y., Wang, P.S.P. Analysis and design of parallel thinning algorithms—A generic approach. Int. J. Pattern Recognition Artificial Intelligence. 1995;9:735–752.

1163. Zhou, R.W., Quek, C., Ng, G.S. A novel single-pass thinning algorithm and an effective set of performance criteria. Pattern Recognition Letters. 1995;16:1267–1275.

1164. Zhu, P., Chirlain, P.M. On critical point detection of digital shapes. IEEE Trans. Pattern Analysis Machine Intelligence. 1995;17:737–748.

1165. Žuniimage, J., On digital convex polygons. Klette, R., Rosenfeld, A., Sloboda, F., eds. Advances in Digital and Computational Geometry. Springer: Singapore, 1998:255–283.

1166. Žuniimage, J. Limit shape of convex lattice polygons having the minimal L∞diameter w.r.t. the number of their vertices. Discrete Mathematics. 1998;187:245–254.

1167. J. Žuniimage On the number of digital discs J. Mathematical Imaging Vision, to appear.

..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset