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

  • Authors:

  • Yinfeng Xu;Wenqiang Dai;Naoki Katoh;Makoto Ohsaki

  • Affiliations:

  • School of Management, Xian Jiaotong University, Xian, 710049, PR China and The State Key Lab for Manufacturing Systems Engineering, PR China;School of Management, University of Electronic Science and Technology of China, Sichuan, Chengdu, 610054, PR China;Department of Architecture and Architectural Engineering, Kyoto University, Kyotodaigaku-Katsura, Nishikyo, Kyoto 615-8540, Japan;Department of Architecture and Architectural Engineering, Kyoto University, Kyotodaigaku-Katsura, Nishikyo, Kyoto 615-8540, Japan

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2007

Quantified Score

Hi-index 5.23

Visualization

Abstract

For a given convex polygon with inner angle no less than 23@p and boundary edge bounded by [l,@al] for 1@?@a@?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 [@bl,2l], where @b is a given constant and meets 0