Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




175 Publications

2011 | Conference Paper | IST-REx-ID: 3367
C. Chen and M. Kerber, “An output sensitive algorithm for persistent homology,” presented at the SoCG: Symposium on Computational Geometry, Paris, France, 2011, pp. 207–216.
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3377 | OA
H. Edelsbrunner, D. Morozov, and A. Patel, “Quantifying transversality by measuring the robustness of intersections,” Foundations of Computational Mathematics, vol. 11, no. 3, pp. 345–361, 2011.
View | DOI | Download Submitted Version (ext.)
 
2011 | Journal Article | IST-REx-ID: 3378
P. Bendich and J. Harer, “Persistent intersection homology,” Foundations of Computational Mathematics, vol. 11, no. 3, pp. 305–336, 2011.
View | DOI
 
2011 | Journal Article | IST-REx-ID: 3781
B. T. Fasy, “The difference in length of curves in R^n,” Acta Sci. Math. (Szeged), vol. 77, no. 1–2, pp. 359–367, 2011.
View
 
2011 | Book Chapter | IST-REx-ID: 3796 | OA
H. Edelsbrunner and M. Kerber, “Covering and packing with spheres by diagonal distortion in R^n,” in Rainbow of Computer Science, vol. 6570, C. Calude, G. Rozenberg, and A. Salomaa, Eds. Springer, 2011, pp. 20–35.
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3965
B. Wang, H. Edelsbrunner, and D. Morozov, “Computing elevation maxima by searching the Gauss sphere,” Journal of Experimental Algorithmics, vol. 16, no. 2.2, pp. 1–13, 2011.
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3330 | OA
M. Kerber and M. Sagraloff, “Root refinement for real polynomials,” presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California, USA, 2011, pp. 209–216.
View | DOI | Download Preprint (ext.) | arXiv
 
2010 | Conference Paper | IST-REx-ID: 3782
C. Chen and D. Freedman, “Topology noise removal for curve  and surface evolution,” in Conference proceedings MCV 2010, Beijing, China, 2010, vol. 6533, pp. 31–42.
View | DOI
 
2010 | Book Chapter | IST-REx-ID: 3795 | OA
H. Edelsbrunner, D. Morozov, and A. Patel, “The stability of the apparent contour of an orientable 2-manifold,” in Topological Data Analysis and Visualization: Theory, Algorithms and Applications, Springer, 2010, pp. 27–42.
View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3848
P. Bendich, H. Edelsbrunner, D. Morozov, and A. Patel, “The robustness of level sets,” presented at the ESA: European Symposium on Algorithms, Liverpool, UK, 2010, vol. 6346, pp. 1–10.
View | DOI
 
2010 | Conference Paper | IST-REx-ID: 3849 | OA
P. Bendich, H. Edelsbrunner, M. Kerber, and A. Patel, “Persistent homology under non-uniform error,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 12–23.
View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3850
E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Polygonal reconstruction from approximate offsets,” presented at the EuroCG: European Workshop on Computational Geometry, Dortmund, Germany, 2010, pp. 12–23.
View
 
2010 | Conference Paper | IST-REx-ID: 3853 | OA
K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou, “Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 269–283.
View | Files available | DOI
 
2010 | Journal Article | IST-REx-ID: 3901 | OA
P. Bendich, H. Edelsbrunner, and M. Kerber, “Computing robustness and persistence for images,” IEEE Transactions of Visualization and Computer Graphics, vol. 16, no. 6, pp. 1251–1260, 2010.
View | Files available | DOI
 
2009 | Conference Paper | IST-REx-ID: 3968 | OA
H. Edelsbrunner and J. Harer, “The persistent Morse complex segmentation of a 3-manifold,” presented at the 3DPH: Modelling the Physiological Human, Zermatt, Switzerland, 2009, vol. 5903, pp. 36–50.
View | Files available | DOI
 

Search

Filter Publications