On the Euclidean two paths problem

On the Euclidean two paths problem

0.00 Avg rating0 Votes
Article ID: iaor1995252
Country: Netherlands
Volume: 47
Issue: 2
Start Page Number: 165
End Page Number: 173
Publication Date: Nov 1993
Journal: Discrete Applied Mathematics
Authors: ,
Abstract:

Given a set of polygonal obstacles in the Euclidean plane with a total number of n vertices, the authors show how to find a pair of nonintersecting paths with minimum total length that connect two given pairs of points.

Reviews

Required fields are marked *. Your email address will not be published.