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. In Proceedings of the twenty-seventh annual symposium on Computational geometry (pp. 187–196). Paris, France: ACM. https://doi.org/10.1145/1998196.1998225
[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. Springer. https://doi.org/10.1007/s00373-011-1020-7
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3330 |
Kerber, M., & Sagraloff, M. (2011). Root refinement for real polynomials (pp. 209–216). Presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California, USA: Springer. https://doi.org/10.1145/1993886.1993920
[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 (pp. 179–186). Presented at the SCG: Symposium on Computational Geometry, Paris, France: ACM. https://doi.org/10.1145/1998196.1998224
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Journal Article | IST-REx-ID: 3334
Edelsbrunner, H., Pach, J., & Ziegler, G. (2011). Letter from the new editors-in-chief. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-010-9313-9
View
| DOI
2011 | Conference Paper | IST-REx-ID: 3367
Chen, C., & Kerber, M. (2011). An output sensitive algorithm for persistent homology (pp. 207–216). Presented at the SoCG: Symposium on Computational Geometry, Paris, France: ACM. https://doi.org/10.1145/1998196.1998228
View
| Files available
| DOI
2011 | Journal Article | IST-REx-ID: 3781
Fasy, B. T. (2011). The difference in length of curves in R^n. Acta Sci. Math. (Szeged). Szegedi Tudományegyetem.
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 C. Calude, G. Rozenberg, & A. Salomaa (Eds.), Rainbow of Computer Science (Vol. 6570, pp. 20–35). Springer. https://doi.org/10.1007/978-3-642-19391-0_2
[Submitted Version]
View
| Files available
| DOI
2011 | Journal Article | IST-REx-ID: 3965
Wang, B., Edelsbrunner, H., & Morozov, D. (2011). Computing elevation maxima by searching the Gauss sphere. Journal of Experimental Algorithmics. ACM. https://doi.org/10.1145/1963190.1970375
View
| DOI
2011 | Book Chapter | IST-REx-ID: 3271
Wagner, H., Chen, C., & Vuçini, E. (2011). Efficient computation of persistent homology for cubical data. In R. Peikert, H. Hauser, H. Carr, & R. Fuchs (Eds.), Topological Methods in Data Analysis and Visualization II (pp. 91–106). Springer. https://doi.org/10.1007/978-3-642-23175-9_7
View
| DOI
2011 | Conference Paper | IST-REx-ID: 3270
Chen, C., & Kerber, M. (2011). Persistent homology computation with a twist (pp. 197–200). Presented at the EuroCG: European Workshop on Computational Geometry, Morschach, Switzerland: TU Dortmund.
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. Proceedings of the IEEE International Conference on Computer Vision. Barcelona, Spain: IEEE. https://doi.org/10.1109/ICCV.2011.6126475
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3313 |
Chen, C., & Edelsbrunner, H. (2011). Diffusion runs low on persistence fast. In Proceedings of the IEEE International Conference on Computer Vision. Barcelona, Spain: IEEE. https://doi.org/10.1109/ICCV.2011.6126271
[Submitted Version]
View
| Files available
| DOI
2011 | Book Chapter | IST-REx-ID: 3311 |
Edelsbrunner, H. (n.d.). Alpha shapes - a survey. In R. van de Weygaert, G. Vegter, J. Ritzerveld, & V. Icke (Eds.), Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings. Springer.
[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. Springer. https://doi.org/10.1007/s10208-011-9090-8
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Journal Article | IST-REx-ID: 3378
Bendich, P., & Harer, J. (2011). Persistent intersection homology. Foundations of Computational Mathematics. Springer. https://doi.org/10.1007/s10208-010-9081-1
View
| DOI
2011 | Conference Paper | IST-REx-ID: 3336
Chen, C., Freedman, D., & Lampert, C. (2011). Enforcing topological constraints in random field image segmentation. In CVPR: Computer Vision and Pattern Recognition (pp. 2089–2096). Colorado Springs, CO, United States: IEEE. https://doi.org/10.1109/CVPR.2011.5995503
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 9648 |
Gonzalez-Diaz, R., Ion, A., Jimenez, M. J., & Poyatos, R. (2011). Incremental-decremental algorithm for computing AT-models and persistent homology. In Computer Analysis of Images and Patterns (Vol. 6854, pp. 286–293). Seville, Spain: Springer Nature. https://doi.org/10.1007/978-3-642-23672-3_35
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Conference Paper | IST-REx-ID: 10907
Artner, N. M., Ion, A., & Kropatsch, W. G. (2011). Spatio-temporal extraction of articulated models in a graph pyramid. In X. Jiang, M. Ferrer, & A. Torsello (Eds.), Graph-Based Representations in Pattern Recognition (Vol. 6658, pp. 215–224). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-20844-7_22
View
| DOI
2010 | Conference Paper | IST-REx-ID: 10909
Chen, C., & Freedman, D. (2010). Hardness results for homology localization. In Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1594–1604). Austin, TX, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973075.129
View
| Files available
| DOI