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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of algorithms Ročník 49; číslo 2; s. 284 - 303
Hlavní autor:	Bespamyatnikh, Sergei
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	San Diego, CA Elsevier Inc 01.11.2003 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!