A Hierarchical Hexagon Data Structure for Collision Detection

碩士 === 國立中山大學 === 機械工程學系研究所 === 89 === In this paper, hexagonal grid is extended to hierarchical structure. This technique can be applied to collision detection. By using concept of node, we develop an effectually linear decode called “HCD”. To develop to three dimensions, the structure of octahedro...

Full description

Bibliographic Details
Main Authors: Ting-wei Kang, 康庭維
Other Authors: HER, INNCHYN
Format: Others
Language:zh-TW
Published: 2001
Online Access:http://ndltd.ncl.edu.tw/handle/62299034551824866636
Description
Summary:碩士 === 國立中山大學 === 機械工程學系研究所 === 89 === In this paper, hexagonal grid is extended to hierarchical structure. This technique can be applied to collision detection. By using concept of node, we develop an effectually linear decode called “HCD”. To develop to three dimensions, the structure of octahedron is applied to develop hexagonal hierarchical structure in three dimensions. This is helpful to simulate objects and approximate objects. The object’s data is commonly deposited in float. In this paper, Symmetrical Hexagonal Frame makes whole object to be deposited in integer. So the data of object can be compressed to smaller size. Otherwise, by concept of k-dops, we can close to object’s real surfaces with hierarchical hexagonal structures at low level.