Minimax Geometric Fitting of Two Corresponding Sets of Points and Dynamic Furthest Voronoi Diagrams

スポンサーリンク

概要

• 論文の詳細を見る

• This paper formulates problems of fitting two corresponding sets of points by translation, rotation and scaloing, and proposes efficient algorithms for the fitting. The algorithms are based on the theory of lower envelopes, or Davenport-Schinzel sequences, and linearization techniques in computational geometory, and are related to dynamic furthest Voronoi diagrams.

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

著者

• Imai K

  Chuo Univ. Tokyo Jpn

• IMAI Keiko

  The author is with the Department of Information and System Engineering, Chuo University

• SUMINO Shigeo

  The author is with Central Research Laboratory, Hitachi Co.

• IMAI Hiroshi

  The author is with the Department of Information Science, the University of Tokyo

• Sumino Shigeo

  The Author Is With Central Research Laboratory Hitachi Co.

• Imai Hiroshi

  The Author Is With The Department Of Information Science The University Of Tokyo

関連論文

• Minimax Geometric Fitting of Two Corresponding Sets of Points and Dynamic Furthest Voronoi Diagrams
• Variance-Based k-Clustering Algorithms by Voronoi Diagrams and Randomization

スポンサーリンク