Distance Computation between Non-convex Polyhedra Based on Discrete Voronoi Regions.

DOI Web Site 1 Citations 8 References

Bibliographic Information

Other Title
  • 離散的ボロノイ領域を用いた非凸多面体間の最短距離計算手法
  • リサンテキ ボロノイ リョウイキ オ モチイタ ヒトツタメンテイ カン ノ サイタン キョリ ケイサン シュホウ

Search this article

Abstract

An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between two polyhedra, it is important to search efficiently the pair of the triangles which gives the pair of closest points. In this paper discrete Voronoi regions are prepared as voxels around non-convex polyhedra. Each voxel is given a list of triangles which have possibility to be closest to the voxel. When a triangle on the other object is intersecting a voxel, the closest triangles can be efficiently searched from this list. The algorithm has been implemented, and the results of distance computations show that it can calculate the minimum distance between non-convex polyhedra composed of a thousand of triangles at interactive rates.

Journal

Citations (1)*help

See more

References(8)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top