On good triangulations in three dimensions

Authors:
Tamal K. Dey;Chanderjit L. Bajaj;Kokicki Sugihara
Affiliations:
Department of Computer Science, Purdue University, West Lafayette, IN;Department of Computer Science, Purdue University, West Lafayette, IN;Department of Computer Science, Purdue University, West Lafayette, IN
Venue:
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Year:
1991

Computational geometry: an introduction

Computational geometry: an introduction
Triangulating simplicial point sets in space

SCG '86 Proceedings of the second annual symposium on Computational geometry
Nonobtuse triangulation of polygons

Discrete & Computational Geometry
Three-dimensional triangulations from local transformations

SIAM Journal on Scientific and Statistical Computing
Triangulating a nonconvex polytope

Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Triangulation and CSG representation of polyhedra with arbitrary genus

SCG '91 Proceedings of the seventh annual symposium on Computational geometry

Triangulation and CSG representation of polyhedra with arbitrary genus

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A Delaunay based numerical method for three dimensions: generation, formulation, and partition

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Hi-index	0.00