Paul Bendich
Edelsbrunner Group
7 Publications
2013 | Journal Article | IST-REx-ID: 2859 | 
Bendich, P., Edelsbrunner, H., Morozov, D., & Patel, A. (2013). Homology and robustness of level and interlevel sets. Homology, Homotopy and Applications. International Press. https://doi.org/10.4310/HHA.2013.v15.n1.a3
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Journal Article | IST-REx-ID: 3310 |
Bendich, P., Cabello, S., & Edelsbrunner, H. (2012). A point calculus for interlevel set homology. Pattern Recognition Letters. Elsevier. https://doi.org/10.1016/j.patrec.2011.10.007
[Submitted Version]
View
| Files available
| DOI
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
2010 | Conference Paper | IST-REx-ID: 3848
Bendich, P., Edelsbrunner, H., Morozov, D., & Patel, A. (2010). The robustness of level sets (Vol. 6346, pp. 1–10). Presented at the ESA: European Symposium on Algorithms, Liverpool, UK: Springer. https://doi.org/10.1007/978-3-642-15775-2_1
View
| DOI
2010 | Conference Paper | IST-REx-ID: 3849 |
Bendich, P., Edelsbrunner, H., Kerber, M., & Patel, A. (2010). Persistent homology under non-uniform error (Vol. 6281, pp. 12–23). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_2
[Submitted Version]
View
| Files available
| DOI
2010 | Journal Article | IST-REx-ID: 3901 |
Bendich, P., Edelsbrunner, H., & Kerber, M. (2010). Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. IEEE. https://doi.org/10.1109/TVCG.2010.139
[Submitted Version]
View
| Files available
| DOI
2007 | Conference Paper | IST-REx-ID: 3975
Bendich, P., Cohen Steiner, D., Edelsbrunner, H., Harer, J., & Morozov, D. (2007). Inferring local homology from sampled stratified spaces (pp. 536–546). Presented at the FOCS: Foundations of Computer Science, IEEE. https://doi.org/10.1109/FOCS.2007.33
View
| DOI
7 Publications
2013 | Journal Article | IST-REx-ID: 2859 |
Bendich, P., Edelsbrunner, H., Morozov, D., & Patel, A. (2013). Homology and robustness of level and interlevel sets. Homology, Homotopy and Applications. International Press. https://doi.org/10.4310/HHA.2013.v15.n1.a3
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Journal Article | IST-REx-ID: 3310 |
Bendich, P., Cabello, S., & Edelsbrunner, H. (2012). A point calculus for interlevel set homology. Pattern Recognition Letters. Elsevier. https://doi.org/10.1016/j.patrec.2011.10.007
[Submitted Version]
View
| Files available
| DOI
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
2010 | Conference Paper | IST-REx-ID: 3848
Bendich, P., Edelsbrunner, H., Morozov, D., & Patel, A. (2010). The robustness of level sets (Vol. 6346, pp. 1–10). Presented at the ESA: European Symposium on Algorithms, Liverpool, UK: Springer. https://doi.org/10.1007/978-3-642-15775-2_1
View
| DOI
2010 | Conference Paper | IST-REx-ID: 3849 |
Bendich, P., Edelsbrunner, H., Kerber, M., & Patel, A. (2010). Persistent homology under non-uniform error (Vol. 6281, pp. 12–23). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_2
[Submitted Version]
View
| Files available
| DOI
2010 | Journal Article | IST-REx-ID: 3901 |
Bendich, P., Edelsbrunner, H., & Kerber, M. (2010). Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. IEEE. https://doi.org/10.1109/TVCG.2010.139
[Submitted Version]
View
| Files available
| DOI
2007 | Conference Paper | IST-REx-ID: 3975
Bendich, P., Cohen Steiner, D., Edelsbrunner, H., Harer, J., & Morozov, D. (2007). Inferring local homology from sampled stratified spaces (pp. 536–546). Presented at the FOCS: Foundations of Computer Science, IEEE. https://doi.org/10.1109/FOCS.2007.33
View
| DOI