Path finding for human motion in virtual environments

被引：22

作者：

Bandi, S

Thalmann, D

机构：

[1] Univ Bradford, Bradford BD7 1DP, W Yorkshire, England

[2] Swiss Fed Inst Technol, Comp Graph Lab, CH-1015 Lausanne, Switzerland

来源：

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2000年 / 15卷 / 1-3期

关键词：

path planning; obstacle avoidance; cellular paths; virtual walk-throughs; heuristic search;

D O I：

10.1016/S0925-7721(99)00046-2

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper presents an efficient and robust technique for generating global motion paths for a human model in virtual environments. Initially, a scene is discretized using raster hardware to generate an environment map. An obstacle-free cell path sub-optimal according to Manhattan metric is generated between any two cells. Unlike 2D techniques present in literature, the proposed algorithm works for complex 3D environments suitable for video games and architectural walk-throughs. For obstacle avoidance, the algorithm considers both physical dimensions of the human and actions such as jumping, bending, etc. Path smoothening is carried out to keep the cell path as closely as possible to Euclidean straight-line paths. (C) 2000 Elsevier Science B.V. All rights reserved.

引用

页码：103 / 127

页数：25