For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Finding a Triangular Mesh with a Constant Number of Different Edge Lengths
Shin-ichi TANIGAWA Naoki KATOH
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2006/08/01
Online ISSN: 1745-1361
Print ISSN: 0916-8532
Type of Manuscript: INVITED PAPER (Special Section on Invited Papers from New Horizons in Computing)
computational geometry, Delaunay triangulation, Voronoi diagram,
Full Text: PDF>>
We consider the problem of triangulating an x-monotone polygon with a small number of different edge lengths using Steiner points. Given a parameter α, where 0<α<1, we shall present an algorithm for finding an almost uniform triangular mesh with 3π/8α2+o(1/α2) different edge lengths such that every edge length is between l and (2+α)l. Experiments demonstrate the effectiveness of this algorithm.