Approximating Uniform Triangular Meshes for Spheres

Authors:
Naoki Katoh;Hiromichi Kojima;Ryo Taniguchi
Affiliations:
-;-;-
Venue:
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Year:
2000

Citing 10
Cited 1

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
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
Packing and covering

Handbook of discrete and computational geometry
Algorithmic geometry

Algorithmic geometry
Approximating Uniform Triangular Meshes in Polygons

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics

Approximating uniform triangular meshes in polygons

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of triangulating a convex polygon on spheres using n Steiner points that minimizes the overall edge length ratio. We establish a relation of this problem to a certain extreme packing problem. Based on this relationship, we develop a heuristic producing 6- approximation for spheres (provided n is chosen sufficiently large). That is, the produced triangular mesh is uniform in this respect.The method is easy to implement and runs in O(n3) time and O(n) space.