Triangulating a convex polygon with small number of non-standard bars

Authors:
Yinfeng Xu;Wenqiang Dai;Naoki Katoh;Makoto Ohsaki
Affiliations:
School of Management, Xi’an Jiaotong University, Xi’an, P.R. China;School of Management, Xi’an Jiaotong University, Xi’an, P.R. China;Department of Architecture and Architectural Engineering, Kyoto University, Kyoto, Japan;Department of Architecture and Architectural Engineering, Kyoto University, Kyoto, Japan
Venue:
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Year:
2005

Citing 7
Cited 1

Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
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
Approximating uniform triangular meshes in polygons

Theoretical Computer Science

Polygonal curve approximation using grid points with application to a triangular mesh generation with small number of different edge lengths

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a given convex polygon with inner angle no less than $\frac{2}{3}\pi$ and boundary edge bounded by [l, αl] for 1≤ α ≤ 1.4, where l is a given standard bar’s length, we investigate the problem of triangulating the polygon using some Steiner points such that (i) the length of each edge in triangulation is bounded by [βl,2l], where β is a given constant and meets $0