Skip to main content
Article thumbnail
Location of Repository

Planning Short Paths with Clearance using Explicit Corridors

By R.J. Geraerts

Abstract

A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more realistic, a character’s path needs to be visually convincing, meaning that the path is smooth, short, has some clearance to the obstacles in the environment, and avoids other characters. Up to now, it has proved difficult to meet these criteria simultaneously and in real-time. We introduce a new data structure, i.e. the Explicit Corridor Map, which allows creating the shortest path, the path that has the largest amount of clearance, or any path in between. Besides being efficient, the corresponding algorithms are surprisingly simple. By integrating the data structure and algorithms into the Indicative Route Method, we show that visually convincing short paths can be obtained in real-time

Year: 2010
OAI identifier: oai:dspace.library.uu.nl:1874/191135
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://dspace.library.uu.nl:80... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.