17 Publications

Mark all

[17]
2013 | Conference Paper | IST-REx-ID: 2906   OA
M. Kerber and H. Edelsbrunner, “3D kinetic alpha complexes and their implementation,” in 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments, New Orleans, LA, United States, 2013, pp. 70–77.
View | Files available | DOI
 
[16]
2013 | Journal Article | IST-REx-ID: 2939
C. Chen and M. Kerber, “An output sensitive algorithm for persistent homology,” Computational Geometry: Theory and Applications, vol. 46, no. 4, pp. 435–447, 2013.
View | Files available | DOI
 
[15]
2012 | Journal Article | IST-REx-ID: 3256   OA
H. Edelsbrunner and M. Kerber, “Dual complexes of cubical subdivisions of ℝn,” Discrete & Computational Geometry, vol. 47, no. 2, pp. 393–414, 2012.
View | Files available | DOI
 
[14]
2012 | Journal Article | IST-REx-ID: 3120   OA
G. Brown, M. Kerber, and M. Reid, “Fano 3 folds in codimension 4 Tom and Jerry Part I,” Compositio Mathematica, vol. 148, no. 4, pp. 1171–1194, 2012.
View | DOI | Download (ext.)
 
[13]
2012 | Conference Paper | IST-REx-ID: 3133   OA
H. Edelsbrunner and M. Kerber, “Alexander duality for functions: The persistent behavior of land and water and shore,” in Proceedings of the twenty-eighth annual symposium on Computational geometry , Chapel Hill, NC, USA, 2012, pp. 249–258.
View | DOI | Download (ext.)
 
[12]
2012 | Journal Article | IST-REx-ID: 3331   OA
M. Kerber and M. Sagraloff, “A worst case bound for topology computation of algebraic curves,” Journal of Symbolic Computation, vol. 47, no. 3, pp. 239–258, 2012.
View | DOI | Download (ext.)
 
[11]
2012 | Journal Article | IST-REx-ID: 3115
E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” Discrete & Computational Geometry, vol. 48, no. 4, pp. 964–989, 2012.
View | Files available | DOI | Download (ext.) | arXiv
 
[10]
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
 
[9]
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.
View | DOI | Download (ext.) | arXiv
 
[8]
2011 | Conference Paper | IST-REx-ID: 3328
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.
View | DOI
 
[7]
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.
View | Files available | DOI
 
[6]
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.
View | Files available | DOI | Download (ext.)
 
[5]
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
 
[4]
2011 | Journal Article | IST-REx-ID: 3332
M. Kerber and M. Sagraloff, “A note on the complexity of real algebraic hypersurfaces,” Graphs and Combinatorics, vol. 27, no. 3, pp. 419–430, 2011.
View | DOI
 
[3]
2010 | Conference Paper | IST-REx-ID: 3850
E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Polygonal reconstruction from approximate offsets,” presented at the EuroCG: European Workshop on Computational Geometry, Dortmund, Germany, 2010, pp. 12–23.
View
 
[2]
2010 | Journal Article | IST-REx-ID: 3901   OA
P. Bendich, H. Edelsbrunner, and M. Kerber, “Computing robustness and persistence for images,” IEEE Transactions of Visualization and Computer Graphics, vol. 16, no. 6, pp. 1251–1260, 2010.
View | Files available | DOI
 
[1]
2010 | Conference Paper | IST-REx-ID: 3849   OA
P. Bendich, H. Edelsbrunner, M. Kerber, and A. Patel, “Persistent homology under non-uniform error,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 12–23.
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

17 Publications

Mark all

[17]
2013 | Conference Paper | IST-REx-ID: 2906   OA
M. Kerber and H. Edelsbrunner, “3D kinetic alpha complexes and their implementation,” in 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments, New Orleans, LA, United States, 2013, pp. 70–77.
View | Files available | DOI
 
[16]
2013 | Journal Article | IST-REx-ID: 2939
C. Chen and M. Kerber, “An output sensitive algorithm for persistent homology,” Computational Geometry: Theory and Applications, vol. 46, no. 4, pp. 435–447, 2013.
View | Files available | DOI
 
[15]
2012 | Journal Article | IST-REx-ID: 3256   OA
H. Edelsbrunner and M. Kerber, “Dual complexes of cubical subdivisions of ℝn,” Discrete & Computational Geometry, vol. 47, no. 2, pp. 393–414, 2012.
View | Files available | DOI
 
[14]
2012 | Journal Article | IST-REx-ID: 3120   OA
G. Brown, M. Kerber, and M. Reid, “Fano 3 folds in codimension 4 Tom and Jerry Part I,” Compositio Mathematica, vol. 148, no. 4, pp. 1171–1194, 2012.
View | DOI | Download (ext.)
 
[13]
2012 | Conference Paper | IST-REx-ID: 3133   OA
H. Edelsbrunner and M. Kerber, “Alexander duality for functions: The persistent behavior of land and water and shore,” in Proceedings of the twenty-eighth annual symposium on Computational geometry , Chapel Hill, NC, USA, 2012, pp. 249–258.
View | DOI | Download (ext.)
 
[12]
2012 | Journal Article | IST-REx-ID: 3331   OA
M. Kerber and M. Sagraloff, “A worst case bound for topology computation of algebraic curves,” Journal of Symbolic Computation, vol. 47, no. 3, pp. 239–258, 2012.
View | DOI | Download (ext.)
 
[11]
2012 | Journal Article | IST-REx-ID: 3115
E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” Discrete & Computational Geometry, vol. 48, no. 4, pp. 964–989, 2012.
View | Files available | DOI | Download (ext.) | arXiv
 
[10]
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
 
[9]
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.
View | DOI | Download (ext.) | arXiv
 
[8]
2011 | Conference Paper | IST-REx-ID: 3328
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.
View | DOI
 
[7]
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.
View | Files available | DOI
 
[6]
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.
View | Files available | DOI | Download (ext.)
 
[5]
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
 
[4]
2011 | Journal Article | IST-REx-ID: 3332
M. Kerber and M. Sagraloff, “A note on the complexity of real algebraic hypersurfaces,” Graphs and Combinatorics, vol. 27, no. 3, pp. 419–430, 2011.
View | DOI
 
[3]
2010 | Conference Paper | IST-REx-ID: 3850
E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Polygonal reconstruction from approximate offsets,” presented at the EuroCG: European Workshop on Computational Geometry, Dortmund, Germany, 2010, pp. 12–23.
View
 
[2]
2010 | Journal Article | IST-REx-ID: 3901   OA
P. Bendich, H. Edelsbrunner, and M. Kerber, “Computing robustness and persistence for images,” IEEE Transactions of Visualization and Computer Graphics, vol. 16, no. 6, pp. 1251–1260, 2010.
View | Files available | DOI
 
[1]
2010 | Conference Paper | IST-REx-ID: 3849   OA
P. Bendich, H. Edelsbrunner, M. Kerber, and A. Patel, “Persistent homology under non-uniform error,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 12–23.
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed