Time-efficient computation of 3D topological functions
暂无分享,去创建一个
[1] John Mylopoulos,et al. Some Results in Computational Topology , 1973, JACM.
[2] T. Yung Kong,et al. A digital fundamental group , 1989, Comput. Graph..
[3] Bidyut Baran Chaudhuri,et al. Detection of 3-D Simple Points for Topology Preserving Transformations with Application to Thinning , 1994, IEEE Trans. Pattern Anal. Mach. Intell..
[4] A. W. Roscoe,et al. Concepts of digital topology , 1992 .
[5] Gilles Bertrand,et al. A new characterization of three-dimensional simple points , 1994, Pattern Recognition Letters.
[6] Gilles Bertrand,et al. A Boolean characterization of three-dimensional simple points , 1996, Pattern Recognition Letters.
[7] Azriel Rosenfeld,et al. Digital topology: Introduction and survey , 1989, Comput. Vis. Graph. Image Process..
[8] Richard W. Hall,et al. Parallel 3D shrinking algorithms using subfields notions , 1992, [1992] Proceedings. 11th IAPR International Conference on Pattern Recognition.
[9] Frans C. A. Groen,et al. Speeding up 3-D Binary Image Processing for Robot Vision , 1986, Other Conferences.
[10] Grégoire Malandain,et al. Fast characterization of 3D simple points , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,.
[11] Frans C. A. Groen,et al. Three-Dimensional Skeletonization: Principle and Algorithm , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[12] Richard W. Hall,et al. Time-efficient computations for topological functions in 3D images , 1995, Proceedings., International Conference on Image Processing.