![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Sigurd B. Angenent
Person information
- affiliation: University of Wisconsin, Madison, Mathematics Department, USA
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j10]Sigurd B. Angenent:
Formal asymptotic expansions for symmetric ancient ovals in mean curvature flow. Networks Heterog. Media 8(1): 1-8 (2013) - 2011
- [j9]Alexandra Jilkine, Sigurd B. Angenent, Lani F. Wu, Steven J. Altschuler:
A Density-Dependent Switch Drives Stochastic Clustering and Polarization of Signaling Molecules. PLoS Comput. Biol. 7(11) (2011)
2000 – 2009
- 2009
- [j8]Sigurd B. Angenent, Josephus Hulshof, H. Matano:
The Radius of Vanishing Bubbles in Equivariant Harmonic Map Flow from D2 to S2. SIAM J. Math. Anal. 41(3): 1121-1137 (2009) - 2008
- [j7]John Melonakos, Eric Pichon
, Sigurd B. Angenent, Allen R. Tannenbaum:
Finsler Active Contours. IEEE Trans. Pattern Anal. Mach. Intell. 30(3): 412-423 (2008) - [p2]Ayelet Dominitz, Sigurd B. Angenent, Allen R. Tannenbaum:
On the Computation of Optimal Transport Maps Using Gradient Flows and Multiresolution Analysis. Recent Advances in Learning and Control 2008: 65-78 - 2006
- [j6]Marc Niethammer, Allen R. Tannenbaum, Sigurd B. Angenent:
Dynamic active contours for visual tracking. IEEE Trans. Autom. Control. 51(4): 562-579 (2006) - [p1]Sigurd B. Angenent, Allen R. Tannenbaum, Anthony J. Yezzi, Ofer Zeitouni:
Curve Shortening and Interacting Particle Systems. Statistics and Analysis of Shapes 2006: 303-311 - 2004
- [j5]Steven Haker, Lei Zhu, Allen R. Tannenbaum, Sigurd B. Angenent:
Optimal Mass Transport for Registration and Warping. Int. J. Comput. Vis. 60(3): 225-240 (2004) - 2003
- [j4]Sigurd B. Angenent, Steven Haker, Allen R. Tannenbaum:
Minimizing Flows for the Monge-Kantorovich Problem. SIAM J. Math. Anal. 35(1): 61-97 (2003) - 2000
- [j3]Steven Haker, Sigurd B. Angenent, Allen R. Tannenbaum, Ron Kikinis:
Nondistorting Flattening Maps and the 3D Visualization of Colon CT Images. IEEE Trans. Medical Imaging 19(7): 665-670 (2000) - [j2]Steven Haker, Sigurd B. Angenent, Allen R. Tannenbaum, Ron Kikinis, Guillermo Sapiro, Michael Halle:
Conformal Surface Parameterization for Texture Mapping. IEEE Trans. Vis. Comput. Graph. 6(2): 181-189 (2000) - [c2]Steven Haker, Sigurd B. Angenent, Allen R. Tannenbaum, Ron Kikinis:
Non-distorting Flattening for Virtual Colonoscopy. MICCAI 2000: 358-366
1990 – 1999
- 1999
- [j1]Sigurd B. Angenent, Steven Haker, Allen R. Tannenbaum, Ron Kikinis:
On the Laplace-Beltrami Operator and Brain Surface Flattening. IEEE Trans. Medical Imaging 18(8): 700-711 (1999) - [c1]Sigurd B. Angenent, Steven Haker, Allen R. Tannenbaum, Ron Kikinis:
Conformal Geometry and Brain Flattening. MICCAI 1999: 271-278
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint