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.
277 Publications
2011 | Published | Conference Paper | IST-REx-ID: 3270
Chen C, Kerber M. 2011. Persistent homology computation with a twist. EuroCG: European Workshop on Computational Geometry, 197–200.
View
2011 | In Press | Book Chapter | IST-REx-ID: 3311 |
Edelsbrunner H.Alpha shapes - a survey. In: Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings. .
[Submitted Version]
View
| Files available
2011 | Published | Conference Poster | IST-REx-ID: 3312 |
Zheng Y, Gu S, Edelsbrunner H, Tomasi C, Benfey P. 2011. Detailed reconstruction of 3D plant root shape, IEEE,p.
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3313 |
Chen C, Edelsbrunner H. 2011. Diffusion runs low on persistence fast. Proceedings of the IEEE International Conference on Computer Vision. ICCV: International Conference on Computer Vision, 6126271.
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3328 |
Berberich E, Hemmer M, Kerber M. 2011. A generic algebraic kernel for non linear geometric applications. SCG: Symposium on Computational Geometry, 179–186.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3329 |
Berberich E, Halperin D, Kerber M, Pogalnikova R. 2011. Deconstructing approximate offsets. Proceedings of the twenty-seventh annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 187–196.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3330 |
Kerber M, Sagraloff M. 2011. Root refinement for real polynomials. ISSAC: International Symposium on Symbolic and Algebraic Computation, 209–216.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Journal Article | IST-REx-ID: 3332 |
Kerber M, Sagraloff M. 2011. A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. 27(3), 419–430.
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Book Chapter | IST-REx-ID: 3335 |
Van De Weygaert R, Vegter G, Edelsbrunner H, Jones B, Pranav P, Park C, Hellwing W, Eldering B, Kruithof N, Bos P, Hidding J, Feldbrugge J, Ten Have E, Van Engelen M, Caroli M, Teillaud M. 2011.Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In: Transactions on Computational Science XIV. LNCS, vol. 6970, 60–101.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 3336
Chen C, Freedman D, Lampert C. 2011. Enforcing topological constraints in random field image segmentation. CVPR: Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 2089–2096.
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3367
Chen C, Kerber M. 2011. An output sensitive algorithm for persistent homology. SoCG: Symposium on Computational Geometry, 207–216.
View
| Files available
| DOI
2011 | Published | Journal Article | IST-REx-ID: 3377 |
Edelsbrunner H, Morozov D, Patel A. 2011. Quantifying transversality by measuring the robustness of intersections. Foundations of Computational Mathematics. 11(3), 345–361.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Published | Journal Article | IST-REx-ID: 3781
Fasy BT. 2011. The difference in length of curves in R^n. Acta Sci. Math. (Szeged). 77(1–2), 359–367.
View
2011 | Published | Book Chapter | IST-REx-ID: 3796 |
Edelsbrunner H, Kerber M. 2011.Covering and packing with spheres by diagonal distortion in R^n. In: Rainbow of Computer Science. LNCS, vol. 6570, 20–35.
[Submitted Version]
View
| Files available
| DOI
2010 | Published | Conference Paper | IST-REx-ID: 10909
Chen C, Freedman D. 2010. Hardness results for homology localization. Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1594–1604.
View
| Files available
| DOI