Rectilinear short path queries among rectangular obstacles

Given a set of n disjoint rectangular obstacles in the plane whose edges are either vertical or horizontal, we consider the problem of processing rectilinear approximate shortest path queries between pairs of arbitrary query points. Our goal is to answer each approximate shortest path query quickly...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters 1996-03, Vol.57 (6), p.313-319
Hauptverfasser:	Chen, Danny A., Klenk, Kevin S.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Analysis of algorithms Applied sciences Artificial intelligence Computational geometry Computer science Computer science control theory systems Data processing. List processing. Character string processing Data structures Design of algorithms Exact sciences and technology Graphs Mathematical models Memory organisation. Data processing Pattern recognition. Digital image processing. Computational geometry Queries Shortest path Software Studies Systems design Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!