The Cone Intersection Method for Min-# Polygonal Approximation in R^2

スポンサーリンク

概要

• 論文の詳細を見る

• We propose a new algorithm for minimizing the number of vertices of an approximate curve by keeping the error within a given bound (min-# problem) with the parallel-strip error criterion. The best existing algorithm which solves this problem has O(n^2 logn) time complexity. Our algorithm which uses the Cone Intersection Method does not have an improved time complexity, but does have a high efficiency. In particular, for practical data such as those which represent the boundaries or the skeletons of an object, the new algorithm can solve the min-# problem in nearly O (n^2 ) time.

• 社団法人電子情報通信学会の論文
• 1996-04-25

著者

• Harada K

  Kyushu Inst. Technol. Kitakyushu‐shi Jpn

• Harada Koichi

  Faculty of Integrated Arts and Sciences, Hiroshima University

• MIYAOKU Kento

  Faculty of Integrated Arts and Sciences, Hiroshima University

• Miyaoku K

  Ntt Human Interface Lab. Yokosuka‐shi Jpn

• Harada Koichi

  Faculty Of Integrated Arts And Sciences Hiroshima University

• HARADA Koichi

  Faculty of Integrated Arts & Sciences

関連論文

• Ferry Scheduling via SAA
• The Cone Intersection Method for Min-# Polygonal Approximation in R^2
• Effective Data Reduction by the Curvature-Based Polygonal Approximation
• Effects of Ekman Layer on Flows and Temperature of Viscoelastic Fluid in a Rotating Frame

スポンサーリンク