Finding a Triangular Mesh with a Constant Number of Different Edge Lengths(<Special Section>Invited Papers from New Horizons in Computing)

スポンサーリンク

概要

• 論文の詳細を見る

• 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+√<2α>)l__-. Experiments demonstrate the effectiveness of this algorithm.

• 社団法人電子情報通信学会の論文
• 2006-08-01

著者

• Katoh Naoki

  Department Of Architecture And Architectural Engineering Kyoto University

• Tanigawa Shin-ichi

  Department of Architecture and Architectural Engineering, Kyoto University

• Tanigawa Shin-ichi

  Department Of Architecture And Architectural Engineering Kyoto University

関連論文

• DS-1-7 無交差ラーマンフレームワーク列挙アルゴリズム(DS-1.COMP-NHC学生シンポジウム,シンポジウム)
• The Bacteriology of Acne Vulgaris and Antimicrobial Susceptibility of Propionibacterium acnes and Staphylococcus epidermidis Isolated from Acne Lesions
• 1B2 The Multicover Problem in Graphs arising from Patrol Route Planning
• An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity(Invited Papers from New Horizons in Computing)
• AN EFFICIENT ALGORITHM FOR BICRITERIA MINIMUM-COST CIRCULATION PROBLEM
• Finding a Triangular Mesh with a Constant Number of Different Edge Lengths(Invited Papers from New Horizons in Computing)
• AN ε-APPROXIMATION SCHEME FOR MINIMUM VARIANCE PROBLEMS
• Comparison of Catheter Ablation Results between Irrigated and Nonirrigated Ablation Catheter in Patients with Atrial Fibrillation
• Online Vertex Exploration Problems in a Simple Polygon
• The Impact of Sleep Apnoea on Early Recurrence of Atrial Fibrillation Following Catheter Ablation

スポンサーリンク