Tamal K. Dey

Woojin Kim

Discret. Comput. Geom., January, 2024

A Fast Algorithm for Computing Zigzag Representatives.

[BibT_eX]

[DOI]

Dmitriy Morozov

CoRR, 2024

D-GRIL: End-to-End Topological Learning with 2-parameter Persistence.

[BibT_eX]

[DOI]

CoRR, 2024

Computing Generalized Ranks of Persistence Modules via Unfolding to Zigzag Modules.

[BibT_eX]

[DOI]

Aman Timalsina

CoRR, 2024

Expressive Higher-Order Link Prediction through Hypergraph Symmetry Breaking.

[BibT_eX]

[DOI]

Simon Zhang

CoRR, 2024

Efficient Algorithms for Complexes of Persistence Modules with Applications.

[BibT_eX]

[DOI]

Florian Russold

Shreyas N. Samaga

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Cup Product Persistence and Its Efficient Computation.

[BibT_eX]

[DOI]

Abhishek Rathod

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Computing Zigzag Vineyard Efficiently Including Expansions and Contractions.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Topological structure of complex predictions.

[BibT_eX]

[DOI]

Meng Liu

David F. Gleich

Nat. Mac. Intell., December, 2023

ICML 2023 Topological Deep Learning Challenge : Design and Results.

[BibT_eX]

[DOI]

CoRR, 2023

Revisiting Graph Persistence for Updates and Efficiency.

[BibT_eX]

[DOI]

CoRR, 2023

Revisiting Graph Persistence for Updates and Efficiency.

[BibT_eX]

[DOI]

Karthikeyan Natesan Ramamurthy

Salman Parsa

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

GRIL: A $2$-parameter Persistence Based Vectorization for Machine Learning.

[BibT_eX]

[DOI]

Proceedings of the Topological, 2023

ICML 2023 Topological Deep Learning Challenge: Design and Results.

[BibT_eX]

[DOI]

Alessandro Salatiello

Kalyan Varma Nadimpalli

Proceedings of the Topological, 2023

Meta-Diagrams for 2-Parameter Persistence.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Persistence of Conley-Morse Graphs in Combinatorial Dynamical Systems.

[BibT_eX]

[DOI]

Marian Mrozek

SIAM J. Appl. Dyn. Syst., 2022

Determining clinically relevant features in cytometry data using persistent homology.

[BibT_eX]

[DOI]

PLoS Comput. Biol., 2022

Generalized persistence algorithm for decomposing multiparameter persistence modules.

[BibT_eX]

[DOI]

J. Appl. Comput. Topol., 2022

An Efficient Algorithm for 1-Dimensional (Persistent) Path Homology.

[BibT_eX]

[DOI]

Tianqi Li

Discret. Comput. Geom., 2022

GEFL: Extended Filtration Learning for Graph Classification.

[BibT_eX]

[DOI]

Simon Zhang

Soham Mukherjee

Proceedings of the Learning on Graphs Conference, 2022

Fast Computation of Zigzag Persistence.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Tracking Dynamical Features via Continuation and Persistence.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification.

[BibT_eX]

[DOI]

Simon Zhang

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021

Updating Zigzag Persistence and Maintaining Representatives over Changing Filtrations.

[BibT_eX]

[DOI]

CoRR, 2021

On Association between Absolute and Relative Zigzag Persistence.

[BibT_eX]

[DOI]

CoRR, 2021

Rectangular Approximation and Stability of 2-parameter Persistence Modules.

[BibT_eX]

[DOI]

CoRR, 2021

Computing Optimal Persistent Cycles for Levelset Zigzag on Manifold-like Complexes.

[BibT_eX]

[DOI]

CoRR, 2021

3D Microstructure Segmentation by Topological Persistence.

[BibT_eX]

[DOI]

Anand V. Patel

Juan D. Beltran Rodriguez

Dunbar P. Birnie III

CoRR, 2021

2D Points Curve Reconstruction Survey and Benchmark.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2021

Gene expression data classification using topology and machine learning models.

[BibT_eX]

[DOI]

Soham Mukherjee

BMC Bioinform., 2021

Computing Zigzag Persistence on Graphs in Near-Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Filtration Simplification for Persistent Homology via Edge Contraction.

[BibT_eX]

[DOI]

J. Math. Imaging Vis., 2020

Computing Minimal Persistent Cycles: Polynomial and Hard Cases.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Persistence of the Conley Index in Combinatorial Dynamical Systems.

[BibT_eX]

[DOI]

Marian Mrozek

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

Persistent Homology of Morse Decompositions in Combinatorial Dynamics.

[BibT_eX]

[DOI]

SIAM J. Appl. Dyn. Syst., 2019

SimBa: An Efficient Tool for Approximating Rips-filtration Persistence via Simplicial Batch Collapse.

[BibT_eX]

[DOI]

Dayu Shi

ACM J. Exp. Algorithmics, 2019

Generalized Persistence Algorithm for Decomposing Multi-parameter Persistence Modules.

[BibT_eX]

[DOI]

CoRR, 2019

Spectral concentration and greedy k-clustering.

[BibT_eX]

[DOI]

Pan Peng

Comput. Geom., 2019

Computing Height Persistence and Homology Generators in R3 Efficiently.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Road Network Reconstruction from satellite images with Machine Learning Supported by Topological Methods.

[BibT_eX]

[DOI]

Jiayuan Wang

Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2019

Persistent 1-Cycles: Definition, Computation, and Its Application.

[BibT_eX]

[DOI]

Proceedings of the Computational Topology in Image Context - 7th International Workshop, 2019

2018

Declutter and resample: Towards parameter free denoising.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Edge contraction in persistence-generated discrete Morse vector fields.

[BibT_eX]

[DOI]

Comput. Graph., 2018

Protein Classification with Improved Topological Data Analysis.

[BibT_eX]

[DOI]

Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Efficient Algorithms for Computing a Minimal Homology Basis.

[BibT_eX]

[DOI]

Tianqi Li

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Computing Bottleneck Distance for 2-D Interval Decomposable Modules.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Graph Reconstruction by Discrete Morse Theory.

[BibT_eX]

[DOI]

Jiayuan Wang

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Improved Image Classification using Topological Persistence.

[BibT_eX]

[DOI]

William Varcho

Proceedings of the 22nd International Symposium on Vision, Modeling, and Visualization, 2017

Parameter-free Topology Inference and Sparsification for Data on Manifolds.

[BibT_eX]

[DOI]

Zhe Dong

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Temporal Hierarchical Clustering.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Improved Road Network Reconstruction using Discrete Morse Theory.

[BibT_eX]

[DOI]

Jiayuan Wang

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

Temporal Clustering.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Topological Analysis of Nerves, Reeb Spaces, Mappers, and Multiscale Mappers.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

Smooth Surface and Volume Meshing.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Meshing Piecewise Smooth Complexes.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Segmenting a surface mesh into pants using Morse theory.

[BibT_eX]

[DOI]

Mustafa Hajij

Xin Li

Graph. Model., 2016

Multiscale Mapper: Topological Summarization via Codomain Covers.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Mutiscale Mapper: A Framework for Topological Summarization of Data and Maps.

[BibT_eX]

[DOI]

CoRR, 2015

Graph induced complex on point data.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Automatic posing of a meshed human model using point clouds.

[BibT_eX]

[DOI]

Comput. Graph., 2015

The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology.

[BibT_eX]

[DOI]

Jean-Daniel Boissonnat

Clément Maria

Algorithmica, 2015

X-Ray Imaging and General Regression Neural Network (GRNN) for Estimation of Silk Content in Cocoons.

[BibT_eX]

[DOI]

Nabarun Bhattacharyya

Proceedings of the 2nd International Conference on Perception and Machine Intelligence, 2015

Comparing Graphs via Persistence Distortion.

[BibT_eX]

[DOI]

Dayu Shi

Proceedings of the 31st International Symposium on Computational Geometry, 2015

Topological Analysis of Scalar Fields with Outliers.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Spectral concentration, robust k-center, and simple clustering.

[BibT_eX]

[DOI]

CoRR, 2014

Normal variation for adaptive feature size.

[BibT_eX]

[DOI]

Nina Amenta

CoRR, 2014

Computing Topological Persistence for Simplicial Maps.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Dimension Detection with Local Homology.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Computational Topology in Reconstruction, Mesh Generation, and Data Analysis.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

An efficient computation of handle and tunnel loops via Reeb graphs.

[BibT_eX]

[DOI]

ACM Trans. Graph., 2013

Adaptive fracture simulation of multi-layered thin plates.

[BibT_eX]

[DOI]

Oleksiy Busaryev

Huamin Wang

ACM Trans. Graph., 2013

Reeb Graphs: Approximation and Persistence.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Steve Y. Oudot

Discret. Comput. Geom., 2013

Topological Persistence for Circle-Valued Maps.

[BibT_eX]

[DOI]

Dan Burghelea

Discret. Comput. Geom., 2013

Edge Contractions and Simplicial Homology

[BibT_eX]

[DOI]

CoRR, 2013

Voronoi-based feature curves extraction for sampled singular surfaces.

[BibT_eX]

[DOI]

Lei Wang

Comput. Graph., 2013

Weighted Graph Laplace Operator under Topological Noise.

[BibT_eX]

[DOI]

Pawas Ranjan

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Localized delaunay refinement for piecewise-smooth complexes.

[BibT_eX]

[DOI]

Andrew G. Slatton

Proceedings of the Symposium on Computational Geometry 2013, 2013

Delaunay Mesh Generation.

[BibT_eX]

[DOI]

Jonathan Richard Shewchuk

Chapman and Hall / CRC computer and information science series, CRC Press, ISBN: 978-1-584-88730-0, 2013

2012

Eigen deformation of 3D models.

[BibT_eX]

[DOI]

Pawas Ranjan

Vis. Comput., 2012

Animating bubble interactions in a liquid foam.

[BibT_eX]

[DOI]

ACM Trans. Graph., 2012

Meshing interfaces of multi-label data with Delaunay refinement.

[BibT_eX]

[DOI]

Firdaus Janoos

Eng. Comput., 2012

Feature-Preserving Reconstruction of Singular Surfaces.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2012

Annotating Simplices with a Homology Basis and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2012, 2012

2011

Optimal Homologous Cycles, Total Unimodularity, and Linear Programming.

[BibT_eX]

[DOI]

Anil N. Hirani

Bala Krishnamoorthy

SIAM J. Comput., 2011

Persistence for Circle Valued Maps

[BibT_eX]

[DOI]

Dan Burghelea

CoRR, 2011

Localized Delaunay Refinement for Volumes.

[BibT_eX]

[DOI]

Andrew G. Slatton

Comput. Graph. Forum, 2011

Localized Cocone surface reconstruction.

[BibT_eX]

[DOI]

Ramsay Dyer

Lei Wang

Comput. Graph., 2011

Geometry and Topology from Point Cloud Data.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

2010

Polygonal surface remeshing with Delaunay refinement.

[BibT_eX]

[DOI]

Tathagata Ray

Eng. Comput., 2010

Tracking a Generator by Persistence.

[BibT_eX]

[DOI]

Oleksiy Busaryev

Discret. Math. Algorithms Appl., 2010

Delaunay Refinement for Piecewise Smooth Complexes.

[BibT_eX]

[DOI]

Edgar A. Ramos

Discret. Comput. Geom., 2010

Defining and Computing Topological Persistence for 1-cocycles

[BibT_eX]

[DOI]

Dan Burghelea

CoRR, 2010

Localized Delaunay Refinement for Sampling and Meshing.

[BibT_eX]

[DOI]

Andrew G. Slatton

Comput. Graph. Forum, 2010

Persistent Heat Signature for Pose-oblivious Matching of Incomplete Models.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2010

Convergence, Stability, and Discrete Approximation of Laplace Spectra.

[BibT_eX]

[DOI]

Pawas Ranjan

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Approximating loops in a shortest homology basis from point data.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Isotopic Reconstruction of Surfaces with Boundaries.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2009

Persistence-based handle and tunnel loops computation revisited for speed up.

[BibT_eX]

[DOI]

Comput. Graph., 2009

Computing handle and tunnel loops with knot linking.

[BibT_eX]

[DOI]

Comput. Aided Des., 2009

Delaunay Meshing of Piecewise Smooth Complexes without Expensive Predicates.

[BibT_eX]

[DOI]

Algorithms, 2009

Repairing and meshing imperfect shapes with Delaunay refinement.

[BibT_eX]

[DOI]

Oleksiy Busaryev

Proceedings of the 2009 ACM Symposium on Solid and Physical Modeling, 2009

Cut locus and topology from surface point data.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008

Delaunay meshing of isosurfaces.

[BibT_eX]

[DOI]

Vis. Comput., 2008

Computing geometry-aware handle and tunnel loops in 3D models.

[BibT_eX]

[DOI]

ACM Trans. Graph., 2008

Critical Points of Distance to an epsilon-Sampling of a Surface and Flow-Complex-Based Surface Reconstruction.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2008

Recursive geometry of the flow complex and topology of the flow complex filtration.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Maintaining deforming surface meshes.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Delpsc: a delaunay mesher for piecewise smooth complexes.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

Sampling and Meshing a Surface with Guaranteed Topology and Geometry.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Stability of Critical Points with Interval Persistence.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2007

Delaunay Edge Flips in Dense Surface Triangulations

[BibT_eX]

[DOI]

CoRR, 2007

Delaunay triangulations approximate anchor hulls.

[BibT_eX]

[DOI]

Comput. Geom., 2007

A Delaunay Simplification Algorithm for Vector Fields.

[BibT_eX]

[DOI]

Proceedings of the 15th Pacific Conference on Computer Graphics and Applications, 2007

A Practical Delaunay Meshing Algorithm for aLarge Class of Domains*.

[BibT_eX]

[DOI]

Proceedings of the 16th International Meshing Roundtable, 2007

On Computing Handle and Tunnel Loops.

[BibT_eX]

[DOI]

Proceedings of the 2007 International Conference on Cyberworlds, 2007

2006

Provable surface reconstruction from noisy samples.

[BibT_eX]

[DOI]

Comput. Geom., 2006

Anisotropic surface meshing.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Identifying flat and tubular regions of a shape by unstable manifolds.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Solid and Physical Modeling 2006, 2006

Defining and computing curve-skeletons with medial geodesic function.

[BibT_eX]

[DOI]

Proceedings of the Fourth Eurographics Symposium on Geometry Processing, Cagliari, 2006

Delaunay Meshing of Surfaces.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Normal and Feature Approximations from Noisy Point Clouds.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005

Quality Meshing of Polyhedra with Small Angles.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2005

Normal Estimation for Point Clouds: A Comparison Study for a Voronoi Based Method.

[BibT_eX]

[DOI]

Gang Li

Proceedings of the 2nd Symposium on Point Based Graphics, 2005

Manifold reconstruction from point samples.

[BibT_eX]

[DOI]

Edgar A. Ramos

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

. An Adaptive MLS Surface for Reconstruction with Guarantees.

[BibT_eX]

[DOI]

Proceedings of the Third Eurographics Symposium on Geometry Processing, 2005

Polygonal Surface Remeshing with Delaunay Refinement.

[BibT_eX]

[DOI]

Gang Li

Tathagata Ray

Proceedings of the 14th International Meshing Roundtable, 2005

Weighted Delaunay Refinement for Polyhedra with Small Angles.

[BibT_eX]

[DOI]

Tathagata Ray

Proceedings of the 14th International Meshing Roundtable, 2005

2004

Curve and Surface Reconstruction.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Hierarchy of surface models and irreducible triangulations.

[BibT_eX]

[DOI]

Sheung-Hung Poon

Comput. Geom., 2004

Approximate medial axis as a Voronoi subcomplex.

[BibT_eX]

[DOI]

Comput. Aided Des., 2004

Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee.

[BibT_eX]

[DOI]

Algorithmica, 2004

Shape Segmentation and Matching from Noisy Point Clouds.

[BibT_eX]

[DOI]

Proceedings of the 1st Symposium on Point Based Graphics, 2004

2003

Quality Meshing with Weighted Delaunay Refinement.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Tight Cocone: A Water-tight Surface Reconstructor.

[BibT_eX]

[DOI]

J. Comput. Inf. Sci. Eng., 2003

Shape Dimension and Approximation from Samples.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2003

Shape Segmentation and Matching with Flow Discretization.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Alpha-shapes and flow shapes are homotopy equivalent.

[BibT_eX]

[DOI]

Matthias John

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Approximate medial axis for CAD models.

[BibT_eX]

[DOI]

Hyuckje Woo

Proceedings of the Eighth ACM Symposium on Solid Modeling and Applications 2003, 2003

Sample Based Geometric Modeling.

[BibT_eX]

[DOI]

Proceedings of the Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, 2003

2002

Volume and Surface Triangulations - Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2002

Fast Reconstruction of Curves with Sharp Corners.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2002

A Simple Algorithm for Homeomorphic Surface Reconstruction.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2002

PMR: Point to Mesh Rendering, A Feature-Based Approach.

[BibT_eX]

[DOI]

Proceedings of the 13th IEEE Visualization Conference, 2002

Hierarchy of Surface Models and Irreducible Triangulation.

[BibT_eX]

[DOI]

Sheung-Hung Poon

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Computing Shapes from Point Cloud Data.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

2001

Dynamic Skin Triangulation.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

Polytopes in Arrangements.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

Reconstructing curves with sharp corners.

[BibT_eX]

[DOI]

Comput. Geom., 2001

Undersampling and Oversampling in Sample Based Shape Modeling.

[BibT_eX]

[DOI]

Proceedings of the 12th IEEE Visualization Conference, 2001

Delaunay based shape reconstruction from large data.

[BibT_eX]

[DOI]

Proceedings of the IEEE 2001 Symposium on Parallel and Large-Data Visualization and Graphics, 2001

Sample Shuffling For Quality Hierarchic Surface Meshing.

[BibT_eX]

[DOI]

Proceedings of the 10th International Meshing Roundtable, 2001

Robustness Issues in Surface Reconstruction.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2001, 2001

Detecting undersampling in surface reconstruction.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Decimating samples for mesh simplification.

[BibT_eX]

[DOI]

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000

Sliver exudation.

[BibT_eX]

[DOI]

J. ACM, 2000

Curve reconstruction: Connecting dots with good reason.

[BibT_eX]

[DOI]

Kurt Mehlhorn

Edgar A. Ramos

Comput. Geom., 2000

Reconstruction curves with sharp corners.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999

Discrete And Computational Geometry.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Transforming Curves on Surfaces.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1999

Emerging Challenges in Computational Topology

[BibT_eX]

[DOI]

CoRR, 1999

A Simple Provable Algorithm for Curve Reconstruction.

[BibT_eX]

[DOI]

Piyush Kumar

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Approximate Minimum Weight Steiner Triangulation in Three Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Improved constructions of Delaunay based contour surfaces.

[BibT_eX]

[DOI]

Proceedings of the Fifth ACM Symposium on Solid Modeling and Applications, 1999

1998

Computing Homology Groups of Simplicial Complexes in R3.

[BibT_eX]

[DOI]

J. ACM, 1998

Extremal Problems for Geometric Hypergraphs.

[BibT_eX]

[DOI]

János Pach

Discret. Comput. Geom., 1998

Improved Bounds for Planar k -Sets and Related Problems.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

Visibility with One Reflection.

[BibT_eX]

[DOI]

Alan R. Davis

Discret. Comput. Geom., 1998

Visibility with Multiple Reflections.

[BibT_eX]

[DOI]

Alan R. Davis

Discret. Comput. Geom., 1998

Visibility with multiple diffuse reflections.

[BibT_eX]

[DOI]

Comput. Geom., 1998

1997

Optimal Algorithms to Detect Null-Homologous Cycles on 2-Manifolds.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1997

On the Number of Simplicial Complexes in D.

[BibT_eX]

[DOI]

Comput. Geom., 1997

Triangulating with High Connectivity.

[BibT_eX]

[DOI]

Michael B. Dillencourt

Subir Kumar Ghosh

Jason M. Cahill

Comput. Geom., 1997

Approximating Geometric Domains through Topological Triangulations.

[BibT_eX]

[DOI]

Arunabha Roy

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997

Improved Bounds on Planar k-sets and k-levels.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

Algorithms for Manifolds and Simplicial Complexes in Euclidean 3-Space (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995

A New Technique To Compute Polygonal Schema for 2-Manifolds with Application to Null-homotopy Detection.

[BibT_eX]

[DOI]

Haijo Schipper

Discret. Comput. Geom., 1995

Optimal Algorithms for Curves on Surfaces.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Visibility with Reflection.

[BibT_eX]

[DOI]

Alan R. Davis

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

On the number of simplicial complexes in Rd.

[BibT_eX]

[DOI]

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994

Many-Face Complexity in Incremental Convex Arrangements.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Counting Triangle Crossing and Halving Planes.

[BibT_eX]

[DOI]

Herbert Edelsbrunner

Discret. Comput. Geom., 1994

A New Technique to Compute Polygonal Schema for 2-Manifolds with Application to Null-Homotopy Detection.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Triangulating with High Connectivity.

[BibT_eX]

Michael B. Dillencourt

Subir Kumar Ghosh

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

On Counting Triangulations in D Dimensions.

[BibT_eX]

[DOI]

Comput. Geom., 1993

Counting Triangle Crossings and Halving Planes.

[BibT_eX]

[DOI]

Herbert Edelsbrunner

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992

Convex Decomposition of Polyhedra and Robustness.

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

On good triangulations in three dimensions.

[BibT_eX]

[DOI]

Kokichi Sugihara

Int. J. Comput. Geom. Appl., 1992

Delaunay triangulations in three dimensions with finite precision arithmetic.

[BibT_eX]

[DOI]

Kokichi Sugihara

Comput. Aided Geom. Des., 1992

1991

Decompositions of polyhedra in three dimensions

[BibT_eX]

[DOI]

PhD thesis, 1991

Triangulation and CSG Representation of Polyhedra with Arbitrary Genus.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

Polygon Nesting and Robustness.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

1989

Robust Decompositions of Polyhedra.

[BibT_eX]

[DOI]