Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science (2nd edition)
By Alex M. Andrew. 2000
2,378 citations recorded by the source corpus.
Subfields: Computer Graphics and Computer-Aided Design
View Paper: https://www.semanticscholar.org/paper/461ef93cb729592ff2742bcf4eeeac551bee832c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Graphics and Computer-Aided Design
- Michael Y. Wang
- Peng Wei
- Grégoire Allaire
- Stanley J. Osher
- François Jouve
- Peter D. Dunning
- Xiaoming Wang
- H. A. Kim
Citations in the corpus
- Alpha-beta and gamma rhythms subserve feedback and feedforward influences among human visual cortical areas (2016, positive): “D) For this investigation, each hemisphere was randomly segmented into 400 parcels according to the fast marching algorithm (Sethian, 1999).”
- Design of three dimensional isotropic microstructures for maximized stiffness and conductivity (2007, methodology): “The Hamilton–Jacobi evolution equation is solved via a standard upwind scheme and the time–step for the numerical evolution must be less than that given by the Courant–Friedrichs–Lewy (CFL) condition to ensure numerical stability (Sethian, 1999).”
- An extended stochastic finite element method for solving stochastic partial differential equations on random domains (2008, methodology): “1 Random level-sets Here, we represent the random geometry in an implicit manner using the levelset technique [18].”
- A level set method for structural topology optimization and its applications (2004, methodology): “The level set method is firstly introduced into the structural topology optimization by Sethian and Wiegmann [23].”
- Variable Selection (2019, methodology): “Furthermore, they are intensively used in the level set framework where the curves and the surfaces are represented by their signed distance functions [17, 22].”
- Manga colorization (2006, methodology): “The geometric level set method, proposed by Osher and Sethian, is a zero surface method [Osher and Sethian 1988; Sethian 1996; Sethian 1999].”
- Ordered Upwind Methods for Static Hamilton-Jacobi Equations: Theory and Algorithms (2003, methodology): “A criterion based on this observation was introduced by Sethian in [36] as follows.”
- Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction (2010, methodology): “One of the most simple and versatile schemes is the level set method of Osher and Sethian [36, 37, 41].”
- Isogeometric Shape Optimization of Vibrating Membranes (2011, methodology): “Such problems are often treated by parametrizing the shape indirectly, using for example the coefficients of the partial differential equation governing an engineering model under consideration (control in the coefficients, homogenization, or topology optimization approaches, see [3, 4]) or auxiliar”
- A discontinuous‐Galerkin‐based immersed boundary method (2008, methodology): “It can be either explicit, with numerical particles distributed over the boundary to determine its location[75, 73, 63], or implicit, defined by a volumetric quantity such as a volume-of-fluid field (as in VOF methods [32, 57, 56, 25]) or as a level set function (as in level-set methods [52, 59, 60,”
- Shape and topology optimization of the robust compliance via the level set method (2008, methodology): “We do not describe the level set theory here, and refer to [18, 21] or [4] for an extensive explanation of this method applied to shape optimization.”
- Damage growth modeling using the Thick Level Set (TLS) approach: Efficient discretization for quasi-static loadings (2012, positive): “Therefore, it is mandatory to guarantee that the level set remains a signed distance function though some ‘‘re-initialization’’ process [34].”
- Geometric constraints for shape and topology optimization in architectural design (2017, methodology): “, on a Cartesian grid of a large computational box D, with an explicit second order upwind scheme [56], or on a simplicial mesh of D (i.”