A binary segmentation approach for 3D duo-spheres
Keywords:
binary segmentation, 3D duo-spheres, weight functions, improved max-flow min-cutAbstract
This paper is to present an interactive binary segmentation approach on a 3D duo-spheres. Our proposed approach has successfully partitioned the 3D mesh into two disjoint spheres. Six weight functions are added as soft constraints, together with the proposed max-flow min-cut to find the globally optimal binary segmentation. Some experimental results are included to demonstrate the effectiveness of our proposed binary segmentation approach.
References
Takahashi, S., Wu, H.Y., Saw, S.H., Lin, C.C. and Yen, H.C. 2011, September. Optimized topological surgery for unfolding 3d meshes. In Computer graphics forum. 30(7), 2077-2086. Oxford, UK: Blackwell Publishing Ltd.
Vanek, J., Galicia, J.G., Benes, B., Měch, R., Carr, N., Stava, O. and Miller, G.S. 2014, September. PackMerger: A 3D print volume optimizer. In Computer Graphics Forum. 33(6), 322-332.
Apaza-Agüero, K., Silva, L. and Bellon, O.R. 2015, September. Mesh segmentation with connecting parts for 3D object prototyping. In 2015 IEEE International Conference on Image Processing (ICIP). 16-20. IEEE.
Bücking, T.M., Hill, E.R., Robertson, J.L., Maneas, E., Plumb, A.A. and Nikitichev, D.I. 2017. From medical imaging data to 3D printed
anatomical models. PloS one.12(5), p.e0178540.
Katz, S. and Tal, A. 2003. Hierarchical mesh decomposition using fuzzy clustering and cuts. ACM transactions on graphics (TOG).22(3), 954-961.
Sam, V., Kawata, H. and Kanai, T. 2012. A robust and centered curve skeleton extraction from 3D point cloud. Computer-Aided Design and Applications, 9(6), 869-879.
Gao, L., Lai, Y.K., Huang, Q.X. and Hu, S.M. 2013, May. A data‐driven approach to realistic shape morphing. In Computer graphics forum. 32(2pt4), 449-457. Oxford, UK: Blackwell Publishing Ltd.
Jiang, L., Ye, J., Sun, L. and Li, J. 2019. Transferring and fitting fixed-sized garments onto bodies of various dimensions and postures. Computer-Aided Design.106, 30-42.
Funkhouser, T., Kazhdan, M., Shilane, P., Min, P., Kiefer, W., Tal, A., Rusinkiewicz, S. and Dobkin, D. 2004. Modeling by example. ACM transactions on graphics (TOG). 23(3), 652-663.
Dubrovina, A., Xia, F., Achlioptas, P., Shalah, M., Groscot, R. and Guibas, L.J. 2019. Composite shape modeling via latent space factorization. In Proceedings of the IEEE International Conference on Computer Vision. 8140-8149.
Philip Shilane, M.K.T.F. and Min, P. 2005. Princeton shape retrieval and analysis group: Princeton shape benchmark.
Thomas Ebner, L.B.-G. and Gumhold, S. 2006. Development of a surface simplification tool using the kmmcs data structure, Master’s
thesis, University of Technology Dresden.
Shamir, A. 2008, September. A survey on mesh segmentation techniques. In Computer graphics forum. 27(6), 1539-1556. Oxford, UK: Blackwell Publishing Ltd.
Cohen, J., Olano, M. and Manocha, D. 1998, July. Appearancepreserving simplification. In Proceedings of the 25th annual conference on Computer graphics and interactive techniques. 115-122.
Luebke, D.P. 2001. A developer's survey of polygonal simplification algorithms. IEEE Computer Graphics and Applications.21(3), 24-35.
Melax, S. 1998. A simple, fast, and effective polygon reduction algorithm. Game Developer, 11, 44-49.
Boykov, Y. and Kolmogorov, V. 2004. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision.
IEEE transactions on pattern analysis and machine intelligence, 26(9), 1124-1137.
Saw, S. H. Han, Y.-D. Lee, B.-G. and Ewe, H.-T.2015. A weighted min-cut max-flow approach for 3d mesh segmentation, China Academic Journal Electronic Publishing House, 574–577.
Ebner, T. 2006. Development of a surface simplification tool using the kmmcs data structure), Master’s thesis.
Hoffman, D.D. and Singh, M. 1997. Salience of visual parts. Cognition. 63(1), 29-78.
Hoffman, D.D. and Singh, M. 1997. Salience of visual parts. Cognition. 63(1), 29-78.
Lindstrom, P. and Turk, G. 1999. Evaluation of memoryless simplification. IEEE Transactions on Visualization and Computer Graphics. 5(2), 98-115.
Dyn, N., Hormann, K., Kim, S.J. and Levin, D. 2001. Optimizing 3D triangulations using discrete curvature analysis. Mathematical methods for curves and surfaces. 1, 135-146.
Desbrun,M., Meyer, M.,Schröder, P.,Barr, A.H. 2000. Discrete differential-geometry operators in nD.The Caltech Multi-Res Modeling Group. preprint
Ford Jr, L.R. and Fulkerson, D.R. 2015. Flows in networks. Princeton university press, London.
William, J. C., William, H. C., William, R. P. and Alexander, S. 1997. Combinatorial Optimization. A Wiley-Interscience, New York. 1 ed.
Abdullah, N. and Hua T.K.2017. The Application of the Shortest Path and Maximum flow with bottleneck in Traffic Flow of Kota Kinabalu. Journal of Computer Science & Computational Mathematics. 7(2), 37-43.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 COMPUSOFT: An International Journal of Advanced Computer Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
©2023. COMPUSOFT: AN INTERNATIONAL OF ADVANCED COMPUTER TECHNOLOGY by COMPUSOFT PUBLICATION is licensed under a Creative Commons Attribution 4.0 International License. Based on a work at COMPUSOFT: AN INTERNATIONAL OF ADVANCED COMPUTER TECHNOLOGY. Permissions beyond the scope of this license may be available at Creative Commons Attribution 4.0 International Public License.
