References
- Aktouf, Z., G. Bertrand, and L. Perroton. 2002. “A Three-Dimensional Holes Closing Algorithm.” Pattern Recognition Letters 23 (5): 523–531. doi:https://doi.org/10.1016/S0167-8655(01)00152-0.
- Altantsetseg, E., O. Khorloo, K. Matsuyama, and K. Konno. 2017. “Complex Hole-Filling Algorithm for 3D Models.” CGI ‘17 Proceedings of the Computer Graphics International Conference, Yokohama, Japan, 23-30 June 2017: 1-6. NY, United States: ACM.
- Attene, M., M. Campen, and L. Kobbelt. 2013. “Polygon Mesh Repairing: An Application Perspective.” ACM Computing Surveys 45 (2): 15–1–15–33. doi:https://doi.org/10.1145/2431211.2431214.
- Bertrand, G. 1994. “Simple Points, Topological Numbers and Geodesic Neighborhoods in Cubic Grids.” Pattern Recognition Letters 15 (10): 1003–1011. doi:https://doi.org/10.1016/0167-8655(94)90032-9.
- Bertrand, G., and M. Couprie. 2015. “Isthmus Based Parallel and Symmetric 3D Thinning Algorithms.” Graphical Models 80: 1–15. doi:https://doi.org/10.1016/j.gmod.2015.05.001.
- Bischoff, S., D. Pavic, and L. Kobbelt. 2005. “Automatic Restoration of Polygon Models.” ACM Transactions on Graphics 24 (4): 1332–1352. doi:https://doi.org/10.1145/1095878.1095883.
- Borgefors, G. 1984. “Distance Transformations in Arbitrary Dimensions.” Computer Vision Graphics & Image Processing 27 (3): 321–345. doi:https://doi.org/10.1016/0734-189X(84)90035-5.
- Burtsev, S. V., and Y. P. Kuzmin. 1993. “An Efficient Flood-Filling Algorithm.” Computers & Graphics 17 (5): 549–561. doi:https://doi.org/10.1016/0097-8493(93)90006-U.
- Gibson, S. F. 1998. “Constrained Elastic Surface Nets: Generating Smooth Surfaces from Binary Segmented Data.” MICCAI 1998: Medical Image Computing and Computer-Assisted Intervention, MA, USA, 11–13 October 1998:888–898.
- Guo, X., J. Xiao, and Y. Wang. 2018. “A Survey on Algorithms of Hole Filling in 3D Surface Reconstruction.” The Visual Computer 34 (1): 93–103. doi:https://doi.org/10.1007/s00371-016-1316-y.
- Hughes, S. W., T. J. D’Arcy, D. J. Maxwell, J. E. Saunders, C. F. Ruff, W. S. C. Chiu, and R. J. Sheppard. 1996. “Application of a New Discreet Form of Gauss’ Theorem for Measuring Volume.” Physics in Medicine and Biology 41 (9): 1809–1821. doi:https://doi.org/10.1088/0031-9155/41/9/016.
- Janaszewski, M., M. Postolski, and L. Babout. 2011. “Robust Algorithm for Tunnel Closing in 3D Volumetric Objects Based on Topological Characteristics of Points.” Pattern Recognition Letters 32 (16): 2231–2238. doi:https://doi.org/10.1016/j.patrec.2011.06.013.
- Jones, W. M. 1996. “The Production of Volume Data from Triangular Meshes Using Voxelisation.” Computer Graphics Forum 15 (5): 311–318. doi:https://doi.org/10.1111/1467-8659.1550311.
- Ju, T., F. Losasso, S. Schaefer, and J. Warren. 2002. “Dual Contouring of Hermite Data.” ACM Transactions on Graphics 21 (3): 339–346. doi:https://doi.org/10.1145/566654.566586.
- Kobbelt, L. P., M. Botsch, U. Schwanecke, and H. P. Seidel. 2001. “Feature Sensitive Surface Extraction from Volume Data.” SIGGRAPH ‘01: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States, 12-17 August 2001:57–66. NY, United States: ACM.
- Kong, T. Y. 1989. “A Digital Fundamental Group.” Computers & Graphics 13 (2): 159–166. doi:https://doi.org/10.1016/0097-8493(89)90058-7.
- Kong, T. Y., and A. Rosenfeld. 1989. “Digital Topology: Introduction and Survey.” Computer Vision, Graphics, and Image Processing 48 (3): 357–393. doi:https://doi.org/10.1016/0734-189X(89)90147-3.
- Lorensen, W. E., and H. E. Cline. 1987. “Marching Cubes: A High Resolution 3D Surface Construction Algorithm.” ACM SIGGRAPH Computer Graphics 21 (4): 163–169. doi:https://doi.org/10.1145/37401.37422.
- Malandain, G., G. Bertrand, and N. Ayache. 1993. “Topological Segmentation of Discrete Surfaces.” International Journal of Computer Vision 10 (2): 183–197. doi:https://doi.org/10.1007/BF01420736.
- Nooruddin, F. S., and G. Turk. 2003. “Simplification and Repair of Polygonal Modes Using Volumetric Techniques.” IEEE Transactions on Visualization and Computer Graphics 9 (2): 191–205. doi:https://doi.org/10.1109/TVCG.2003.1196006.
- Palágyi, K., and G. Németh. 2016. “A Pair of Equivalent Sequential and Fully Parallel 3D Surface-Thinning Algorithms.” Discrete Applied Mathematics 216: 348–361. doi:https://doi.org/10.1016/j.dam.2016.03.012.
- Pérez, E., S. Salamanca, P. Merchán, and A. Adán. 2016. “A Comparison of Hole-Filling Methods in 3D.” International Journal of Applied Mathematics and Computer Science 26 (4): 885–903. doi:https://doi.org/10.1515/amcs-2016-0063.
- Schaefer, S., and J. Warren. 2004. “Dual Marching Cubes: Primal Contouring of Dual Grids.” 12th Pacific conference on computer graphics and applications, Seoul, South Korea, 6–8 October 2004:70–76.
- Schwarz, M., and H. P. Seidel. 2010. “Fast Parallel Surface and Solid Voxelization on GPUs.” ACM Transactions on Graphics 29 (6): 1–10. doi:https://doi.org/10.1145/1882261.1866201.
- Wang, X., J. Hu, D. Zhang, L. Guo, H. Qin, and A. Hao. 2018. “Multi-Scale Geometry Detail Recovery on Surfaces via Empirical Mode Decomposition.” Computers & Graphics 70: 118–127. doi:https://doi.org/10.1016/j.cag.2017.07.024.
- Yu, W. W., F. He, and P. Xi. 2010. “A Rapid 3D Seed-Filling Algorithm Based on Scan Slice.” Computers & Graphics 34 (4): 449–459. doi:https://doi.org/10.1016/j.cag.2010.05.005.
- Yuan, F. L. 2019. “Combined 3D Thinning and Greedy Algorithm to Approximate Realistic Particles with Corrected Mechanical Properties.” Granular Matter 21 (2): 19–1–19–18. doi:https://doi.org/10.1007/s10035-019-0874-x.
- Zhang, C., and T. Chen. 2016. “Efficient Feature Extraction for 2D/3D Objects in Mesh Representation.” International Conference on Image Processing, Thessaloniki, Greece, 7–10 October 2001:935–938. New York: IEEE.