|
Volumn , Issue , 1999, Pages 215-224
|
Two-point Euclidean shortest path queries in the plane
a
|
Author keywords
[No Author keywords available]
|
Indexed keywords
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
DATA STRUCTURES;
OPTIMIZATION;
POLYNOMIALS;
PROBLEM SOLVING;
TWO POINT EUCLIDEAN SHORTEST PATH QUERIES;
COMPUTATIONAL GEOMETRY;
|
EID: 0032785184
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (55)
|
References (27)
|