#### Filter Results:

- Full text PDF available (83)

#### Publication Year

1970

2018

- This year (13)
- Last 5 years (43)
- Last 10 years (79)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Nina Amenta, Sunghee Choi, Tamal K. Dey, N. Leekha
- Symposium on Computational Geometry
- 2000

1 Introduct ion The problem of computing a piecewise linear approximation to a surface from a set of sample points on the surface has been a focus of research in solid modeling and graphics due toâ€¦ (More)

- Tamal K. Dey
- Discrete & Computational Geometry
- 1998

We prove anO(n(k + 1)1/3) upper bound for planar k-sets. This is the first considerable improvement on this bound after its early solution approximately 27 years ago. Our proof technique also appliesâ€¦ (More)

- Tamal K. Dey, Samrat Goswami
- Symposium on Solid Modeling and Applications
- 2003

Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algorithms have beenâ€¦ (More)

- Tamal K. Dey, Jian Sun
- Symposium on Geometry Processing
- 2006

Many applications in geometric modeling, computer graphics, visualization and computer vision benefit from a reduced representation called curve-skeletons of a shape. These are curves possibly withâ€¦ (More)

- Tamal K. Dey, Joachim Giesen, Samrat Goswami
- WADS
- 2003

Geometric shapes are identified with their features. For computational purposes a concrete mathematical definition of features is required. In this paper we use a topological approach, namelyâ€¦ (More)

- Tamal K. Dey, Samrat Goswami
- Symposium on Computational Geometry
- 2004

We present an algorithm for surface reconstruction in presence of noise. We show that, under a reasonable noise model, the algorithm has theoretical guarantees. Actual performance of the algorithm isâ€¦ (More)

- Tamal K. Dey, Piyush Kumar
- SODA
- 1999

We present an algorithm that provably reconstructs a curve in the framework introduced by Amenta, Bern and Eppstein. The highlights of the algorithm are: (i) it is simple, (ii) it requires a samplingâ€¦ (More)

- Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos
- Discrete & Computational Geometry
- 2007

We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimensions with correct topology. The small angles between the tangents of two meeting manifold patches poseâ€¦ (More)

- Siu-Wing Cheng, Tamal K. Dey, Jonathan Richard Shewchuk
- Chapman and Hall / CRC computer and informationâ€¦
- 2013

- Tamal K. Dey, Haijo Schipper
- Discrete & Computational Geometry
- 1994

We provide a new technique for deriving optimal sized polygonal schema for triangulated compact 2-manifolds without boundary in <italic>O(n)</italic> time, where <italic>n</italic> is the size of theâ€¦ (More)