Fast Computation of Delaunay Triangulation using Graphics Hardware

DOI Web Site 2 Citations 13 References
  • Yamamoto Osami
    Department of Information Engineering, Faculty of Science and Technology, Meijo University

Bibliographic Information

Other Title
  • グラフィックスハードウェアを用いたDelaunay三角形分割の高速計算
  • グラフィックスハードウェア オ モチイタ Delaunay 3カクケイ ブンカツ ノ コウソク ケイサン

Search this article

Abstract

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.

Journal

Citations (2)*help

See more

References(13)*help

See more

Details 詳細情報について

Report a problem

Back to top