３次元空間における有限個の点の高速Ｃｏｎｖｅｘ　Ｈｕｌｌアルゴリズム

DOI Web Site 被引用文献1件

書誌事項

タイトル別名
  • An Efficient Convex Hull Algorithm for Finite Point Sets in 3-D Space
  • 3ジゲン クウカン ニ オケル ユウゲンコ ノ テン ノ コウソク Conve

この論文をさがす

抄録

An efficient convex hull algorithm is presented for finite sets of n points in 3-D space. The method is based on the idea of determining the outline loop of a convex polyhedron viewing from a point and connecting the point with each vertex of the outline loop. A convex hull polyhedron can be constructed with O(n) operations, i. e., the processing time is proportional to the number of given points. The algorithm was programmed in FORTRAN language and various computational results were obtained. They guarantee the justice of the theoretical considerations.

収録刊行物

  • 精密機械

    精密機械 50 (11), 1771-1776, 1984

    公益社団法人 精密工学会

被引用文献 (1)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ