2005
DOI: 10.1016/j.jcp.2004.10.005
|View full text |Cite
|
Sign up to set email alerts
|

A topology-preserving level set method for shape optimization

Abstract: The classical level set method, which represents the boundary of the unknown geometry as the zero-level set of a function, has been shown to be very effective in solving shape optimization problems. The present work addresses the issue of using a level set representation when there are simple geometrical and topological constraints. We propose a logarithmic barrier penalty which acts to enforce the constraints, leading to an approximate solution to shape design problems.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
36
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 55 publications
(36 citation statements)
references
References 10 publications
0
36
0
Order By: Relevance
“…For an implicitly represented surface, the dynamics of the surface are determined by the evolution of the embedding function and admit a convenient description of topologically complex interfaces (Osher and Fedkiw, 2003). LSM is quite simple to implement in a wide range of applications involving dynamic surfaces and curves such as shape optimization (Alexandrov and Santosa, 2005) and incompressible two-phase flow (Sussman et al, 1998;Sussman and Fatemi, 1999; Kaliakatsos and Tsangaris, 2000). The time-dependent LSM algorithms for externally generated velocity fields are treated as numerical algorithms for Hamilton-Jacobi equations.…”
Section: Introductionmentioning
confidence: 99%
“…For an implicitly represented surface, the dynamics of the surface are determined by the evolution of the embedding function and admit a convenient description of topologically complex interfaces (Osher and Fedkiw, 2003). LSM is quite simple to implement in a wide range of applications involving dynamic surfaces and curves such as shape optimization (Alexandrov and Santosa, 2005) and incompressible two-phase flow (Sussman et al, 1998;Sussman and Fatemi, 1999; Kaliakatsos and Tsangaris, 2000). The time-dependent LSM algorithms for externally generated velocity fields are treated as numerical algorithms for Hamilton-Jacobi equations.…”
Section: Introductionmentioning
confidence: 99%
“…Among the family of topology constrained front propagation methods [35,5,174,105,78,157], the works in [78] and in [157] rely on simple points [13,90,14], that is, points such that their addition or removal to the component will not change the topology of the image. They start from initial seeds distributed in the areas of interest in the space of the image, and then modify these components by adding or removing simple points.…”
Section: Front Propagation and Well-composed Segmentationsmentioning
confidence: 99%
“…2) Work of Alexandrov and Santosa: Our work is also much motivated by the interesting work [1], which is a curve evolution method based on level sets for shape optimization problems arising in material science. The signed-distance function is used, and their proposed method avoids overlaps of the narrow band of the evolving contour.…”
Section: ) Work Of Han Et Almentioning
confidence: 99%
“…Their method, like ours, is a variational one, but it has not been proposed for image segmentation. Only artificial tests of shape optimization illustrate their point in [1]. In the case of a shape optimization problem, their model minimizes , with , where is a general shape optimization functional and is the topology constraint term defined by where and , are given parameters.…”
Section: ) Work Of Han Et Almentioning
confidence: 99%
See 1 more Smart Citation