Approximating Uniform Triangular Meshes in Polygons

Authors:
Franz Aurenhammer;Naoki Katoh;Hiromichi Kojima;Makoto Ohsaki;Yinfeng Xu
Affiliations:
-;-;-;-;-
Venue:
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Year:
2000

Optimal algorithms for approximate clustering

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)
Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A quadratic time algorithm for the minmax length triangulation

SIAM Journal on Computing
Guaranteed-quality mesh generation for curved surfaces

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Linear-size nonobtuse triangulation of polygons

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Provably good mesh generation

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
A Delaunay refinement algorithm for quality 2-dimensional mesh generation

SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms

Approximating Uniform Triangular Meshes for Spheres

JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry

Hi-index	0.00