Interpolating and approximating implicit surfaces from polygon soup
By Chen Shen, James F. O'Brien, Jonathan Richard Shewchuk. SIGGRAPH Courses, 2004
378 citations recorded by the source corpus.
Subfields: Computational Mechanics, Computer Graphics and Computer-Aided Design
View Paper: https://www.semanticscholar.org/paper/9a658b4d669bc0b58929c7e9afd90feab35331f0
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mechanics
- Leonidas J. Guibas
- Siddhartha Chaudhuri
- Vladlen Koltun
- Evangelos Kalogerakis
- Andrea Tagliasacchi
- Daniel Cohen-Or
- Thomas A. Funkhouser
- Andreas Geiger
In Computer Graphics and Computer-Aided Design
- Leonidas J. Guibas
- Andrea Tagliasacchi
- Pierre Alliez
- Siddhartha Chaudhuri
- Evangelos Kalogerakis
- Vladlen Koltun
- Markus H. Gross
- Matthias Nießner
Citations in the corpus
- Probabilistic reasoning for assembly-based 3D modeling (2011, background): “Sketch-based shape manipulation algorithms can be integrated to support editing of individual components [Nealen et al. 2005] and careful meshing techniques can yield structurally sound models that can be fabricated in physical form [Shen et al. 2004].”
- A Survey of Surface Reconstruction from Point Clouds (2017, background): “…variant called Implicit MLS (IMLS), constructs the implicit field as the weighted average of distances between x and the prescribed tangent planes [SOS04]: As seen in figure Figure 4c, the summation done with IMLS tends to expand/shrink the surface away from the input points, especially for large…”
- Animating sand as a fluid (2005, methodology): “adapting an MLS approach such as in Shen et al.[ 48 ], we could do the surface”
- Sparse low-degree implicit surfaces with applications to high quality rendering, feature extraction, and smoothing (2005, neutral): “01, AK04, SOS04], and point splatting [PZ (cid”
- Scale Space Meshing of Raw Data Point Sets (2011, methodology): “Interpolating point set surfaces can be achieved by using a singular weighting function ([OGG09], [AA09], [SOS04]), but using the marching cubes to extract the iso-surface looses anyway the input point positions.”
- 1 An End-to-End Framework for Evaluating Surface Reconstruction (2011, methodology): “Namely we create smooth and piecewise-smooth implicit surfaces by approximating triangulated surface meshes, or more generally polygon soup, through weight functions integrated over polygons.”
- Parallel Poisson Surface Reconstruction (2009, methodology): “For function continuity, the influence of several nearby points can be blended together, for instance using moving least squares [15, 16].”
- Algebraic point set surfaces (2007, methodology): “Interpolation can be achieved using functions with a singularity at zero, see [Shen et al. 2004; Adamson and Alexa 2006b].”