Crystal voronoi diagram and its applications to collision-free paths

Kei Kobayashi, Kokichi Sugihara

研究成果: Conference contribution

7 被引用数 (Scopus)

抄録

This paper studies the multiplicatively weighted crystal- growth Voronoi diagram, which describes the partition of the plane into crystals with different growth speeds. This type of the Voronoi diagram is defined, and its basic properties are investigated. An approximation algorithm is proposed. This algorithm is based on a finite difference method, called a fast marching method, for solving a special type of a partial differential equation. The proposed algorithm is applied to the planning of a collision-free path for a robot avoiding enemy attacks.

本文言語English
ホスト出版物のタイトルComputational Science - ICCS 2001 - International Conference, 2001, Proceedings
出版社Springer Verlag
ページ738-747
ページ数10
2073
ISBN(印刷版)3540422323, 9783540422327
出版ステータスPublished - 2001
外部発表はい
イベントInternational Conference on Computational Science, ICCS 2001 - San Francisco, United States
継続期間: 2001 5 282001 5 30

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2073
ISSN(印刷版)03029743
ISSN(電子版)16113349

Other

OtherInternational Conference on Computational Science, ICCS 2001
国/地域United States
CitySan Francisco
Period01/5/2801/5/30

ASJC Scopus subject areas

  • コンピュータ サイエンス(全般)
  • 理論的コンピュータサイエンス

フィンガープリント

「Crystal voronoi diagram and its applications to collision-free paths」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル