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.




263 Publications

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.
[Preprint] 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. Springer, pp. 419–430, 2011.
[Submitted Version] View | Files available | 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.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
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.
[Published Version] View | DOI | Download Published Version (ext.)
 
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. Springer, pp. 1–2, 2011.
View | 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: 3781
B. T. Fasy, “The difference in length of curves in R^n,” Acta Sci. Math. (Szeged), vol. 77, no. 1–2. Szegedi Tudományegyetem, 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.
[Submitted Version] 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. ACM, pp. 1–13, 2011.
View | DOI
 
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 | 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 | 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.
[Submitted Version] 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.
[Submitted Version] View | Files available | DOI
 
2011 | Book Chapter | IST-REx-ID: 3311 | OA
H. Edelsbrunner, “Alpha shapes - a survey,” in Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, R. van de Weygaert, G. Vegter, J. Ritzerveld, and V. Icke, Eds. Springer.
[Submitted Version] View | Files available
 
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. Springer, pp. 345–361, 2011.
[Submitted Version] 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. Springer, pp. 305–336, 2011.
View | DOI
 
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, United States, 2011, pp. 2089–2096.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 9648 | OA
R. Gonzalez-Diaz, A. Ion, M. J. Jimenez, and R. Poyatos, “Incremental-decremental algorithm for computing AT-models and persistent homology,” in Computer Analysis of Images and Patterns, Seville, Spain, 2011, vol. 6854, pp. 286–293.
[Published Version] View | DOI | Download Published Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 10907
N. M. Artner, A. Ion, and W. G. Kropatsch, “Spatio-temporal extraction of articulated models in a graph pyramid,” in Graph-Based Representations in Pattern Recognition, Münster, Germany, 2011, vol. 6658, pp. 215–224.
View | DOI
 
2010 | Conference Paper | IST-REx-ID: 10909
C. Chen and D. Freedman, “Hardness results for homology localization,” in Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, United States, 2010, pp. 1594–1604.
View | Files available | DOI
 

Search

Filter Publications