IP Library › Granted Patent US 12,505,621
Granted Patent B2
US 12,505,621 · App. 18/112,434 · Granted Dec 23, 2025

ISO-surface mesh generation for three-dimensional models

Inventors: Xifeng Gao (Tallahassee, FL); Zhen Chen (Palo Alto, CA); Zherong Pan (Bellevue, WA); Kui Wu (Los Angeles, CA)
Assignee: Tencent America LLC
G06T17/205G06T5/70G06T17/005G06T17/10G06T19/20G06T2207/20072G06T2210/12G06T2210/21
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,505,621
App. No.
18/112,434
Granted
Dec 23, 2025
Kind
B2
Abstract

A method of generating an iso-surface mesh for a three-dimensional (3D) model is provided. In the method a plurality of voxels is generated in a bounding box of an input mesh, where a size of each of the plurality of voxels is based on a size of the bounding box of the input mesh and an iso-value. One or more iso-surfaces in each of the plurality of voxels are determined based on an unsigned distance function and the iso-value. One or more feature points in each of the plurality of voxels are determined based on the one or more iso-surfaces in the respective voxel and a constraint function. A feature mesh is generated based on the determined one or more feature points, and an edge flip operation is performed on each of a plurality of edges of the feature mesh to generate the iso-surface mesh.

Claims (71)

1 . A method of generating an iso-surface mesh for a three-dimensional (3D) model, the method comprising:

generating, by processing circuitry, a plurality of voxels in a bounding box of an input mesh, a size of each of the plurality of voxels being based on a size of the bounding box of the input mesh and an iso-value;

determining, by the processing circuitry, one or more iso-surfaces in each of the plurality of voxels when an unsigned distance function is equal to the iso-value, the unsigned distance function indicating a minimum distance between a point in an ambient space of the input mesh and a surface of the input mesh;

determining, by the processing circuitry, one or more feature points in each of the plurality of voxels based on the one or more iso-surfaces in the respective voxel and a constraint function;

generating, by the processing circuitry, a feature mesh based on the determined one or more feature points, and performing an edge flip operation on each of a plurality of edges of the feature mesh to generate the iso-surface mesh; and

generating, by the processing circuitry, the 3D model based on the iso-surface mesh.

2 . The method of claim 1 , further comprising:

performing a feature denoising on the iso-surface mesh to reduce artifacts of the iso-surface mesh.

3 . The method of claim 2 , further comprising:

performing an in-and-out test to identify internal components of the iso-surface mesh; and

removing the internal components of the iso-surface mesh.

4 . The method of claim 2 , wherein the performing the feature denoising further comprises:

determining a feature graph based on the feature mesh, the feature graph including a plurality of nodes and a plurality of feature curves, each of the plurality of feature curves being connected to two respective nodes and including one or more mesh edges, a dihedral angle of each of the one or more mesh edges being less than a first threshold;

determining whether each of the plurality of feature curves includes a number of mesh edges that is larger than a second threshold; and

removing the feature points on one or more of the plurality of feature curves with the number of mesh edges that is less than the second threshold.

5 . The method of claim 1 , wherein the generating the plurality of voxels further comprises:

determining the bounding box of the input mesh and a diagonal length of the bounding box;

determining a length parameter that is a product of (i) a greater value between the iso-value and a constant value and (ii) the diagonal length;

determining an upper right coordinate by shifting an upper right coordinate of the bounding box by twice the length parameter; and

determining a bottom left coordinate by shifting a bottom left coordinate of the bounding box by the twice the length parameter.

6 . The method of claim 5 , wherein the generating the plurality of voxels further comprises:

determining that the size of each of the plurality of voxels is equal to a value over a square root of 3, the value being equal to a product of the iso-value and a magnitude of the upper right coordinate minus the bottom left coordinate;

determining a first voxel number indicating a number of the plurality of voxels in a first direction, a second voxel number indicating a number of the plurality of voxels in a second direction, and a third voxel number indicating a number of the plurality of voxels in a third direction; and

determining the plurality of voxels in the bounding box of the input mesh based on the first voxel number, the second voxel number, the third voxel number, the upper right coordinate, and the bottom left coordinate.

7 . The method of claim 6 , wherein the determining the one or more feature points further comprises:

determining iso-points for each of the one or more iso-surfaces, the iso-points being intersection points of the respective iso-surface and edges of the respective voxel; and

determining a respective feature point for each of the one or more iso-surfaces, a coordinate of the respective feature point being determined based on a linear constrained quadratic function and the iso-points of the respective iso-surface, the linear constrained quadratic function indicating a minimum value of a product of (i) a difference between the respective feature point and one of the iso-points and (ii) a normalized component of a Clarke subdifferential at the one of the iso-points.

8 . The method of claim 6 , wherein the determining the one or more feature points further comprises one of:

determining two feature points in a first voxel of the plurality of voxels, the first voxel being divided into two components by a plane that is formed based on cube vertices of the first voxel;

determining three feature points in a second voxel of the plurality of voxels, the second voxel being divided into three components by a separating polyhedron that is formed based on cube vertices of the second voxel; and

determining four feature points in a third voxel of the plurality of voxels, the third voxel being divided into four components by a separating polyhedron that is formed based on cube vertices and a cube center of the third voxel.

9 . The method of claim 5 , wherein the iso-value is equal to the diagonal length of the bounding box over a number of pixels along the diagonal length.

10 . The method of claim 1 , further comprising:

determining whether two end points of each of the plurality of edges of the feature mesh are feature points;

in response to the two end points of a first edge of the plurality of edges being feature points, determining whether the first edge intersects with one or more neighboring edges of the first edge in the feature mesh; and

in response to the first edge intersecting with the one or more neighboring edges of the first edge, performing the edge flip operation on the first edge such that the first edge does not intersect with the one or more neighboring edges.

11 . The method of claim 10 , wherein the determining whether the first edge intersects further comprises:

determining a first sub-mesh in the feature mesh that includes one or more first faces, each of the one or more first faces including the first edge;

determining a second sub-mesh in the feature mesh, the second sub-mesh including a plurality of second faces, each of the plurality of second faces sharing at least one vertex of the first sub-mesh;

determining a third sub-mesh in the feature mesh, the third sub-mesh including a plurality of third faces that are not included in the first sub-mesh and the second sub-mesh;

constructing a bounding volume hierarchy (BVH) tree data structure of the third sub-mesh based on a BVH tree type;

for each of the one or more first faces of the first sub-mesh, determining a closest face of the respective first face in the third sub-mesh based on the BVH tree data structure of the third sub-mesh; and

determining whether each of the one or more first faces of the first sub-mesh intersects the closest face of the respective first face.

12 . An apparatus for generating an iso-surface mesh for a three-dimensional (3D) model, the apparatus comprising:

processing circuitry configured to:

generate a plurality of voxels in a bounding box of an input mesh, a size of each of the plurality of voxels being based on a size of the bounding box of the input mesh and an iso-value;

determine one or more iso-surfaces in each of the plurality of voxels when an unsigned distance function is equal to the iso-value, the unsigned distance function indicating a minimum distance between a point in an ambient space of the input mesh and a surface of the input mesh;

determine one or more feature points in each of the plurality of voxels based on the one or more iso-surfaces in the respective voxel and a constraint function; and

generate a feature mesh based on the determined one or more feature points, and perform an edge flip operation on each of a plurality of edges of the feature mesh to generate the iso-surface mesh; and

generate the 3D model based on the iso-surface mesh.

13 . The apparatus of claim 12 , wherein the processing circuitry is configured to:

perform a feature denoising on the iso-surface mesh to reduce artifacts of the iso-surface mesh.

14 . The apparatus of claim 13 , wherein the processing circuitry is configured to:

perform an in-and-out test to identify internal components of the iso-surface mesh; and

remove the internal components of the iso-surface mesh.

15 . The apparatus of claim 13 , wherein the processing circuitry is configured to:

determine a feature graph based on the feature mesh, the feature graph including a plurality of nodes and a plurality of feature curves, each of the plurality of feature curves being connected to two respective nodes and including one or more mesh edges, a dihedral angle of each of the one or more mesh edges being less than a first threshold;

determine whether each of the plurality of feature curves includes a number of mesh edges that is larger than a second threshold; and

remove the feature points on one or more of the plurality of feature curves with the number of mesh edges that is less than the second threshold.

16 . The apparatus of claim 12 , wherein the processing circuitry is configured to:

determine the bounding box of the input mesh and a diagonal length of the bounding box;

determine a length parameter that is a product of (i) a greater value between the iso-value and a constant value and (ii) the diagonal length;

determine an upper right coordinate by shifting an upper right coordinate of the bounding box by twice the length parameter; and

determine a bottom left coordinate by shifting a bottom left coordinate of the bounding box by the twice the length parameter.

17 . The apparatus of claim 16 , wherein the processing circuitry is configured to:

determine that the size of each of the plurality of voxels is equal to a value over a square root of 3, the value being equal to a product of the iso-value and a magnitude of the upper right coordinate minus the bottom left coordinate;

determine a first voxel number indicating a number of the plurality of voxels in a first direction, a second voxel number indicating a number of the plurality of voxels in a second direction, and a third voxel number indicating a number of the plurality of voxels in a third direction; and

determine the plurality of voxels in the bounding box of the input mesh based on the first voxel number, the second voxel number, the third voxel number, the upper right coordinate, and the bottom left coordinate.

18 . The apparatus of claim 17 , wherein the processing circuitry is configured to:

determine iso-points for each of the one or more iso-surfaces, the iso-points being intersection points of the respective iso-surface and edges of the respective voxel; and

determine a respective feature point for each of the one or more iso-surfaces, a coordinate of the respective feature point being determined based on a linear constrained quadratic function and the iso-points of the respective iso-surface, the linear constrained quadratic function indicating a minimum value of a product of (i) a difference between the respective feature point and one of the iso-points and (ii) a normalized component of a Clarke subdifferential at the one of the iso-points.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 21, 2023
From: GAO, XIFENG; CHEN, ZHEN; PAN, ZHERONG; WU, KUI
To: TENCENT AMERICA LLC
Reel/Frame 062759/0265 →
Continuity (1)
Related Publication 20240296628A1 · Sep 5, 2024
References Cited (94)
US 10678959B2 · Brochu · 2020 [cited by examiner]
US 11219526B2 · Mahfouz · 2022 [cited by examiner]
US 11315319B2 · Yu · 2022 [cited by examiner]
US 11998422B2 · Nikolskiy · 2024 [cited by examiner]
US 20170061036A1 · Schmidt · 2017 [cited by examiner]
Liu et al., “Seamless: Seam erasure and seam-aware decoupling of shape from mesh resolution,” ACM Trans. Graph., Nov. 2017, vol. 36, No. 6, Article 216, 15 pages. [cited by applicant]
Lopes et al., “Improving the Robustness and Accuracy of the Marching Cubes Algorithm for Isosurfacing,” IEEE Transactions on Visualization and Computer Graphics, Jan.-Mar. 2003, vol. 9, No. 1, pp. 16-29. [cited by applicant]
Lorensen et al., “Marching Cubes: A High Resolution 3D Surface Construction Algorithm,” SIGGRAPH Computer Graphics, Jul. 1987, vol. 21, No. 4, pp. 163-169. [cited by applicant]
Luan et al., “Unified Shape and SVBRDF Recovery using Differentiable Monte Carlo Rendering,” Eurographics Symposium on Rendering 2021, 2021, vol. 40, No. 4, 13 pages. [cited by applicant]
Manson et al., “Isosurfaces Over Simplicial Partitions of Multiresolution Grids,” EUROGRAPHICS 2010, 2010, vol. 29, No. 2, 9 pages. [cited by applicant]
Matveyev, Sergey V., “Approximation of Isosurface in the Marching Cube: Ambiguity Problem.” Proceedings of the Conference on Visualization '94, IEEE, Oct. 1994, pp. 288-292. [cited by applicant]
Mehra et al., “Abstraction of Man-Made Shapes,” ACM Trans. Graph., Dec. 2009, vol. 28, No. 5, Article 137, 10 pages. [cited by applicant]
Munkberg et al., “Extracting Triangular 3D Models, Materials, and Lighting From Images,” Proceedings of the IEEE/CVF Conference on Comuter Vision and attern Recognition (CVPR), 2022, pp. 8280-8290. [cited by applicant]
Nan et al., “PolyFit: Polygonal Surface Reconstruction from Point Clouds,” Proceedings of the IEEE International Conference on Computer Vision, 2017, pp. 2353-2361. [cited by applicant]
Nicolet et al., “Large Steps in Inverse Rendering of Geometry,” ACM Trans. Graph., Dec. 2021, vol. 40, No. 6, Article 248, 13 pages. [cited by applicant]
Nielson et al., “The Asymptotic Decider: Resolving the Ambiguity in Marching Cubes,” Proceeding Visualization '91, 1991, vol. 91, pp. 83-91. [cited by applicant]
Nielson, G.M., “On marching cubes,” IEEE Transactions on Visualization and Computer Graphics, 2003, vol. 9, Issue 3, pp. 283-297. [cited by applicant]
Nielson, Gregory M., “Dual Marching Cubes,” IEEE Visualization 2004, IEEE, 2004, pp. 489-496. [cited by applicant]
Portaneri et al., “Alpha Wrapping with an Offset,” ACM Trans. Graph., Jun. 2022, vol. 41, No. 4, 22 pages. [cited by applicant]
Provot, Xavier, “Collision and self-collision handling in cloth model dedicated to design garments,” Computer Animation and Simulation '97: Proceedings of the Eurographics Workshop in Budapest, Hungary, Sep. 2-3, 1997, … [cited by applicant]
Sacht et al., “Nested Cages,” ACM Trans. Graph., Nov. 2015, vol. 34, No. 6, Article 170, 14 pages. [cited by applicant]
Salinas et al., “Structure-aware mesh decimation,” Computer Graphics Forum, 2015, vol. 34, No. 6, pp. 211-227. [cited by applicant]
Schaefer et al., “Dual Marching Cubes: Primal Contouring of Dual Grids,” 12th Pacific Conference on Computer Graphics and Applications, IEEE, 2004, pp. 70-76. [cited by applicant]
Schaefer et al., “Manifold Dual Contouring,” IEEE Transactions on Visualization and Computer Graphics, May-Jun. 2007, vol. 13, No. 3, pp. 610-619. [cited by applicant]
Shen et al., “Deep Marching Tetrahedra: a Hybrid Representation for High-Resolution 3D Shape Synthesis,” 35th Conference on Neural Information Processing Systems (NeurIS 2021), Dec. 2021, pp. 6087-6101. [cited by applicant]
SimplyGon 9, Donya Labs AB, 2022. Retrieved from the Internet <URL:https://www.simplygon.com/Home/Index#sectionsolutions> 15 pages. [cited by applicant]
Unreal Engine 5, 2022, [retrieved from the Internet Mar. 12, 2023]. Retrieved from the Internet <URL:https://www.unrealengine.com/en-US/unrealengine-5>, 4 pages. [cited by applicant]
Van Den Bergen, Gino, “Efficient Collision Detection of Complex Deformable Models using AABB Trees,” Journal of Graphics Tools, 1997, vol. 2, Issue 4, 13 pages. [cited by applicant]
Vega et al., “A Fast and Memory-Saving Marching Cubes 33 Implementation with the Correct Interior Test,” Journal of Computer Graphics Techniques, 2019, vol. 8, No. 3, 18 pages. [cited by applicant]
Volino et al., “Efficient self-collision detection on smoothly discretized surface animations using geometrical shape regularity,” Computer Graphics Forum, 1994, vol. 13, No. 3, pp. 155-166. [cited by applicant]
Wang et al., “A Large Scale Benchmark and an Inclusion-Based Algorithm for Continuous Collision Detection,” ACM Trans. Graph., Sep. 2021, vol. 40, No. 5, Article 188, 16 pages. [cited by applicant]
Wang et al., “Accurate Self-Collision Detection Using Enhanced Dual-Cone Method,” Computers and Graphics, 2018, vol. 73, pp. 70-79. [cited by applicant]
Wang et al., “Efficient and Reliable Self-Collision Culling using Unprojected Normal Cones,” Computer Graphics Forum, 2017, vol. 36, No. 8, pp. 487-498. [cited by applicant]
Wei et al., “Approximate Convex Decomposition for 3D Meshes with Collision-Aware Concavity and Tree Search,” ACM Trans. Graph., Jul. 2022, vol. 41, No. 4, Article 42, 18 pages. [cited by applicant]
Wyvill et al., “Data structure for soft objects,” The Visual Computer, 1986, vol. 2, pp. 227-234. [cited by applicant]
Yang et al., “Unsupervised Learning for Cuboid Shape Abstraction via Joint Segmentation from Point Clouds,” ACM Trans. Graph., Aug. 2021, vol. 40, No. 4, Article 152, 11 pages. [cited by applicant]
Chen, et al. “Robust Low-Poly Meshing for General 3D Models.” ACM Trans. Graph., Available online at: < URL: https://zhenchen-jay.github.io/uploads/RobustLowPoly.pdf>, vol. 1, No. 1, Article 1, Jan. 2023, pp. 1-20. [cited by applicant]
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2023/074477, mailed on Jan. 25, 2024, 7 pages. [cited by applicant]
William E. Lorensen et al., “Marching Cubes: A High Resolution 3D Surface Construction Algorithm”, In Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH '87) . Associatio… [cited by applicant]
Leif P. Kobbelt et al., “Feature Sensitive Surface Extraction from Volume Data”, In Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH '01). Association for Computing Mac… [cited by applicant]
Tao Ju et al., “Dual Contouring of Hermite Data”. ACM Trans. Graph. 21, 3 (Jul. 2002), 339-346. (8 pages total). [cited by applicant]
S. Schaefer et al., “Dual marching cubes: Primal contouring of dual grids”, Proceedings—Pacific Conference on Computer Graphics and Applications, (7 pages total). [cited by applicant]
Josiah Manson et al., “Isosurfaces Over Simplicial Partitions of Multiresolution Grids”, Computer Graphics Forum 29, 2 (2010), 377-385, (9 pages total). [cited by applicant]
Lis Custodio et al., “Practical considerations on Marching Cubes 33 topological correctness”, Computers and Graphics 37, 7 (2013), 840-850, (12 pages total). [cited by applicant]
De Araújo et al., “A Survey on Implicit Surface Polygonization,” ACM Computer Surveys (CSUR), May 2015, vol. 47, No. 4, 39 pages. [cited by applicant]
Barill et al., “Fast winding Nos. for soups and clouds,” ACM Trans. Graph., 2018, vol. 37, No. 4, 12 pages. [cited by applicant]
Bauchet et al., “Kinetic Shape Reconstruction,” ACM Trans. Graph., 2020, vol. 39, No. 5, 14 pages. [cited by applicant]
Bronnimann et al., CGAL 5.5.1—2D and 3D Linear Geometry Kernel: User and Reference Manual, 2022. Retrieved from the Internet: <URL:https://doc.cgal.org/5.5.1/Manual/packages.html#PkgKernel23>, 27 pages. [cited by applicant]
Calderon et al., “Bounding Proxies for Shape Approximation,” ACM Trans. Graph., Jul. 2017, vol. 36, No. 4, 13 pages. [cited by applicant]
Chauve et al., “Robust Piecewise-Planar 3D Reconstruction and Completion from Large-Scale Unstructured Point Data,” 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2010, 8 pages. [cited by applicant]
Chen et al., “AUV-Net: Learning Aligned UV Maps for Texture Transfer and Synthesis,” Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2022, 99. 1465-1474. [cited by applicant]
Chen et al., “BSP-Net: Generating Compact Meshes via Binary Space Partitioning,” Proceedings of IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, 2020, pp. 45-54. [cited by applicant]
Chen et al., “Neural Dual Contouring,” ACM Trans. Graph., Jul. 2022, vol. 41, No. 4, 13 pages. [cited by applicant]
Chen et al., “Neural marching cubes,” ACM Trans. Graph., Dec. 2021, vol. 40, No. 6, 15 pages. [cited by applicant]
Chen et al., “On Visual Similarity Based 3D Model Retrieval,” Computer Graphics Forum, Sep. 2003, vol. 22, Issue 3, pp. 223-232. [cited by applicant]
Chernyaev, E.V., “Marching Cubes 33: Construction of Topologically Correct Isosurfaces,” Graphicon, Jul. 3-7, 1995, 9 pages. [cited by applicant]
Cignoni et al., “MeshLab: an Open-Source Mesh Processing Tool,” Scarano et al. [Ed], Eurographics Italian Chapter Conference, 2008, pp. 129-136. [cited by applicant]
Cignoni et al., “Metro: measuring error on simplified surfaces,” Computer Graphics Forum, 1992, vol. 17, No. 2, pp. 167-174. [cited by applicant]
Cohen-Steiner et al., “Variational shape approximation,” ACM Trans. Graph., vol. 23, No. 3, pp. 905-914. [cited by applicant]
Custodio et al., “Practical considerations on Marching Cubes 33 topological correctness,” Computers and Graphics, 2013, vol. 37, No. 7, pp. 840-850. [cited by applicant]
Diazzi et al., “Convex polyhedral meshing for robust solid modeling,” ACM Trans. Graph., Dec. 2021, vol. 40, No. 6, 16 pages. [cited by applicant]
Zhou et al., “Thingi10k: A Dataset of 10,000 3D-Printing Models,” arXiv:1605.04797v2, Jul. 2, 2016, 8 pages. [cited by applicant]
Durst, “Letters: additional reference to marching cubes,” Computer Graphics, 1988, vol. 22, Issue 5, p. 243. [cited by applicant]
Fang et al., “Connect-and-Slice: an hybrid approach for reconstructing 3D objects,” Proceedings of the IEEE/CVF Conference on Computer Vision and Patterns Recognition, 2020, pp. 13490-13498. [cited by applicant]
Fang et al., “Planar Shape Detection at Structural Scales,” 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE Computer Society, USA, 2018, pp. 2965-2973. [cited by applicant]
Gao et al., “Feature Preserving Octree-Based Hexahedral Meshing,” Computer Graphics Forum, 2019, vol. 38, pp. 135-149. [cited by applicant]
Gao et al., “Low-Poly Mesh Generation for Building Models,” ACM SIGGRAPH 2022 Conference Proceedings, Association for Computing Machinery, 2022, Article 3, 9 pages. [cited by applicant]
Garland et al., “Surface Simplification Using Quadric Error Metrics,” Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH '97), 1997, pp. 209-216. [cited by applicant]
Han et al., “Tight Normal Cone Merging for Efficient Collision Detection of Thin Deformable Objects,” Eurographics—Short Paper, 2021, pp. 49-52. [cited by applicant]
Hasselgren et al., “Appearance-Driven Automatic 3D Model Simplification,” Eurographics Symposium on Rendering, Apr. 8, 2021, 19 pages. [cited by applicant]
Heo et al., “FASTCD: Fracturing-Aware Stable Collision Detection,” Proc. of the ACM SIGGRAPH / Eurographics Symposium on Computer Animation, 2010, 10 pages. [cited by applicant]
Hoppe, Hugues, “New Quadric Metric for Simplifiying Meshes with Appearance Attributes,” Proceedings of the Conference on Visualization '99: Celebrating Ten Years, 1999, pp. 59-66. [cited by applicant]
Hoppe, Hugues, “Progressive Meshes,” Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH '96), 1996, pp. 99-108. [cited by applicant]
Hu et al., “Fast Tetrahedral Meshing in the Wild,” ACM Trans. Graph., Jul. 2020, vol. 39, No. 4, Article 117, 18 pages. [cited by applicant]
Hu et al., “Tetrahedral Meshing in the Wild,” ACM Trans. Graph., Aug. 2018, vol. 37, No. 4, Article 60, 14 pages. [cited by applicant]
Huang et al. “1-Based Construction of Polycube Maps from Complex Shapes,” ACM Trans. Graph., Jun. 2014, vol. 33, Issue 3, Article 25, 11 pages. [cited by applicant]
Huang et al., “ManifoldPlus: A Robust and Scalable Watertight Manifold Surface Generation Method for Triangle Soups,” May 2020, arXiv:2005.11621v1, 12 pages. [cited by applicant]
Hubbard, Philip M., “Interactive Collision Detection,” Proceedngs of 1993 IEEE Research Properties in Virtual Reality Symposium, IEEE, 1993, 8 pages. [cited by applicant]
IsoEx, Botsch, Mario, Jul. 8, 2015, [retrieved from the Internet Mar. 12, 2023]. Retrieved from the Internet <URL:https://www.graphics.rwth-aachen.de/IsoEx/>, 1 page. [cited by applicant]
Jacobson et al., “Iibigl—A simple C++ geometry processing library,” Iibigl, 2018, 8 pages. [cited by applicant]
Jiang et al., “Bijective Projection in a Shell,” ACM Trans. Graph., 2020, vol. 39, Issue 6, Article 247, 18 pages. [cited by applicant]
Ju et al., “Dual contouring of hermite data,” ACM Trans. Graph., Jul. 2001, vol. 21, Issue 3, pp. 339-346. [cited by applicant]
Ju et al., “Intersection-free Contouring on An Octree Grid,” Proceedings of Pacific Graphics, 2006, vol. 2006, 8 pages. [cited by applicant]
Karras, Tero, “Maximizing Parallelism in the Construction of BVHs, Octrees, and k-d Trees,” Proceedings of the Fourth ACM SIGGRAPH/Eurographics Conference on High-Performance Graphics (EGGH-HPG'12), 2012, pp. 33-37. [cited by applicant]
Kelly et al., “BigSUR: large-scale structured urban reconstruction,” ACM Trans. Graph., Nov. 2017, vol. 36, Issue 6, Article 204, 17 pages. [cited by applicant]
Khan et al., “Surface Remeshing: A Systematic Literature Review of Methods and Research Directions,” IEEE Trans. On Vis. And Comp. Graph., Aug. 14, 2020, 31 pages. [cited by applicant]
Kobbelt et al., “Feature sensitive surface extraction from vol. data,” Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, Aug. 2001, pp. 57-66. [cited by applicant]
Laine et al., “Modular Primitives for High-Performance Differentiable Rendering,” ACM Trans. Graph., Dec. 2020, vol. 39, Issue 6, Article 194, arXiv.2011.03277v1, 14 pages. [cited by applicant]
Lescoat et al., “Spectral Mesh Simplification,” Computer Graphics Forum, 2020, vol. 39, No. 2, pp. 315-324. [cited by applicant]
Lewiner et al., “Efficient Implementation of Marchings Cubes' Cases with Topological Guarantees,” Journal of Graphics Tools, 2003, vol. 8, Issue 2, 11 pages. [cited by applicant]
Li et al., “Feature-preserving 3D mesh simplification for urban buildings,” ISPRS Journal of Photogrammetry and Remote Sensing, 2021, vol. 173, pp. 135-150. [cited by applicant]
Liao et al., “Deep Marching Cubes: Learning Explicit Surface Representations,” 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2018, pp. 2916-2925. [cited by applicant]
Lindstrom et al., “Fast and Memory Efficient Polygonal Simplification,” Proceedings of the Conference on Visualization '98, IEEE, 1998, pp. 279-286. [cited by applicant]
Lindstrom et al., “Image-Driven Simplification,” ACM Trans. Graph., Jul. 2000, vol. 19, No. 3, pp. 204-241. [cited by applicant]