Premium
Space Discretization for Efficient Human Navigation
Author(s) -
Bandi Srikanth,
Thalmann Daniel
Publication year - 1998
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/1467-8659.00267
Subject(s) - discretization , grid , computer science , animation , any angle path planning , path (computing) , surface (topology) , lattice graph , computer vision , human motion , graph , motion planning , mathematical optimization , artificial intelligence , algorithm , motion (physics) , computer graphics (images) , theoretical computer science , mathematics , geometry , robot , programming language , voltage graph , line graph , mathematical analysis
There is a large body of research on motion control of legs in human models. However, they require specification of global paths in which to move. A method for automatically computing a global motion path for a human in 3D environment of obstacles is presented. Object space is discretized into a 3D grid of uniform cells and an optimal path is generated between two points as a discrete cell path. The grid is treated as graph with orthogonal links of uniform cost. A * search method is applied for path finding. By considering only the cells on the upper surface of objects on which human walks, a large portion of the grid is discarded from the search space, thus boosting efficiency. This is expected to be a higher level mechanism for various local foot placement methods in human animation.