Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Surface Reconstruction Using Rotation Systems (2402.01893v2)

Published 2 Feb 2024 in cs.CG and cs.GR

Abstract: Inspired by the seminal result that a graph and an associated rotation system uniquely determine the topology of a closed manifold, we propose a combinatorial method for reconstruction of surfaces from points. Our method constructs a spanning tree and a rotation system. Since the tree is trivially a planar graph, its rotation system determines a genus zero surface with a single face which we proceed to incrementally refine by inserting edges to split faces and thus merging them. In order to raise the genus, special handles are added by inserting edges between different faces and thus merging them. We apply our method to a wide range of input point clouds in order to investigate its effectiveness, and we compare our method to several other surface reconstruction methods. We find that our method offers better control over outlier classification, i.e. which points to include in the reconstructed surface, and also more control over the topology of the reconstructed surface.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (35)
  1. Ergun Akleman and Jianer Chen. 1999. Guaranteeing the 2-Manifold Property for Meshes with Doubly Linked Face List. International Journal of Shape Modeling 05, 02 (1999), 159–177. https://doi.org/10.1142/S0218654399000150
  2. A minimal and complete set of operators for the development of robust manifold mesh modelers. Graphical Models 65, 5 (2003), 286–304. https://doi.org/10.1016/S1524-0703(03)00047-X Special Issue on SMI 2002.
  3. A new Voronoi-based surface reconstruction algorithm. In Proceedings of the 25th annual conference on Computer graphics and interactive techniques. 415–421.
  4. A simple algorithm for homeomorphic surface reconstruction. In Proceedings of the sixteenth annual symposium on Computational geometry. 213–222.
  5. The power crust. In Proceedings of the sixth ACM symposium on Solid modeling and applications. 249–266.
  6. 3d semantic parsing of large-scale indoor spaces. In Proceedings of the IEEE conference on computer vision and pattern recognition. 1534–1543.
  7. A survey of surface reconstruction from point clouds. 36, 1 (2017), 301–329.
  8. The ball-pivoting algorithm for surface reconstruction. IEEE transactions on visualization and computer graphics 5, 4 (1999), 349–359.
  9. Jean-Daniel Boissonnat. 1984. Geometric structures for three-dimensional shape representation. ACM Transactions on Graphics (TOG) 3, 4 (1984), 266–286.
  10. Dobrina Boltcheva and Bruno Lévy. 2017. Surface reconstruction by computing restricted voronoi cells in parallel. Computer-Aided Design 90 (2017), 123–134.
  11. Frédéric Cazals and Joachim Giesen. 2004. Delaunay Triangulation Based Surface Reconstruction: Ideas and Algorithms. Technical Report RR-5393. INRIA. 42 pages. https://inria.hal.science/inria-00070610
  12. Brian Curless and Marc Levoy. 1996. A volumetric method for building complex models from range images. In Proceedings of the 23rd annual conference on Computer graphics and interactive techniques. 303–312.
  13. Scale space meshing of raw data point sets. 30, 6 (2011), 1630–1642.
  14. Herbert Edelsbrunner. 2003. Surface Reconstruction by Wrapping Finite Sets in Space. Springer Berlin Heidelberg, Berlin, Heidelberg, 379–404. https://doi.org/10.1007/978-3-642-55566-4_17
  15. John Robert Edmonds Jr. 1960. A Combinatorial Representation for Oriented Polyhedral Surfaces. Master of Arts. University of Maryland.
  16. Deep-Learning-Based 3-D Surface Reconstruction—A Survey. Proc. IEEE 111, 11 (2023), 1464–1501. https://doi.org/10.1109/JPROC.2023.3321433
  17. An Algorithm for Finding Best Matches in Logarithmic Expected Time. ACM Trans. Math. Softw. 3, 3 (sep 1977), 209–226. https://doi.org/10.1145/355744.355745
  18. Monika R. Henzinger and Valerie King. 1999. Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation. J. ACM 46, 4 (jul 1999), 502–516. https://doi.org/10.1145/320211.320215
  19. Surface reconstruction from unorganized points. In Proceedings of the 19th annual conference on computer graphics and interactive techniques. 71–78.
  20. Large scale multi-view stereopsis evaluation. In Proceedings of the IEEE conference on computer vision and pattern recognition. 406–413.
  21. Poisson surface reconstruction with envelope constraints. Computer Graphics Forum 39, 5 (2020), 173–182.
  22. Michael Kazhdan and Hugues Hoppe. 2013. Screened poisson surface reconstruction. ACM Transactions on Graphics (ToG) 32, 3 (2013), 1–13.
  23. Poisson Surface Reconstruction. In Proceedings of the Fourth Eurographics Symposium on Geometry Processing (Cagliari, Sardinia, Italy) (SGP ’06, Vol. 256), Alla Sheffer and Konrad Polthier (Eds.). Eurographics Association, Aire-la-Ville, Switzerland, Switzerland, 61–70.
  24. Saunders MacLane. 1937. A combinatorial condition for planar graphs. Fundamenta Mathematicae 28 (1937), 22–32.
  25. Martti Mantyla and Reijo Sulonen. 1982. GWB: A solid modeler with Euler operators. IEEE Computer Graphics and Applications 2, 7 (1982), 17–31.
  26. Robert Mencl. 1995. A Graph-Based Approach to Surface Reconstruction. 14, 3 (1995), 445–456.
  27. Robert Mencl and Heinrich Müller. 2004. Empirical Analysis of Surface Interpolation by Spatial Environment Graphs. In Geometric Modeling for Scientific Visualization, Guido Brunnett, Bernd Hamann, Heinrich Müller, and Lars Linsen (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 51–65.
  28. Robert Mencl and Heinrich Müller. 1998. Graph-Based Surface Reconstruction Using Structures in Scattered Point Sets. In Proceedings - Computer Graphics International. 298–311. https://doi.org/10.1109/CGI.1998.694281
  29. L-systems: from the theory to visual models of plants. In Proceedings of the 2nd CSIRO Symposium on Computational Challenges in Life Sciences, Vol. 3. Citeseer, 1–32.
  30. Nicholas Sharp and Maks Ovsjanikov. 2020. ”PointTriNet: Learned Triangulation of 3D Point Sets”. In Proceedings of the European Conference on Computer Vision (ECCV).
  31. Scalable Surface Reconstruction with Delaunay-Graph Neural Networks. Computer Graphics Forum 40, 5 (2021), 157–167. https://doi.org/10.1111/cgf.14364 arXiv:https://onlinelibrary.wiley.com/doi/pdf/10.1111/cgf.14364
  32. Restricted Delaunay Triangulation for Explicit Surface Reconstruction. ACM Transactions on Graphics 41, 5, Article 180 (oct 2022), 20 pages. https://doi.org/10.1145/3533768
  33. Variational Shape Reconstruction via Quadric Error Metrics. In ACM SIGGRAPH 2023 Conference Proceedings (Los Angeles, CA, USA) (SIGGRAPH ’23). Association for Computing Machinery, New York, NY, USA, Article 45, 10 pages. https://doi.org/10.1145/3588432.3591529
  34. Bilateral Normal Filtering for Mesh Denoising. IEEE Transactions on Visualization and Computer Graphics 17, 10 (2011), 1521–1530. https://doi.org/10.1109/TVCG.2010.264
  35. Qingnan Zhou and Alec Jacobson. 2016. Thingi10K: A Dataset of 10,000 3D-Printing Models. arXiv preprint arXiv:1605.04797 (2016).

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now