A robust hole-filling algorithm for triangular mesh
By Wei Zhao, Shuming Gao, Hongwei Lin. 2007
258 citations recorded by the source corpus.
Subfields: Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Graphics and Computer-Aided Design
- Matthias Nießner
- Angela Dai
- Andrew Markham
- Bo Yang
- Agathoniki Trigoni
- Hongkai Wen
- Charles Ruizhongtai Qi
- Christoph Mertz
In Computer Vision and Pattern Recognition
- Luc Van Gool
- Andrea Vedaldi
- Jitendra Malik
- Matthias Nießner
- Trevor Darrell
- Dacheng Tao
- Xiaogang Wang
- Ming-Hsuan Yang
Citations in the corpus
- Shape Completion Using 3D-Encoder-Predictor CNNs and Shape Synthesis (2016, methodology): “In particular, filling in small holes has received much attention; for instance, one could fit in local surface primitives, such as planes or quadrics, or address the problem with a continuous energy minimization; e.g., with Laplacian smoothing [38, 25, 47].”
- 3D Object Dense Reconstruction from a Single Depth View (2018, methodology): “Traditional reconstruction approaches typically use interpolation techniques such as plane fitting, Laplacian hole filling [6] [7], or Poisson surface estimation [8] [9] to infer the underlying 3D structure.”
- PCN: Point Completion Network (2018, methodology): “For example, surface reconstruction methods [3, 10, 32, 40, 48, 53, 61] generate smooth interpolations to fill holes in locally incomplete scans.”
- ScanComplete: Large-Scale Scene Completion and Semantic Segmentation for 3D Scans (2017, methodology): “Traditional methods typically focus on filling small holes by fitting local surface primitives such planes or quadrics, or by using a continuous energy minimization [35, 20, 43].”