2018
DOI: 10.3997/2214-4609.201801235
|View full text |Cite
|
Sign up to set email alerts
|

Implicit Structural Modeling with Local Meshless Functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 0 publications
0
4
0
Order By: Relevance
“…Optimization methods have been proposed (Greengard and Rokhlin, 1987, e.g., the fast multipole approach originally introduced by). A recent alternative has also been proposed by Renaudeau et al (2018) using an intermediate set of points which bear local moving least squares basis functions. The overall system becomes sparse, as the basis functions have a local support, but the continuity of the solution is maintained.…”
Section: Full 3-d Modeling Approaches: Implicitmentioning
confidence: 99%
See 1 more Smart Citation
“…Optimization methods have been proposed (Greengard and Rokhlin, 1987, e.g., the fast multipole approach originally introduced by). A recent alternative has also been proposed by Renaudeau et al (2018) using an intermediate set of points which bear local moving least squares basis functions. The overall system becomes sparse, as the basis functions have a local support, but the continuity of the solution is maintained.…”
Section: Full 3-d Modeling Approaches: Implicitmentioning
confidence: 99%
“…(Caumon et al, 2013a;Collon-Drouaillet et al, 2015;Collon et al, 2016). Alternatively, in the case where enough data are available for the problem to be well posed, the increment of the scalar field can be estimated as differences to some reference value (Lajaunie et al, 1997;Chilès et al, 2004;Calcagno et al, 2008;De la Varga et al, 2018;Renaudeau et al, 2018).…”
Section: Full 3-d Modeling Approaches: Implicitmentioning
confidence: 99%
“…In practice, this factor may take different forms depending on the chosen domain discretisation scheme [4], [8], [14]. Instead, another approach is to find a continuous operator based on physical arguments, and then discretise it accordingly [13], [15]. An advantage of the latter is that it naturally provides appropriate weights to use during the least square's optimization stage, making the solution less sensitive to the resolution of the discretisation scheme.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, the proposed implicit method penalizes data constraints by the continuous bending energy, as in [13] and [15]. This problem is discretised on the Cartesian grid, using a piecewise bilinear evaluation on data terms and a finite difference approximation of energy terms, which gives a final linear system to solve close to [14], but with volumetric weights obtained from the discretisation.…”
Section: Introductionmentioning
confidence: 99%