Computing homotopic shortest paths in the plane

We address the problem of computing homotopic shortest paths in the presence of obstacles in the plane. Problems on homotopy of paths received attention very recently [Cabello et al., in: Proc. 18th Annu. ACM Sympos. Comput. Geom., 2002, pp. 160–169; Efrat et al., in: Proc. 10th Annu. European Sympo...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of algorithms Vol. 49; no. 2; pp. 284 - 303
Main Author:	Bespamyatnikh, Sergei
Format:	Journal Article
Language:	English
Published:	San Diego, CA Elsevier Inc 01.11.2003 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Classical combinatorial problems Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Convex and discrete geometry Exact sciences and technology Geometry Graph theory Homotopy Mathematics Output-sensitive algorithm Sciences and techniques of general use Shortest path Theoretical computing Shortest path Homotopy Output-sensitive algorithm Output sensitive algorithm Graph theory Computer theory Computing
ISSN:	0196-6774, 1090-2678
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!