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 | 
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 | 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 | 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 | 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 | 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 | 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 | 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
2011 | 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 | 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 | 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 | 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 | 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 | 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 | Conference Paper | IST-REx-ID: 9648 |
Gonzalez-Diaz R, Ion A, Jimenez MJ, Poyatos R. 2011. Incremental-decremental algorithm for computing AT-models and persistent homology. Computer Analysis of Images and Patterns. CAIP: International Conference on Computer Analysis of Images and Patterns, LNCS, vol. 6854, 286–293.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Conference Paper | IST-REx-ID: 10907
Artner NM, Ion A, Kropatsch WG. 2011. Spatio-temporal extraction of articulated models in a graph pyramid. Graph-Based Representations in Pattern Recognition. GbRPR: Graph-based Representations in Pattern RecognitionLNIP, LNCS, vol. 6658, 215–224.
View
| DOI
2010 | 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