|
Volumn , Issue , 1999, Pages 11-20
|
I/O-efficient dynamic point location in monotone planar subdivisions
a
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
COMPUTATIONAL GEOMETRY;
DATA STRUCTURES;
TREES (MATHEMATICS);
MONOTONE PLANAR SUBDIVISIONS;
ALGORITHMS;
|
EID: 0032803596
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (27)
|
References (26)
|