A heuristic convexity measure for 3D meshes

In this paper we propose a heuristic convexity measure for 3D meshes. Built upon a state-of-the-art convexity measure that employs a time-consuming genetic algorithm for optimization, our new measure projects only once a given 3D mesh onto the orthogonal 2D planes along its principal directions for an initial estimation of mesh convexity, followed by a correction calculation based on mesh slicing. Our measure experimentally shows several advantages over the state-of-the-art one: first, it accelerates the overall computation by approximately an order of magnitude; second, it properly handles those bony meshes usually overestimated by the state-of-the-art measure; third, it improves the accuracy of the state-of-the-art measure in 3D mesh retrieval.

[1]  Muhammad Sarfraz,et al.  Content-based Image Retrieval using Multiple Shape Descriptors , 2007, 2007 IEEE/ACS International Conference on Computer Systems and Applications.

[2]  Ali Shokoufandeh,et al.  Retrieving articulated 3-D models using medial surfaces , 2008, Machine Vision and Applications.

[3]  Junsong Yuan,et al.  Minimum Near-Convex Shape Decomposition , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Nancy M. Amato,et al.  Fast approximate convex decomposition using relative concavity , 2013, Comput. Aided Des..

[5]  Thomas A. Funkhouser,et al.  The Princeton Shape Benchmark , 2004, Proceedings Shape Modeling Applications, 2004..

[6]  Paul L. Rosin,et al.  A new convexity measure for polygons , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Christine L. Mumford,et al.  A symmetric convexity measure , 2004, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004..

[8]  Afzal Godil,et al.  A new convexity measurement for 3D meshes , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[9]  Marcel Campen,et al.  Efficient Computation of Shortest Path-Concavity for 3D Meshes , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[10]  Paul L. Rosin,et al.  Rectilinearity of 3D Meshes , 2009, International Journal of Computer Vision.

[11]  Thomas A. Funkhouser,et al.  A benchmark for 3D mesh segmentation , 2009, ACM Trans. Graph..

[12]  Daniel Cohen-Or,et al.  Weak Convex Decomposition by Lines‐of‐sight , 2013, SGP '13.

[13]  Wenyu Liu,et al.  Convex shape decomposition , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[14]  Nava Rubin,et al.  Measuring convexity for figure/ground separation , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[15]  Esa Rahtu,et al.  A new convexity measure based on a probabilistic interpretation of images , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Afzal Godil,et al.  A Feature-Preserved Canonical Form for Non-rigid 3D Meshes , 2011, 2011 International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission.

[17]  Paul L. Rosin,et al.  Abstract Art by Shape Classification , 2013, IEEE Transactions on Visualization and Computer Graphics.

[18]  Paul L. Rosin.  A two-component rectilinearity measure , 2008, Comput. Vis. Image Underst..

[19]  Paul L. Rosin,et al.  Rectilinearity Measurements for Polygons , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Paul L. Rosin.  Classification of pathological shapes using convexity measures , 2009, Pattern Recognit. Lett..

[21]  Ferran Hurtado,et al.  Measuring regularity of convex polygons , 2013, Comput. Aided Des..

[22]  Paul L. Rosin.  Measuring shape: ellipticity, rectangularity, and triangularity , 2003, Machine Vision and Applications.