2018 chapter

Fréchet-Stable Signatures Using Persistence Homology

In *Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms* (pp. 1100–1108).

Sources: Crossref, ORCID

Added: January 7, 2020

2017 conference paper

When and Why the Topological Coverage Criterion Works

*Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms*. Presented at the Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms.

Event: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms

Sources: Crossref, ORCID

Added: January 7, 2020

2016 journal article

Efficient and robust persistent homology for measures

*Computational Geometry*, *58*, 70–96.

Sources: Crossref, ORCID

Added: January 14, 2020

2015 chapter

Approximating Nearest Neighbor Distances

In *Lecture Notes in Computer Science* (pp. 200–211).

Sources: Crossref, ORCID

Added: January 14, 2020

2015 conference paper

Persistent Homology and Nested Dissection

*Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms*. Presented at the Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms.

Event: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms

Sources: Crossref, ORCID

Added: January 14, 2020

2014 journal article

A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations

*Discrete & Computational Geometry*, *52*(3), 476–491.

Sources: Crossref, ORCID

Added: January 14, 2020

2014 conference paper

Efficient and Robust Persistent Homology for Measures

*Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms*. Presented at the Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms.

Event: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms

Sources: Crossref, ORCID

Added: January 14, 2020

2014 journal article

Zigzag Zoology: Rips Zigzags for Homology Inference

*Foundations of Computational Mathematics*, *15*(5), 1151–1186.

Sources: Crossref, ORCID

Added: January 14, 2020

2013 conference paper

A fast algorithm for well-spaced points and approximate delaunay graphs

*Proceedings of the 29th annual symposium on Symposuim on computational geometry - SoCG '13*. Presented at the the 29th annual symposium.

Event: the 29th annual symposium

Sources: Crossref, ORCID

Added: January 14, 2020

2013 conference paper

A new approach to output-sensitive voronoi diagrams and delaunay triangulations

*Proceedings of the 29th annual symposium on Symposuim on computational geometry - SoCG '13*. Presented at the the 29th annual symposium.

Event: the 29th annual symposium

Sources: Crossref, ORCID

Added: January 14, 2020

2013 journal article

Linear-Size Approximations to the Vietoris–Rips Filtration

*Discrete & Computational Geometry*, *49*(4), 778–796.

Sources: Crossref, ORCID

Added: January 14, 2020

2013 conference paper

Zigzag zoology

*Proceedings of the 29th annual symposium on Symposuim on computational geometry - SoCG '13*. Presented at the the 29th annual symposium.

Event: the 29th annual symposium

Sources: Crossref, ORCID

Added: January 14, 2020

2012 conference paper

Linear-size approximations to the vietoris-rips filtration

*Proceedings of the 2012 symposuim on Computational Geometry - SoCG '12*. Presented at the the 2012 symposuim.

Event: the 2012 symposuim

Sources: Crossref, ORCID

Added: January 14, 2020

2012 journal article

New Bounds on the Size of Optimal Meshes

*Computer Graphics Forum*, *31*(5), 1627–1635.

Sources: Crossref, ORCID

Added: January 14, 2020

2011 conference paper

Beating the spread

*Proceedings of the 27th annual ACM symposium on Computational geometry - SoCG '11*. Presented at the the 27th annual ACM symposium.

Event: the 27th annual ACM symposium

Sources: Crossref, ORCID

Added: January 14, 2020

2010 journal article

Approximate centerpoints with proofs

*Computational Geometry*, *43*(8), 647–654.

Sources: Crossref, ORCID

Added: January 14, 2020

2010 conference paper

Topological inference via meshing

*Proceedings of the 2010 annual symposium on Computational geometry - SoCG '10*. Presented at the the 2010 annual symposium.

Event: the 2010 annual symposium

Sources: Crossref, ORCID

Added: January 14, 2020

2009 conference paper

Approximate center points with proofs

*Proceedings of the 25th annual symposium on Computational geometry - SCG '09*. Presented at the the 25th annual symposium.

Event: the 25th annual symposium

Sources: Crossref, ORCID

Added: January 14, 2020

2009 conference paper

Size Complexity of Volume Meshes vs. Surface Meshes

*Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms*. Presented at the Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms.

Event: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

Sources: Crossref, ORCID

Added: January 14, 2020

2008 journal article

Shape deformation in continuous map generalization

*GeoInformatica*, *13*(2), 203–221.

Sources: Crossref, ORCID

Added: January 14, 2020

2007 chapter

Size Competitive Meshing Without Large Angles

In *Automata, Languages and Programming* (pp. 655–666).

Sources: Crossref, ORCID

Added: January 14, 2020

2006 journal article

Compatible triangulations and point partitions by series-triangular graphs

*Computational Geometry*, *34*(3), 195–202.

Sources: Crossref, ORCID

Added: January 14, 2020