Convexity invariance of voxel objects under rigid motions

Volume data can be represented by voxels. In many applications of computer graphics (e.g. animation, simulation) and image processing (e.g. shape registration), such voxel data require manipulations. Among the simplest manipulations, we are interested in rigid motions, namely motions that do not change the shape of voxel objects but do change their position and orientation. Such motions are well-known as isometric transformations in continuous spaces. However, when they are applied on voxel data, some important properties of geometry and topology are generally lost. In this article, we discuss this issue, and we provide a method for rigid motions of voxel objects that preserves the global convexity properties of objects, with digital topology guarantees. This method is based on the standard notion of H-convexity, and a new notion of quasi-regularity.

[1]  Peer Stelldinger,et al.  Topological Equivalence between a 3D Object and the Reconstruction of Its Digital Image , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Peer Stelldinger,et al.  Towards a general sampling theory for shape preservation , 2005, Image Vis. Comput..

[3]  Kurt Mehlhorn,et al.  Checking geometric programs or verification of geometric structures , 1996, SCG '96.

[4]  Isabelle Debled-Rennesson,et al.  Convexity-Preserving Rigid Motions of 2D Digital Objects , 2017, DGCI.

[5]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[6]  Henk J. A. M. Heijmans,et al.  The algebraic basis of mathematical morphology. I Dilations and erosions , 1990, Comput. Vis. Graph. Image Process..

[7]  Hugues Talbot,et al.  Topology-Preserving Rigid Transformation of 2D Digital Images , 2014, IEEE Transactions on Image Processing.

[8]  Chul E. Kim.  On the Cellular Convexity of Complexes , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Henk J. A. M. Heijmans,et al.  The algebraic basis of mathematical morphology : II. Openings and closings , 1991, CVGIP Image Underst..

[10]  Jack Sklansky,et al.  Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.

[11]  Ulrich Eckhardt,et al.  Digital Lines and Digital Convexity , 2000, Digital and Image Geometry.

[12]  Pierre Alliez,et al.  CGAL - The Computational Geometry Algorithms Library , 2011 .

[13]  G. C. Shephard,et al.  Convex Polytopes and the Upper Bound Conjecture , 1971 .

[14]  R.M. McElhaney,et al.  Algorithms for graphics and image processing , 1983, Proceedings of the IEEE.

[15]  Faouzi Ghorbel,et al.  A simple and efficient approach for 3D mesh approximate convex decomposition , 2009, 2009 16th IEEE International Conference on Image Processing (ICIP).

[16]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[17]  Hugues Talbot,et al.  Topology-Preserving Conditions for 2D Digital Images Under Rigid Transformations , 2014, Journal of Mathematical Imaging and Vision.