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

2012 | Conference Paper | IST-REx-ID: 3134
H. Edelsbrunner, B. Fasy, and G. Rote, “Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions,” in Proceedings of the twenty-eighth annual symposium on Computational geometry , Chapel Hill, NC, USA, 2012, pp. 91–100.
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3159 | OA
Y. Mileyko, H. Edelsbrunner, C. Price, and J. Weitz, “Hierarchical ordering of reticular networks,” PLoS One, vol. 7, no. 6, 2012.
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3256 | OA
H. Edelsbrunner and M. Kerber, “Dual complexes of cubical subdivisions of ℝn,” Discrete & Computational Geometry, vol. 47, no. 2, pp. 393–414, 2012.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3265
A. Ion, J. Carreira, and C. Sminchisescu, “Image segmentation by figure-ground composition into maximal cliques,” presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain, 2012.
View | DOI
 
2012 | Journal Article | IST-REx-ID: 3310 | OA
P. Bendich, S. Cabello, and H. Edelsbrunner, “A point calculus for interlevel set homology,” Pattern Recognition Letters, vol. 33, no. 11, pp. 1436–1444, 2012.
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3331 | OA
M. Kerber and M. Sagraloff, “A worst case bound for topology computation of algebraic curves,” Journal of Symbolic Computation, vol. 47, no. 3, pp. 239–258, 2012.
View | DOI | Download Preprint (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3266
A. Ion, J. Carreira, and C. Sminchisescu, “Probabilistic joint image segmentation and labeling,” in NIPS Proceedings, Granada, Spain, 2011, vol. 24, pp. 1827–1835.
View
 
2011 | Journal Article | IST-REx-ID: 3267
C. Chen and D. Freedman, “Hardness results for homology localization,” Discrete & Computational Geometry, vol. 45, no. 3, pp. 425–448, 2011.
View | DOI
 
2011 | Journal Article | IST-REx-ID: 3269 | OA
Y. Sheng, B. Cutler, C. Chen, and J. Nasman, “Perceptual global illumination cancellation in complex projection environments,” Computer Graphics Forum, vol. 30, no. 4, pp. 1261–1268, 2011.
View | DOI | Download Published Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3270
C. Chen and M. Kerber, “Persistent homology computation with a twist,” presented at the EuroCG: European Workshop on Computational Geometry, Morschach, Switzerland, 2011, pp. 197–200.
View
 
2011 | Book Chapter | IST-REx-ID: 3271
H. Wagner, C. Chen, and E. Vuçini, “Efficient computation of persistent homology for cubical data,” in Topological Methods in Data Analysis and Visualization II, R. Peikert, H. Hauser, H. Carr, and R. Fuchs, Eds. Springer, 2011, pp. 91–106.
View | DOI
 
2011 | Book Chapter | IST-REx-ID: 3311
H. Edelsbrunner, “Alpha shapes - a survey,” in Tessellations in the Sciences, Springer, 2011.
View
 
2011 | Conference Poster | IST-REx-ID: 3312 | OA
Y. Zheng, S. Gu, H. Edelsbrunner, C. Tomasi, and P. Benfey, Detailed reconstruction of 3D plant root shape. IEEE, 2011.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3313 | OA
C. Chen and H. Edelsbrunner, “Diffusion runs low on persistence fast,” in Proceedings of the IEEE International Conference on Computer Vision, Barcelona, Spain, 2011.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3328 | OA
E. Berberich, M. Hemmer, and M. Kerber, “A generic algebraic kernel for non linear geometric applications,” presented at the SCG: Symposium on Computational Geometry, Paris, France, 2011, pp. 179–186.
View | DOI | Download Published Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3329 | OA
E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” in Proceedings of the twenty-seventh annual symposium on Computational geometry, Paris, France, 2011, pp. 187–196.
View | Files available | DOI | Download Preprint (ext.)
 
2011 | Journal Article | IST-REx-ID: 3332 | OA
M. Kerber and M. Sagraloff, “A note on the complexity of real algebraic hypersurfaces,” Graphs and Combinatorics, vol. 27, no. 3, pp. 419–430, 2011.
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3334
H. Edelsbrunner, J. Pach, and G. Ziegler, “Letter from the new editors-in-chief,” Discrete & Computational Geometry, vol. 45, no. 1, pp. 1–2, 2011.
View | DOI
 
2011 | Book Chapter | IST-REx-ID: 3335 | OA
R. Van De Weygaert et al., “Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web,” in Transactions on Computational Science XIV, vol. 6970, M. Gavrilova, K. Tan, and M. Mostafavi, Eds. Springer, 2011, pp. 60–101.
View | DOI | Download Preprint (ext.) | arXiv
 
2011 | Conference Paper | IST-REx-ID: 3336
C. Chen, D. Freedman, and C. Lampert, “Enforcing topological constraints in random field image segmentation,” in CVPR: Computer Vision and Pattern Recognition, Colorado Springs, CO, USA, 2011, pp. 2089–2096.
View | Files available | DOI
 
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