Three-dimensional Euclidean distance transformation and its application to shortest path planning

Document Type

Article

Publication Date

1-1-2004

Abstract

In this paper, we present a novel method to obtain the three-dimensional Euclidean distance transformation (EDT) in two scans of the image. The shortest path can be extracted based on the distance maps using the minimum value tracing. The EDT is obtained correctly and efficiently in a constant time for arbitrary types of images, including the existence of obstacles. By adopting the new dynamically rotational mathematical morphology, we not only guarantee the collision-free in the shortest path, but also reduce the time complexity dramatically. © 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

Identifier

0242406171 (Scopus)

Publication Title

Pattern Recognition

External Full Text Location

https://doi.org/10.1016/j.patcog.2003.08.003

ISSN

00313203

First Page

79

Last Page

92

Issue

1

Volume

37

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS