Skip to main content
Article thumbnail
Location of Repository

Abstract

By Ron Wein, Jur P. Van Den Berg and Dan Halperin

Abstract

Planning corridors among obstacles has arisen as a central problem in game design. Instead of devising a one-dimensional motion path for a moving entity, it is possible to let it move in a corridor, where the exact motion path is determined by a local planner. In this paper we introduce a measure for the quality of such corridors. We analyze the structure of optimal corridors amidst point obstacles and polygonal obstacles in the plane, and propose an algorithm to compute approximations for optimal corridors.

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.9508
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.tau.ac.il/~wein/... (external link)
  • Suggested articles


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