Tamal K. Dey

According to our database1, Tamal K. Dey authored at least 161 papers between 1989 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Filtration Simplification for Persistent Homology via Edge Contraction.
J. Math. Imaging Vis., 2020

Computing Minimal Persistent Cycles: Polynomial and Hard Cases.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Persistence of the Conley Index in Combinatorial Dynamical Systems.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

An Efficient Algorithm for 1-Dimensional (Persistent) Path Homology.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
Persistent Homology of Morse Decompositions in Combinatorial Dynamics.
SIAM J. Applied Dynamical Systems, 2019

SimBa: An Efficient Tool for Approximating Rips-filtration Persistence via Simplicial Batch Collapse.
ACM J. Exp. Algorithmics, 2019

Generalized Persistence Algorithm for Decomposing Multi-parameter Persistence Modules.
CoRR, 2019

Spectral concentration and greedy <i>k</i>-clustering.
Comput. Geom., 2019

Computing Height Persistence and Homology Generators in R<sup>3</sup> Efficiently.
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.
Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2019

Persistent 1-Cycles: Definition, Computation, and Its Application.
Proceedings of the Computational Topology in Image Context - 7th International Workshop, 2019

2018
Declutter and resample: Towards parameter free denoising.
JoCG, 2018

Edge contraction in persistence-generated discrete Morse vector fields.
Comput. Graph., 2018

Protein Classification with Improved Topological Data Analysis.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Efficient Algorithms for Computing a Minimal Homology Basis.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Computing Bottleneck Distance for 2-D Interval Decomposable Modules.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Graph Reconstruction by Discrete Morse Theory.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
Improved Image Classification using Topological Persistence.
Proceedings of the 22nd International Symposium on Vision, Modeling, and Visualization, 2017

Parameter-free Topology Inference and Sparsification for Data on Manifolds.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Temporal Hierarchical Clustering.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Improved Road Network Reconstruction using Discrete Morse Theory.
Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

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

Topological Analysis of Nerves, Reeb Spaces, Mappers, and Multiscale Mappers.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Smooth Surface and Volume Meshing.
Encyclopedia of Algorithms, 2016

Meshing Piecewise Smooth Complexes.
Encyclopedia of Algorithms, 2016

Multiscale Mapper: Topological Summarization via Codomain Covers.
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.
CoRR, 2015

Graph induced complex on point data.
Comput. Geom., 2015

Automatic posing of a meshed human model using point clouds.
Comput. Graph., 2015

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

Comparing Graphs via Persistence Distortion.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

Topological Analysis of Scalar Fields with Outliers.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

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

Normal variation for adaptive feature size.
CoRR, 2014

Computing Topological Persistence for Simplicial Maps.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Dimension Detection with Local Homology.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Computational Topology in Reconstruction, Mesh Generation, and Data Analysis.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
An efficient computation of handle and tunnel loops via Reeb graphs.
ACM Trans. Graph., 2013

Adaptive fracture simulation of multi-layered thin plates.
ACM Trans. Graph., 2013

Reeb Graphs: Approximation and Persistence.
Discret. Comput. Geom., 2013

Guest Editors' Foreword.
Discret. Comput. Geom., 2013

Topological Persistence for Circle-Valued Maps.
Discret. Comput. Geom., 2013

Edge Contractions and Simplicial Homology
CoRR, 2013

Voronoi-based feature curves extraction for sampled singular surfaces.
Comput. Graph., 2013

Weighted Graph Laplace Operator under Topological Noise.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Localized delaunay refinement for piecewise-smooth complexes.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

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

2012
Eigen deformation of 3D models.
Vis. Comput., 2012

Animating bubble interactions in a liquid foam.
ACM Trans. Graph., 2012

Meshing interfaces of multi-label data with Delaunay refinement.
Eng. Comput., 2012

Feature-Preserving Reconstruction of Singular Surfaces.
Comput. Graph. Forum, 2012

Annotating Simplices with a Homology Basis and Its Applications.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

2011
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming.
SIAM J. Comput., 2011

Annotating Simplices with a Homology Basis and Its Applications
CoRR, 2011

Persistence for Circle Valued Maps
CoRR, 2011

Localized Delaunay Refinement for Volumes.
Comput. Graph. Forum, 2011

Localized Cocone surface reconstruction.
Comput. Graph., 2011

Geometry and Topology from Point Cloud Data.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

2010
Polygonal surface remeshing with Delaunay refinement.
Eng. Comput., 2010

Tracking a Generator by Persistence.
Discrete Math., Alg. and Appl., 2010

Delaunay Refinement for Piecewise Smooth Complexes.
Discret. Comput. Geom., 2010

Defining and Computing Topological Persistence for 1-cocycles
CoRR, 2010

Localized Delaunay Refinement for Sampling and Meshing.
Comput. Graph. Forum, 2010

Persistent Heat Signature for Pose-oblivious Matching of Incomplete Models.
Comput. Graph. Forum, 2010

Convergence, Stability, and Discrete Approximation of Laplace Spectra.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Approximating loops in a shortest homology basis from point data.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
Isotopic Reconstruction of Surfaces with Boundaries.
Comput. Graph. Forum, 2009

Persistence-based handle and tunnel loops computation revisited for speed up.
Comput. Graph., 2009

Computing handle and tunnel loops with knot linking.
Comput. Aided Des., 2009

Delaunay Meshing of Piecewise Smooth Complexes without Expensive Predicates.
Algorithms, 2009

Repairing and meshing imperfect shapes with Delaunay refinement.
Proceedings of the 2009 ACM Symposium on Solid and Physical Modeling, 2009

Cut locus and topology from surface point data.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
Delaunay meshing of isosurfaces.
Vis. Comput., 2008

Computing geometry-aware handle and tunnel loops in 3D models.
ACM Trans. Graph., 2008

Critical Points of Distance to an epsilon-Sampling of a Surface and Flow-Complex-Based Surface Reconstruction.
Int. J. Comput. Geom. Appl., 2008

Recursive geometry of the flow complex and topology of the flow complex filtration.
Comput. Geom., 2008

Maintaining deforming surface meshes.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Delpsc: a delaunay mesher for piecewise smooth complexes.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Sampling and Meshing a Surface with Guaranteed Topology and Geometry.
SIAM J. Comput., 2007

Stability of Critical Points with Interval Persistence.
Discret. Comput. Geom., 2007

Delaunay Edge Flips in Dense Surface Triangulations
CoRR, 2007

Delaunay triangulations approximate anchor hulls.
Comput. Geom., 2007

A Delaunay Simplification Algorithm for Vector Fields.
Proceedings of the 15th Pacific Conference on Computer Graphics and Applications, 2007

A Practical Delaunay Meshing Algorithm for aLarge Class of Domains*.
Proceedings of the 16th International Meshing Roundtable, 2007

On Computing Handle and Tunnel Loops.
Proceedings of the 2007 International Conference on Cyberworlds, 2007

2006
Provable surface reconstruction from noisy samples.
Comput. Geom., 2006

Anisotropic surface meshing.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Identifying flat and tubular regions of a shape by unstable manifolds.
Proceedings of the ACM Symposium on Solid and Physical Modeling 2006, 2006

Defining and computing curve-skeletons with medial geodesic function.
Proceedings of the Fourth Eurographics Symposium on Geometry Processing, Cagliari, 2006

Delaunay Meshing of Surfaces.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Normal and Feature Approximations from Noisy Point Clouds.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005
Quality Meshing of Polyhedra with Small Angles.
Int. J. Comput. Geom. Appl., 2005

Normal Estimation for Point Clouds: A Comparison Study for a Voronoi Based Method.
Proceedings of the 2nd Symposium on Point Based Graphics, 2005

Manifold reconstruction from point samples.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

. An Adaptive MLS Surface for Reconstruction with Guarantees.
Proceedings of the Third Eurographics Symposium on Geometry Processing, 2005

Polygonal Surface Remeshing with Delaunay Refinement.
Proceedings of the 14th International Meshing Roundtable, 2005

Weighted Delaunay Refinement for Polyhedra with Small Angles.
Proceedings of the 14th International Meshing Roundtable, 2005

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

Hierarchy of surface models and irreducible triangulations.
Comput. Geom., 2004

Approximate medial axis as a Voronoi subcomplex.
Comput. Aided Des., 2004

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

Shape Segmentation and Matching from Noisy Point Clouds.
Proceedings of the 1st Symposium on Point Based Graphics, 2004

2003
Quality Meshing with Weighted Delaunay Refinement.
SIAM J. Comput., 2003

Tight Cocone: A Water-tight Surface Reconstructor.
J. Comput. Inf. Sci. Eng., 2003

Shape Dimension and Approximation from Samples.
Discret. Comput. Geom., 2003

Shape Segmentation and Matching with Flow Discretization.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Alpha-shapes and flow shapes are homotopy equivalent.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Approximate medial axis for CAD models.
Proceedings of the Eighth ACM Symposium on Solid Modeling and Applications 2003, 2003

Sample Based Geometric Modeling.
Proceedings of the Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, 2003

2002
Volume and Surface Triangulations - Preface.
Int. J. Found. Comput. Sci., 2002

Fast Reconstruction of Curves with Sharp Corners.
Int. J. Comput. Geom. Appl., 2002

A Simple Algorithm for Homeomorphic Surface Reconstruction.
Int. J. Comput. Geom. Appl., 2002

PMR: Point to Mesh Rendering, A Feature-Based Approach.
Proceedings of the IEEE Visualization 2002, October 27-November 01, 2002, Boston, MA, USA., 2002

Hierarchy of Surface Models and Irreducible Triangulation.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Computing Shapes from Point Cloud Data.
Proceedings of the Algorithms, 2002

2001
Dynamic Skin Triangulation.
Discret. Comput. Geom., 2001

Polytopes in Arrangements.
Discret. Comput. Geom., 2001

Reconstructing curves with sharp corners.
Comput. Geom., 2001

Undersampling and Oversampling in Sample Based Shape Modeling.
Proceedings of the IEEE Visualization 2001, 2001

Delaunay based shape reconstruction from large data.
Proceedings of the IEEE 2001 Symposium on Parallel and Large-Data Visualization and Graphics, 2001

Sample Shuffling For Quality Hierarchic Surface Meshing.
Proceedings of the 10th International Meshing Roundtable, 2001

Robustness Issues in Surface Reconstruction.
Proceedings of the Computational Science - ICCS 2001, 2001

Detecting undersampling in surface reconstruction.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Decimating samples for mesh simplification.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
Sliver exudation.
J. ACM, 2000

Curve reconstruction: Connecting dots with good reason.
Comput. Geom., 2000

Reconstruction curves with sharp corners.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999
Discrete And Computational Geometry.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Transforming Curves on Surfaces.
J. Comput. Syst. Sci., 1999

Emerging Challenges in Computational Topology
CoRR, 1999

A Simple Provable Algorithm for Curve Reconstruction.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Approximate Minimum Weight Steiner Triangulation in Three Dimensions.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Improved constructions of Delaunay based contour surfaces.
Proceedings of the Fifth ACM Symposium on Solid Modeling and Applications, 1999

1998
Computing Homology Groups of Simplicial Complexes in R<sup>3</sup>.
J. ACM, 1998

Extremal Problems for Geometric Hypergraphs.
Discret. Comput. Geom., 1998

Improved Bounds for Planar k -Sets and Related Problems.
Discret. Comput. Geom., 1998

Visibility with One Reflection.
Discret. Comput. Geom., 1998

Visibility with Multiple Reflections.
Discret. Comput. Geom., 1998

Visibility with multiple diffuse reflections.
Comput. Geom., 1998

1997
Optimal Algorithms to Detect Null-Homologous Cycles on 2-Manifolds.
Int. J. Comput. Geom. Appl., 1997

On the Number of Simplicial Complexes in D.
Comput. Geom., 1997

Triangulating with High Connectivity.
Comput. Geom., 1997

Approximating Geometric Domains through Topological Triangulations.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997

Improved Bounds on Planar k-sets and k-levels.
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).
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.
Discret. Comput. Geom., 1995

Optimal Algorithms for Curves on Surfaces.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Visibility with Reflection.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

On the number of simplicial complexes in R<sup>d</sup>.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994
Many-Face Complexity in Incremental Convex Arrangements.
Inf. Process. Lett., 1994

Counting Triangle Crossing and Halving Planes.
Discret. Comput. Geom., 1994

A New Technique to Compute Polygonal Schema for 2-Manifolds with Application to Null-Homotopy Detection.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Triangulating with High Connectivity.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
On Counting Triangulations in D Dimensions.
Comput. Geom., 1993

Counting Triangle Crossings and Halving Planes.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992
Convex Decomposition of Polyhedra and Robustness.
SIAM J. Comput., 1992

On good triangulations in three dimensions.
Int. J. Comput. Geom. Appl., 1992

Delaunay triangulations in three dimensions with finite precision arithmetic.
Comput. Aided Geom. Des., 1992

1991
Triangulation and CSG Representation of Polyhedra with Arbitrary Genus.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990
Polygon Nesting and Robustness.
Inf. Process. Lett., 1990

1989
Robust Decompositions of Polyhedra.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989


  Loading...