T. K. Dey. Sample
based geometric modeling. AMS/DIMACS volume on Computer-Aided Design
and Manufacturing, eds Dutta, Janardan, Smid. To appear.
T. K. Dey. Curve
and surface reconstruction. Chapter in Handbook of Discrete and
Computational Geometry, Goodman and O' Rourke eds., CRC press, 2nd edition.
T. K. Dey, H. Edelsbrunner and
S. Guha. Computational
Topology . Advances in Discrere
and Computational Geometry, eds. B. Chazelle, J. E. Goodman and R.
Pollack. Contemporary Mathematics, AMS, Providence, 1998.
T. K. Dey. Section 13.4 on polyhedra
of CRC Handbook of Discrete and Combinatorial Mathematics, Ken Rosen,
Editor, CRC press (2000).
Surface
Reconstruction
T. K. Dey and S. Goswami. Provable
surface reconstruction from noisy samples. Proc. 20th ACM
Sympos. Comput. Geom. (2004), 330--339. Extended
version.
T. K. Dey and S. Goswami. Tight
Cocone: A water-tight surface reconstructor. Proc. 8th
ACM Sympos. Solid Modeling Applications (2003), 127--134. Journal
version in J. of Computing and Infor. Sci. Engin. Vol. 30 (2003),
302--307.
T. K. Dey and J. Giesen.
Detecting
undersampling in surface reconstruction. Proc. 17th ACM Sympos.
Comput. Geom. (2001), 257--263. Journal version in Discrete and Comput.
Geom. - The Goodman-Pollack Festschrift (B. Aronov, S. Basu, J. Pach,
M. Sharir, eds.), Algorithms and Combinatorics Series, Springer-Verlag,
Berline, 2003, to appear.
T. K. Dey and W. Zhao. Approximate
medial axis as a Voronoi subcomplex.CAD, Vol. 36, Issue
2 (2003), 195--202. Preliminary version in Proc. 7th ACM Sympos. Solid
Modeling Applications, 2002, 356--366.
T. K. Dey and W. Zhao. Approximating
the Medial Axis from the Voronoi Diagram with a Convergence Guarantee.
R. Mohring and R. Raman (Eds.) ESA 2002, LNCS 2461, 387--398. An Extended
version to appear in Algorithmica, vol. 38, 2004.
T. K. Dey, H. Edelsbrunner, S.
Guha and D. Nekhayev. Topology
preserving edge contraction. . Publications
de l' Institut Mathematique (Beograd), Vol. 60 (80), 23--45, 1999.
T. K. Dey, H. Edelsbrunner, S.
Guha and D. Nekhayev. Topology
preserving edge contraction. . Publications
de l' Institut Mathematique (Beograd), Vol. 60 (80), 23--45, 1999.
T. K. Dey, H. Edelsbrunner and
S. Guha. Computational
Topology . Invited paper in Advances
in Discrere and Computational Geometry, eds. B. Chazelle, J. E.
Goodman and R. Pollack. Contemporary Mathematics, AMS, Providence, 1998.
T. K. Dey and S. Guha. Transforming
curves on surfaces . Journal of Computer
and System Sciences, vol. 58, 1999, 297--325. Preliminary version
in IEEE FOCS , 1995, 266-274.
T. K. Dey. Optimal algorithms
to detect null-homologous cycles on 2-manifolds. Intl. Journal of
Computational Geometry & Applications, Vol. 7, No. 3, (1997),
167--174. Preliminary version in 5th CCCG , 1993, 273-278.
T. K. Dey and H. Schipper. A new
technique to compute polygonal schema for 2-manifolds with application
to null-homotopy detection. Discrete & Computational Geometry,
Vol. 14, 93--110 (1995). Preliminary version in 10th SoCG, 1994,
277-284.
S.-W. Cheng, T. K. Dey, E. Ramos and T.
Ray. Quality meshing for polyhedra with small angles. Proc. 20th
Sympos. Comput. Geom. (2004), 290--299. Extended
version.
T. K. Dey, A. Roy and N. R. Shah.
Approximating geometric objects through topological triangulations.
Proc. 17th. FST&TCS Conference, Lecture Notes in Computer
Science 1346, 6-21 (1997).
T. K. Dey, M. Dillencourt, S.
Ghosh and J. Cahil. Triangulating with high connectivity. Computational
Geometry: Theory and Applications, Vol. 8, No. 1, (1997), 39--56.
Preliminary version in 6th CCCG, 1994, 339-343.
T. K. Dey, C. Bajaj and K. Sugihara.
On good triangulations in three dimensions. Intl. Journal of Computational
Geometry & Applications. Vol. 2 (1992), 75-95.
T. K. Dey, C. Bajaj and K. Sugihara.
Delaunay triangulations in three dimensions with finite precision arithmetic.
Computer Aided Geometric Design, Vol. 9 (1992), 457-470.
Solid Modeling
C. Bajaj and T. K. Dey. CSG operations
on a MIMD distributed memory machines. Proc. CSG 94, Winchester,
UK, 13-15 April, 1994.
T. K. Dey. Triangulation and CSG
representation of polyhedra with arbitrary genus. Proc. 7th ACM Symposium
Computational Geometry New Hampshire, USA, (1991), 364-372.
T. K. Dey, C. Bajaj and K. Sugihara.
On good triangulations in three dimensions. Proc. ACM Symposium on
Solid Modeling, USA, (1991)
C. Bajaj, V. Anupam, T. K. Dey,
S. Klinkner, A. Royappa. CREMONA: A graphical editing system for algebraic
boundary models. SIAM Conference on Geometric Design. Tempe, Arizona
(1989)
Computational/Combinatorial Geometry
B. Aronov and T. K. Dey. Polytopes
in Arrangements . Discrete &
Computational Geometry, Vol. 25, (2001), 51--63.
T. K. Dey. Improved bounds
for planar k-sets and related problems. Invited paper in a special
issue of Discrete & Computational Geometry, Vol. 19, No. 3, (1998),
373-382. Preliminary
version in 37th IEEE FOCS, 1997, 156-161.
T. K. Dey and J. Pach. Extremal
problems for geometric hypergraphs. Discrete
& Computational Geometry, Vol. 19, No. 4, (1998), 473--484. Preliminary
version in ISAAC 96, LNCS 1178, 105-114.
B. Aronov, A. Davis, T. K. Dey,
S. P. Pal and D. C. Prasad. Visibility
with multiple reflections. Discrete
& Computational Geometry, Vol. 20, No. 61, (1998), 61--78. Preliminary
version in 5th SWAT, 1996, LNCS 1097, 284-295.
B. Aronov, A. Davis, T. K. Dey,
S. P. Pal and D. C. Prasad. Visibility
with one reflection. Discrete & Computational
Geometry, Vol. 19, No. 4, (1998), 553-574. Preliminary version in 11th
ACM SoCG, 1995, 316-325.
T. K. Dey and N. Shah. On counting
the number of simplicial complexes in $R^d$. Computational Geometry:
Theory and Applications Vol. 8, No. 5, (1997). Preliminary version in
7th CCCG, 1995, 31-36.
T. K. Dey and H. Edelsbrunner.
Counting triangle crossings and halving planes. Invited paper in
a special issue, Discrete & Computational Geometry, Vol. 12 (1994),
281--289.
T. K. Dey and N. Shah. Many face
complexity in incremental convex arrangements. Information Processing
Letters. Vol. 51, 5, 227--231 (1994).
T. K. Dey. On counting triangulations
in d dimensions. Computational Geometry: Theory and Applications.
Vol. 3 (1993), 315--325.
C. Bajaj and T. K. Dey. Polygon
nesting and robustness. Information Processing Letters. Vol. 1
(1990), 23-32.