Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Edelsbrunner, Herbert"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions
Herbert Edelsbrunner
,
Brittany Terese Fasy
,
Günter Rote
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 91-100
Alexander duality for functions: The persistent behavior of land and water and shore
Herbert Edelsbrunner
,
Michael Kerber
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 249-258
Persistent homology under non-uniform error
Paul Bendich
,
Herbert Edelsbrunner
,
Michael Kerber
,
Amit Patel
Lecture Notes in Computer Science
6281
, 2010, pp. 12-23
The robustness of level sets
Paul Bendich
,
Herbert Edelsbrunner
,
Dmitriy Morozov
,
Amit Patel
Lecture Notes in Computer Science
6346
, 2010, pp. 1-10
Alpha-beta witness complexes
Dominique Attali
,
Herbert Edelsbrunner
,
John Harer
,
Yuriy Mileyko
Lecture Notes in Computer Science
4619
, 2007, pp. 386-397
Interface surfaces for protein-protein complexes
Yih-En Andrew Ban
,
Herbert Edelsbrunner
,
Johannes Rudolph
Journal of the ACM
53
(3), 2006, pp. 361-378
Interface surfaces for protein-protein complexes
Yih-En Andrew Ban
,
Herbert Edelsbrunner
,
Johannes Rudolph
Proceedings of the 8th Annual International Conference on Research in Computational Molecular Biology, RECOMB'2004 (San Diego, CA, USA, March 27-31, 2004)
, 2004, pp. 205-212
Sink insertion for mesh improvement
Herbert Edelsbrunner
,
Damrong Guoy
International Journal of Foundations of Computer Science
13
(2), 2002, pp. 223-242
Silver exudation
Siu-Wing Cheng
,
Tamal K. Dey
,
Herbert Edelsbrunner
,
Michael A. Facello
,
Shang-Hua Teng
Journal of the ACM
47
(5), 2000, pp. 883-904
Smoothing and cleaning up slivers
Herbert Edelsbrunner
,
Xiang-Yang Li
,
Gary Miller
,
Andreas Stathopoulos
,
Dafna Talmor
,
Shang-Hua Teng
,
Alper Üngör
,
Noel Walkington
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 273-277
On the definition and the construction of pockets in macromolecules
Herbert Edelsbrunner
,
Michael Facello
,
Jie Liang
Discrete Applied Mathematics
88
(1-3), 1998, pp. 83-102
Shape reconstruction with Delaunay complex
Herbert Edelsbrunner
Lecture Notes in Computer Science
1380
, 1998, pp. 119-132
Triangulating the surface of a molecule
Nataraj Akkiraju
,
Herbert Edelsbrunner
Discrete Applied Mathematics
71
(1-3), 1996, pp. 5-22
Measuring proteins and voids in proteins
Herbert Edelsbrunner
,
Michael Facello
,
Ping Fu
,
Jie Liang
Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences, HICSS-28. Vol.~V: Biotechnology Computing (Kihei, Hawaii, January 3-6, 1995)
, 1995, pp. 256-264
Algebraic decomposition of non-convex polyhedra
Herbert Edelsbrunner
Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995)
, 1995, pp. 248-257
Smooth surfaces for multi-scale shape representation
Herbert Edelsbrunner
Lecture Notes in Computer Science
1026
, 1995, pp. 391-412
Selecting heavily covered points
Bernard Chazelle
,
Herbert Edelsbrunner
,
Leonidas J. Guibas
,
John E. Hershberger
,
Raimund Seidel
,
Micha Sharir
SIAM Journal on Computing
23
(6), 1994, pp. 1138-1151
Algorithms for bichromatic line-segment problems and polyhedral terrains
Bernard Chazelle
,
Herbert Edelsbrunner
,
Leonidas J. Guibas
,
Micha Sharir
Algorithmica
11
, 1994, pp. 116-132
Improved bounds on weak
\epsilon
-nets for convex sets
Bernard Chazelle
,
Herbert Edelsbrunner
,
Michelangelo Grigni
,
Leonidas Guibas
,
Micha Sharir
,
Emo Welzl
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 495-504
Computing a face in an arrangement of line segments and related problems
Bernard Chazelle
,
Herbert Edelsbrunner
,
Leonidas Guibas
,
Micha Sharir
,
Jack Snoeyink
SIAM Journal on Computing
22
(6), 1993, December, pp. 1286-1302
On the zone theorem for hyperplane arrangements
Herbert Edelsbrunner
,
Raimund Seidel
,
Micha Sharir
SIAM Journal on Computing
22
(2), 1993, April, pp. 418-429
A quadratic time algorithm for the minmax lenght triangulation
Herbert Edelsbrunner
,
Tiow Seng Tan
SIAM Journal on Computing
22
(3), 1993, June, pp. 527-551
Optimal time bounds for some proximity problems in the plane
Alok Aggarwal
,
Herbert Edelsbrunner
,
Prabhakar Raghavan
,
Prasoon Tiwari
Information Processing Letters
42
, 1992, pp. 55-60
An optimal algorithm for intersecting line segments in the plane
Bernard Chazelle
,
Herbert Edelsbrunner
Journal of the ACM
39
(1), 1992, January, pp. 1-54
Computing a face in an arrangement of line segments
Bernard Chazelle
,
Herbert Edelsbrunner
,
Leonidas Guibas
,
Micha Sharir
,
Jack Snoeyink
Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'91 (San Francisco, California, January 28-30, 1991)
, 1991, pp. 441-448
Seiten 1
2
>