Titlebook: Numerical Geometry, Grid Generation and Scientific Computing; Proceedings of the 9 Vladimir A. Garanzha,Lennard Kamenski,Hang Si Conference

CLEAR

Jürgen Fuhrmann,Clemens Guhlke,Alexander Linke,Christian Merdon,Rüdiger Müller

overrule

頂點

手術(shù)刀

Lecture Notes in Computational Science and Engineeringhttp://image.papertrans.cn/n/image/668996.jpg

Default

https://doi.org/10.1007/978-3-030-23436-2numerical geometry; mesh generation; mesh adaptation; finite volume method; variational principle; iterat

single

978-3-030-23438-6Springer Nature Switzerland AG 2019

很是迷惑

Numerical Geometry, Grid Generation and Scientific Computing978-3-030-23436-2Series ISSN 1439-7358 Series E-ISSN 2197-7100

隱語

A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner PointsWe describe a simple algorithm to triangulate a special class of 3d non-convex polyhedra without Steiner points (vertices which are not the vertices of the given polyhedron). We prove sufficient conditions for the termination of this algorithm, and show that it runs in .(..) time, where . is the number of input vertices.

成份

邪惡的你

A Variational Method for Accurate Distance Function EstimationVariational problems for accurate approximation of the distance from the boundary of a domain are studied. It is demonstrated that the problems can be efficiently solved by ADMM. Advantages of the proposed distance function estimation methods are demonstrated by numerical experiments.