書誌事項
- タイトル別名
-
- Distance Computation between Non-convex Polyhedra Based on Discrete Voronoi Regions.
- リサンテキ ボロノイ リョウイキ オ モチイタ ヒトツタメンテイ カン ノ サイタン キョリ ケイサン シュホウ
この論文をさがす
抄録
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.
収録刊行物
-
- 精密工学会誌
-
精密工学会誌 67 (11), 1782-1786, 2001
公益社団法人 精密工学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282679773887616
-
- NII論文ID
- 110001373050
- 10008491946
-
- NII書誌ID
- AN1003250X
-
- ISSN
- 1882675X
- 09120289
-
- NDL書誌ID
- 5968698
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可