Mesh-Independent Surface Interpolation
By David Levin. 2004
564 citations recorded by the source corpus.
Subfields: Computational Mechanics, Computer Graphics and Computer-Aided Design
View Paper: https://www.semanticscholar.org/paper/4c3cb1a2347d6ca4571a7e8c406d66996724863a
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
- Daniel Cohen-Or
- Markus H. Gross
- Leif Kobbelt
- Mark Pauly
- Gaël Guennebaud
- Cláudio T. Silva
- Olga Sorkine-Hornung
- Marc Alexa
In Computer Graphics and Computer-Aided Design
- Daniel Cohen-Or
- Markus H. Gross
- Leif Kobbelt
- Mark Pauly
- Gaël Guennebaud
- Cláudio T. Silva
- Olga Sorkine-Hornung
- Marc Alexa
Citations in the corpus
- Anisotropic smoothing of point sets, (2005, methodology): “We therefore do not use the higher order approximation proposed in the second step of the projection procedure of [ 7 ] and [1].”
- Sparse low-degree implicit surfaces with applications to high quality rendering, feature extraction, and smoothing (2005, background): “03, OBS04b], and MLS surfaces [Lev04, ABCO (cid”
- Computing and Rendering Point Set Surfaces (2003, methodology): “Using this simple scheme, Linsen proposes a variety of operations for point clouds, including rendering, smoothing, and some modeling operations.”
- Phase-field modeling of fracture in linear thin shells (2014, unknown): “As noted in [41], a fundamental difficulty in defining basis functions and performing calculations on a surface, as compared to open sub-sets in Euclidean space, is the absence in general of a single parametric domain.”
- Feature Preserving Point Set Surfaces based on Non‐Linear Kernel Regression (2009, methodology): “Its extension to the reconstruction of manifolds has been pioneered by Levin [Lev03] and introduced to computer graphics by Alexa et al. [ABCO ∗ 03].”
- Point-based multiscale surface representation (2006, methodology): “Meshless methods have become increasingly popular for defining a smooth surface from a set of point samples [Levin 2003; Alexa et al. 2001; Fleishman et al. 2003; Adamson and Alexa 2003, 2004; Amenta and Kil 2004].”
- Algebraic point set surfaces (2007, methodology): “The initial definition is based on the stationary set of Levin’s moving least squares (MLS) projection operator [Levin 2003].”
- IMLS-SLAM: Scan-to-Model Matching Based on 3D Data (2018, background): “In [14], Levin is the first to define a”
- Learning Sets with Separating Kernels (2012, background): “The goal in this case is to find a smooth function f that gives the Cartesian equation of the hyper-surface, see for example [42, 37, 38].”
- Efficient simplification of point-sampled surfaces (2002, background): “The projection of onto is then given as (for more details see [17, 1]).”
- Robust and Efficient Surface Reconstruction From Range Data (2009, methodology): “A related but different method is the projection-based MLS of [Lev03], where the surface is sought as the fixed point of a parametric fit procedure.”
- Learning-by-Synthesis for Appearance-Based 3D Gaze Estimation (2014, methodology): “The reconstructed 3D point cloud is further processed by using statistical outlier removal [27] and moving least squares smoothing [18], and a cuboid region (16 cm × 8 cm × 6 cm of the eye region) predefined in the head coordinate system is cropped.”