グラフィックスハードウェアを用いたDelaunay三角形分割の高速計算

書誌事項

タイトル別名
  • Fast Computation of Delaunay Triangulation using Graphics Hardware
  • グラフィックスハードウェア オ モチイタ Delaunay 3カクケイ ブンカツ ノ コウソク ケイサン

この論文をさがす

抄録

This paper shows an algorithm to compute Delaunay diagrams approximately using graphics hardware. We introduce some algorithms to compute 2-and 3-dimensional convex hulls. These algorithms compute the edges and the facets of convex hulls analyzing bitmap images generated by graphics hardware. Graphics hardware can generate bitmap images of 3-dimensional objects very fast. The image generated by graphics hardware is an approximation of the continuous image because it consists of discrete pixels. So there are some accuracy and stability problems about the algorithm. But the algorithm can compute the Delaunay triangulation of given generators when the resolution of the image is sufficiently large.

収録刊行物

被引用文献 (2)*注記

もっと見る

参考文献 (13)*注記

もっと見る

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

問題の指摘

ページトップへ