Filling Holes in Meshes
By P. Liepa. Eurographics Symposium on Geometry Processing, 2003
430 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/d8a45bce2730f12924b9fc6db7fc013089fd3ce6
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Vladlen Koltun
- Abhinav Kumar Gupta
- Kristen Grauman
- Jitendra Malik
- Trevor Darrell
- Yoshua Bengio
- Dhruv Batra
- Dacheng Tao
Citations in the corpus
- MeshLab: an Open-Source Mesh Processing Tool (2008, methodology): “Thy applies a variant of the algorithm presented in [Lie03], with various different heuristics for choosing the Figure 4 shows the combined application of the techniques here described, large outliers and dangerous borders c© The Eurographics Association 2008.”
- Robust repair of polygonal models (2004, methodology): “Recently, Liepa [Liepa 2003] applies mesh fairing after hole triangulation so that the patch interpolates the shape and density of the surrounding mesh.”
- SCAPE: shape completion and animation of people (2005, background): “A common way to complete these holes is to fill them with a smooth surface patch that meets the boundary conditions of the hole [Curless and Levoy 1996; Davis et al. 2002; Liepa 2003].”
- Matching 2.5D face scans to 3D models (2006, methodology): “All the techniques used in the model construction procedures are well-studied in the computer graphics and vision research communities [24], [25], [26], [27].”
- The Replica Dataset: A Digital Replica of Indoor Spaces (2019, methodology): “A human annotator can then use our tool to select a hole and automatically fill it using the approach described by Liepa [18].”
- Reconstruction of textureless regions using structure from motion and image-based interpolation (2014, unknown): “The method described in [21] failed to fill the hole in our synthetic model, so we instead compare against Poisson reconstruction [10] and VCG Surface Reconstruction [20].”