Research Article
An Evacuation Route Model of Crowd Based on Emotion and Geodesic
Algorithm 1
An optimization based method for computing the shortest path with hazard information.
Input: A triangle Mesh ; two points and an initial path between them; A error tolerance . | Output: A geodesic path between and . | Calculate the hazard value of using equation (1) | Calculate crowd density of triangle using equation (2) | Set density function of according to and | Compute the current length of initial path | Let | while do | Let | Compute the length of path using equation (13) | Compute the gradient of length using equation (14) | Get the resulting path; | Collect the vertices on the path; | Traverse and update the face sequence such that each is on the other side of the new face sequence. | Compute the new length of path | end |
|