Your Search Results

Use this resource - and many more! - in your textbook!

AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.

Experience the freedom of customizing your course pack with AcademicPub!
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.

Shortest path planning with dominance relation

By: Shin, K.G.; Jun, S.;

1990 / IEEE / 0-8186-9061-5

Description

This item was taken from the IEEE Periodical ' Shortest path planning with dominance relation ' A method of partitioning a workspace using rectilinear visibility in 3-D or higher space is presented. Unlike the case of 2-D space, where the space of a partition is a rectangle, the shape of a partition in 3-D or higher space is arbitrary. In spite of the arbitrary shape of partitioned regions, it is proved that there exist dominance relations between regions. This relation is then utilized to solve efficiently the shortest path planning problem in 3-D or higher space.<>