Search the dblp DataBase
Tamal K. Dey :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Tamal K. Dey Optimal Algorithms to Detect Null-homologous Cycles on 2-manifolds. [Citation Graph (0, 0)][DBLP ] CCCG, 1993, pp:273-278 [Conf ] Tamal K. Dey , Michael B. Dillencourt , Subir Kumar Ghosh Triangulating with High Connectivity. [Citation Graph (0, 0)][DBLP ] CCCG, 1994, pp:339-343 [Conf ] Tamal K. Dey , Joachim Giesen , James Hudson Decimating samples for mesh simplification. [Citation Graph (0, 0)][DBLP ] CCCG, 2001, pp:85-88 [Conf ] Tamal K. Dey Triangulation and CSG Representation of Polyhedra with Arbitrary Genus. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1991, pp:364-371 [Conf ] Tamal K. Dey A New Technique to Compute Polygonal Schema for 2-Manifolds with Application to Null-Homotopy Detection. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1994, pp:277-284 [Conf ] Nina Amenta , Sunghee Choi , Tamal K. Dey , N. Leekha A simple algorithm for homeomorphic surface reconstruction. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2000, pp:213-222 [Conf ] Boris Aronov , Tamal K. Dey Polytopes in Arrangements. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1999, pp:154-162 [Conf ] Boris Aronov , Alan R. Davis , Tamal K. Dey , Sudebkumar Prasant Pal , D. Chithra Prasad Visibility with Reflection. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1995, pp:316-325 [Conf ] Siu-Wing Cheng , Tamal K. Dey , Herbert Edelsbrunner , Michael A. Facello , Shang-Hua Teng Sliver Exudation. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1999, pp:1-13 [Conf ] Siu-Wing Cheng , Tamal K. Dey , Edgar A. Ramos , Tathagata Ray Sampling and meshing a surface with guaranteed topology and geometry. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:280-289 [Conf ] Siu-Wing Cheng , Tamal K. Dey , Edgar A. Ramos , Tathagata Ray Quality meshing for polyhedra with small angles. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:290-299 [Conf ] Tamal K. Dey , Herbert Edelsbrunner Counting Triangle Crossings and Halving Planes. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:270-273 [Conf ] Tamal K. Dey , Joachim Giesen Detecting undersampling in surface reconstruction. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2001, pp:257-263 [Conf ] Tamal K. Dey , Samrat Goswami Provable surface reconstruction from noisy samples. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:330-339 [Conf ] Tamal K. Dey , Joachim Giesen , Edgar A. Ramos , Bardia Sadri Critical points of the distance to an epsilon-sampling of a surface and flow-complex-based surface reconstruction. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2005, pp:218-227 [Conf ] Tamal K. Dey , Kurt Mehlhorn , Edgar A. Ramos Curve Reconstruction: Connecting Dots with Good Reason. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1999, pp:197-206 [Conf ] Tamal K. Dey , Rephael Wenger Reconstruction curves with sharp corners. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2000, pp:233-241 [Conf ] Tamal K. Dey , Wulue Zhao Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee. [Citation Graph (0, 0)][DBLP ] ESA, 2002, pp:387-398 [Conf ] Tamal K. Dey Computing Shapes from Point Cloud Data. [Citation Graph (0, 0)][DBLP ] ESA, 2002, pp:2- [Conf ] Tamal K. Dey Improved Bounds on Planar k-sets and k-levels. [Citation Graph (0, 0)][DBLP ] FOCS, 1997, pp:165-161 [Conf ] Tamal K. Dey , Sumanta Guha Optimal Algorithms for Curves on Surfaces. [Citation Graph (0, 0)][DBLP ] FOCS, 1995, pp:266-274 [Conf ] Chandrajit L. Bajaj , Tamal K. Dey Robust Decompositions of Polyhedra. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1989, pp:267-279 [Conf ] Tamal K. Dey , Arunabha Roy , Nimish R. Shah Approximating Geometric Domains through Topological Triangulations. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1997, pp:6-21 [Conf ] Tamal K. Dey , Jian Sun Normal and Feature Approximations from Noisy Point Clouds. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2006, pp:21-32 [Conf ] Tamal K. Dey , Joachim Giesen , Wulue Zhao Robustness Issues in Surface Reconstruction. [Citation Graph (0, 0)][DBLP ] International Conference on Computational Science (1), 2001, pp:658-662 [Conf ] Tamal K. Dey Delaunay Meshing of Surfaces. [Citation Graph (0, 0)][DBLP ] ISAAC, 2006, pp:2- [Conf ] Siu-Wing Cheng , Tamal K. Dey , Sheung-Hung Poon Hierarchy of Surface Models and Irreducible Triangulation. [Citation Graph (0, 0)][DBLP ] ISAAC, 2002, pp:286-295 [Conf ] Tamal K. Dey , János Pach Extremal Problems for Geometric Hypergraphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 1996, pp:105-114 [Conf ] Tamal K. Dey , Joachim Giesen , James Hudson Delaunay based shape reconstruction from large data. [Citation Graph (0, 0)][DBLP ] IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2001, pp:19-27 [Conf ] Tamal K. Dey , Jian Sun . An Adaptive MLS Surface for Reconstruction with Guarantees. [Citation Graph (0, 0)][DBLP ] Symposium on Geometry Processing, 2005, pp:43-52 [Conf ] Tamal K. Dey , Chandrajit L. Bajaj , Kokichi Sugihara On good triangulations in three dimensions. [Citation Graph (0, 0)][DBLP ] Symposium on Solid Modeling and Applications, 1991, pp:431-441 [Conf ] Tamal K. Dey , Samrat Goswami Tight cocone: a water-tight surface reconstructor. [Citation Graph (0, 0)][DBLP ] Symposium on Solid Modeling and Applications, 2003, pp:127-134 [Conf ] Tamal K. Dey , Hyuckje Woo , Wulue Zhao Approximate medial axis for CAD models. [Citation Graph (0, 0)][DBLP ] Symposium on Solid Modeling and Applications, 2003, pp:280-285 [Conf ] Tamal K. Dey , Wulue Zhao Approximate medial axis as a voronoi subcomplex. [Citation Graph (0, 0)][DBLP ] Symposium on Solid Modeling and Applications, 2002, pp:356-366 [Conf ] Samrat Goswami , Tamal K. Dey , Chandrajit L. Bajaj Identifying flat and tubular regions of a shape by unstable manifolds. [Citation Graph (0, 0)][DBLP ] Symposium on Solid and Physical Modeling, 2006, pp:27-37 [Conf ] Siu-Wing Cheng , Tamal K. Dey Improved constructions of Delaunay based contour surfaces. [Citation Graph (0, 0)][DBLP ] Symposium on Solid Modeling and Applications, 1999, pp:322-323 [Conf ] Siu-Wing Cheng , Tamal K. Dey Quality meshing with weighted Delaunay refinement. [Citation Graph (0, 0)][DBLP ] SODA, 2002, pp:137-146 [Conf ] Siu-Wing Cheng , Tamal K. Dey Approximate Minimum Weight Steiner Triangulation in Three Dimensions. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:205-214 [Conf ] Ho-Lun Cheng , Tamal K. Dey , Herbert Edelsbrunner , John Sullivan Dynamic skin triangulation. [Citation Graph (0, 0)][DBLP ] SODA, 2001, pp:47-56 [Conf ] Siu-Wing Cheng , Tamal K. Dey , Edgar A. Ramos Manifold reconstruction from point samples. [Citation Graph (0, 0)][DBLP ] SODA, 2005, pp:1018-1027 [Conf ] Siu-Wing Cheng , Tamal K. Dey , Edgar A. Ramos , Rephael Wenger Anisotropic surface meshing. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:202-211 [Conf ] Tamal K. Dey , Joachim Giesen , Samrat Goswami Delaunay triangulations approximate anchor hulls. [Citation Graph (0, 0)][DBLP ] SODA, 2005, pp:1028-1037 [Conf ] Tamal K. Dey , Joachim Giesen , Samrat Goswami , Wulue Zhao Shape dimension and approximation from samples. [Citation Graph (0, 0)][DBLP ] SODA, 2002, pp:772-780 [Conf ] Tamal K. Dey , Piyush Kumar A Simple Provable Algorithm for Curve Reconstruction. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:893-894 [Conf ] Tamal K. Dey , Sumanta Guha Algorithms for Manifolds and Simplicial Complexes in Euclidean 3-Space (Preliminary Version). [Citation Graph (0, 0)][DBLP ] STOC, 1996, pp:398-407 [Conf ] Tamal K. Dey , Joachim Giesen , Matthias John Alpha-shapes and flow shapes are homotopy equivalent. [Citation Graph (0, 0)][DBLP ] STOC, 2003, pp:493-502 [Conf ] Boris Aronov , Alan R. Davis , Tamal K. Dey , Sudebkumar Prasant Pal , D. Chithra Prasad Visibility with Multiple Reflections. [Citation Graph (0, 0)][DBLP ] SWAT, 1996, pp:284-295 [Conf ] Tamal K. Dey , Joachim Giesen , Samrat Goswami , James Hudson , Rephael Wenger , Wulue Zhao Undersampling and Oversampling in Sample Based Shape Modeling. [Citation Graph (0, 0)][DBLP ] IEEE Visualization, 2001, pp:- [Conf ] Tamal K. Dey , James Hudson PMR: Point to Mesh Rendering, A Feature-Based Approach. [Citation Graph (0, 0)][DBLP ] IEEE Visualization, 2002, pp:- [Conf ] Tamal K. Dey , Joachim Giesen , Samrat Goswami Shape Segmentation and Matching with Flow Discretization. [Citation Graph (0, 0)][DBLP ] WADS, 2003, pp:25-36 [Conf ] Tamal K. Dey , Wulue Zhao Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2003, v:38, n:1, pp:179-200 [Journal ] Tamal K. Dey , Wulue Zhao Approximate medial axis as a Voronoi subcomplex. [Citation Graph (0, 0)][DBLP ] Computer-Aided Design, 2004, v:36, n:2, pp:195-202 [Journal ] Tamal K. Dey , Kokichi Sugihara , Chandrajit L. Bajaj Delaunay triangulations in three dimensions with finite precision arithmetic. [Citation Graph (0, 0)][DBLP ] Computer Aided Geometric Design, 1992, v:9, n:6, pp:457-470 [Journal ] Tamal K. Dey , Michael B. Dillencourt , Subir Kumar Ghosh , Jason M. Cahill Triangulating with High Connectivity. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:39-56 [Journal ] Tamal K. Dey On Counting Triangulations in D Dimensions. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1993, v:3, n:, pp:315-325 [Journal ] Siu-Wing Cheng , Tamal K. Dey , Sheung-Hung Poon Hierarchy of surface models and irreducible triangulations. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2004, v:27, n:2, pp:135-150 [Journal ] Tamal K. Dey , Samrat Goswami Provable surface reconstruction from noisy samples. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2006, v:35, n:1-2, pp:124-141 [Journal ] Tamal K. Dey , Kurt Mehlhorn , Edgar A. Ramos Curve reconstruction: Connecting dots with good reason. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2000, v:15, n:4, pp:229-244 [Journal ] Tamal K. Dey , Nimish R. Shah On the Number of Simplicial Complexes in D. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:267-277 [Journal ] Tamal K. Dey , Rephael Wenger Reconstructing curves with sharp corners. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2001, v:19, n:2-3, pp:89-99 [Journal ] D. Chithra Prasad , Sudebkumar Prasant Pal , Tamal K. Dey Visibility with multiple diffuse reflections. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1998, v:10, n:3, pp:187-196 [Journal ] Tamal K. Dey , Joachim Giesen , Samrat Goswami Delaunay triangulations approximate anchor hulls. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2007, v:36, n:2, pp:131-143 [Journal ] Marshall W. Bern , David Eppstein , Pankaj K. Agarwal , Nina Amenta , L. Paul Chew , Tamal K. Dey , David P. Dobkin , Herbert Edelsbrunner , Cindy Grimm , Leonidas J. Guibas , John Harer , Joel Hass , Andrew Hicks , Carroll K. Johnson , Gilad Lerman , David Letscher , Paul E. Plassmann , Eric Sedgwick , Jack Snoeyink , Jeff Weeks , Chee-Keng Yap , Denis Zorin Emerging Challenges in Computational Topology [Citation Graph (0, 0)][DBLP ] CoRR, 1999, v:0, n:, pp:- [Journal ] Tamal K. Dey Improved Bounds for Planar k -Sets and Related Problems. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1998, v:19, n:3, pp:373-382 [Journal ] Boris Aronov , Tamal K. Dey Polytopes in Arrangements. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 2001, v:25, n:1, pp:51-63 [Journal ] Boris Aronov , Alan R. Davis , Tamal K. Dey , Sudebkumar Prasant Pal , D. Chithra Prasad Visibility with Multiple Reflections. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1998, v:20, n:1, pp:61-78 [Journal ] Boris Aronov , Alan R. Davis , Tamal K. Dey , Sudebkumar Prasant Pal , D. Chithra Prasad Visibility with One Reflection. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1998, v:19, n:4, pp:553-574 [Journal ] Ho-Lun Cheng , Tamal K. Dey , Herbert Edelsbrunner , John Sullivan Dynamic Skin Triangulation. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 2001, v:25, n:4, pp:525-568 [Journal ] Tamal K. Dey , Herbert Edelsbrunner Counting Triangle Crossing and Halving Planes. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1994, v:12, n:, pp:231-289 [Journal ] Tamal K. Dey , Joachim Giesen , Samrat Goswami , Wulue Zhao Shape Dimension and Approximation from Samples. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 2003, v:29, n:3, pp:419-434 [Journal ] Tamal K. Dey , János Pach Extremal Problems for Geometric Hypergraphs. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1998, v:19, n:4, pp:473-484 [Journal ] Tamal K. Dey , Haijo Schipper A New Technique To Compute Polygonal Schema for 2-Manifolds with Application to Null-homotopy Detection. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1995, v:14, n:1, pp:93-110 [Journal ] Tamal K. Dey Optimal Algorithms to Detect Null-Homologous Cycles on 2-Manifolds. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1997, v:7, n:3, pp:167-174 [Journal ] Nina Amenta , Sunghee Choi , Tamal K. Dey , N. Leekha A Simple Algorithm for Homeomorphic Surface Reconstruction. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2002, v:12, n:1-2, pp:125-141 [Journal ] Siu-Wing Cheng , Tamal K. Dey , Edgar A. Ramos , Tathagata Ray Quality Meshing of Polyhedra with Small Angles. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2005, v:15, n:4, pp:421-461 [Journal ] Tamal K. Dey , Chandrajit L. Bajaj , Kokichi Sugihara On good triangulations in three dimensions. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1992, v:2, n:1, pp:75-95 [Journal ] Tamal K. Dey , Rephael Wenger Fast Reconstruction of Curves with Sharp Corners. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2002, v:12, n:5, pp:353-400 [Journal ] Siu-Wing Cheng , Tamal K. Dey Volume and Surface Triangulations - Preface. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2002, v:13, n:2, pp:161-162 [Journal ] Chandrajit L. Bajaj , Tamal K. Dey Polygon Nesting and Robustness. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1990, v:35, n:1, pp:23-32 [Journal ] Tamal K. Dey , Nimish R. Shah Many-Face Complexity in Incremental Convex Arrangements. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:51, n:5, pp:227-231 [Journal ] Siu-Wing Cheng , Tamal K. Dey , Herbert Edelsbrunner , Michael A. Facello , Shang-Hua Teng Sliver exudation. [Citation Graph (0, 0)][DBLP ] J. ACM, 2000, v:47, n:5, pp:883-904 [Journal ] Tamal K. Dey , Sumanta Guha Computing Homology Groups of Simplicial Complexes in R3 . [Citation Graph (0, 0)][DBLP ] J. ACM, 1998, v:45, n:2, pp:266-287 [Journal ] Tamal K. Dey , Samrat Goswami Tight Cocone: A Water-tight Surface Reconstructor. [Citation Graph (0, 0)][DBLP ] J. Comput. Inf. Sci. Eng., 2003, v:3, n:4, pp:302-307 [Journal ] Tamal K. Dey , Sumanta Guha Transforming Curves on Surfaces. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1999, v:58, n:2, pp:297-325 [Journal ] Chandrajit L. Bajaj , Tamal K. Dey Convex Decomposition of Polyhedra and Robustness. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1992, v:21, n:2, pp:339-364 [Journal ] Siu-Wing Cheng , Tamal K. Dey Quality Meshing with Weighted Delaunay Refinement. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2003, v:33, n:1, pp:69-93 [Journal ] Tamal K. Dey , Jian Sun Defining and computing curve-skeletons with medial geodesic function. [Citation Graph (0, 0)][DBLP ] Symposium on Geometry Processing, 2006, pp:143-152 [Conf ] Tamal K. Dey , Joshua A. Levine Delaunay Meshing of Isosurfaces. [Citation Graph (0, 0)][DBLP ] Shape Modeling International, 2007, pp:241-250 [Conf ] Siu-Wing Cheng , Tamal K. Dey , Edgar A. Ramos Delaunay refinement for piecewise smooth complexes. [Citation Graph (0, 0)][DBLP ] SODA, 2007, pp:1096-1105 [Conf ] Tracking a Generator by Persistence. [Citation Graph (, )][DBLP ] Delpsc: a delaunay mesher for piecewise smooth complexes. [Citation Graph (, )][DBLP ] Cut locus and topology from surface point data. [Citation Graph (, )][DBLP ] Approximating loops in a shortest homology basis from point data. [Citation Graph (, )][DBLP ] Polygonal Surface Remeshing with Delaunay Refinement. [Citation Graph (, )][DBLP ] Weighted Delaunay Refinement for Polyhedra with Small Angles. [Citation Graph (, )][DBLP ] A Practical Delaunay Meshing Algorithm for aLarge Class of Domains*. [Citation Graph (, )][DBLP ] A Delaunay Simplification Algorithm for Vector Fields. [Citation Graph (, )][DBLP ] Repairing and meshing imperfect shapes with Delaunay refinement. [Citation Graph (, )][DBLP ] Maintaining deforming surface meshes. [Citation Graph (, )][DBLP ] Convergence, Stability, and Discrete Approximation of Laplace Spectra. [Citation Graph (, )][DBLP ] Optimal homologous cycles, total unimodularity, and linear programming. [Citation Graph (, )][DBLP ] Computing handle and tunnel loops with knot linking. [Citation Graph (, )][DBLP ] Persistence-based handle and tunnel loops computation revisited for speed up. [Citation Graph (, )][DBLP ] Isotopic Reconstruction of Surfaces with Boundaries. [Citation Graph (, )][DBLP ] Recursive geometry of the flow complex and topology of the flow complex filtration. [Citation Graph (, )][DBLP ] Delaunay Edge Flips in Dense Surface Triangulations [Citation Graph (, )][DBLP ] Approximating Loops in a Shortest Homology Basis from Point Data [Citation Graph (, )][DBLP ] Optimal Homologous Cycles, Total Unimodularity, and Linear Programming [Citation Graph (, )][DBLP ] Stability of Critical Points with Interval Persistence. [Citation Graph (, )][DBLP ] Delaunay Refinement for Piecewise Smooth Complexes. [Citation Graph (, )][DBLP ] Search in 0.068secs, Finished in 0.073secs