An analysis of surface area estimates of binary volumes under three tilings

In this paper, we first review local counting methods for perimeter estimation of piecewise smooth binary figures on square, hexagonal, and triangular grids. We verify that better perimeter estimates, using local counting algorithms, can be obtained using hexagonal or triangular grids. We then compare surface area estimates using local counting techniques for binary three-dimensional volumes under the three semi-regular polyhedral tilings: the cubic, truncated octahedral, and rhombic dodecahedral tilings. It is shown that for surfaces of random orientation with a uniform distribution, the expected error of surface area estimates is smaller for the truncated octahedral and rhombic dodecahedral tilings than for the standard cubic or rectangular prism tilings of space. Additional properties of these tessellations are reviewed and potential applications of better surface area estimates are discussed.

[1]  Innchyn Her,et al.  Resampling on a Pseudohexagonal Grid , 1994, CVGIP Graph. Model. Image Process..

[2]  Cherng Min Ma,et al.  On topology preservation in 3D thinning , 1994 .

[3]  Aristides A. G. Requicha,et al.  Algorithms for computing the volume and other integral properties of solids. I. known methods and open issues , 1982, CACM.

[4]  John N. Tsitsiklis,et al.  Local Versus Nonlocal Computation of Length of Digitized Curves , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  G. McCarthy,et al.  Imaging the structural changes associated with human epilepsy , 1994 .

[6]  Stephen Wolfram,et al.  The Mathematica Book , 1996 .

[7]  J. Koplowitz,et al.  Design Of Perimeter Estimators For Digitized Planar Shapes , 1988, Other Conferences.

[8]  Bidyut Baran Chaudhuri,et al.  3D Digital Topology under Binary Transformation with Applications , 1996, Comput. Vis. Image Underst..

[9]  Marcel J. E. Golay,et al.  Hexagonal Parallel Pattern Transformations , 1969, IEEE Transactions on Computers.

[10]  Edward S. Deutsch,et al.  Thinning algorithms on rectangular, hexagonal, and triangular arrays , 1972, Commun. ACM.

[11]  Aristides A. G. Requicha,et al.  Algorithms for computing the volume and other integral properties of solids. II. A family of algorithms based on representation conversion and cellular approximation , 1982, CACM.

[12]  Peter C. Gasson,et al.  Geometry of spatial forms , 1983 .

[13]  Azriel Rosenfeld,et al.  Winding and Euler numbers for 2D and 3D digital images , 1991, CVGIP Graph. Model. Image Process..

[14]  E. Dubois,et al.  The sampling and reconstruction of time-varying imagery with application in video systems , 1985, Proceedings of the IEEE.

[15]  L. Santaló.  Integral geometry and geometric probability , 1976 .

[16]  Sudarshan P. Bhat,et al.  On the computation of integral properties of objects , 1990 .

[17]  L. A. Li︠u︡sternik.  Convex figures and polyhedra , 1966 .

[18]  Y. J. Tejwani,et al.  Robot vision , 1989, IEEE International Symposium on Circuits and Systems,.

[19]  R.M. Mersereau,et al.  The processing of hexagonally sampled two-dimensional signals , 1979, Proceedings of the IEEE.

[20]  G D Pearlson,et al.  Reversal of asymmetry of the planum temporale in schizophrenia. , 1995, The American journal of psychiatry.

[21]  Stephen B. Gray,et al.  Local Properties of Binary Images in Two Dimensions , 1971, IEEE Transactions on Computers.