I/O-efficient algorithms for contour-line extraction and planar graph blocking

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1998, Pages 117-126

  Agarwal, Pankaj K ^a   Arge, Lars ^a   Murali, T M ^a   Varadarajan, Kasturi R ^a   Vitter, Jeffrey Scott ^a  

^a DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DATA REDUCTION; DATA STRUCTURES; GEOGRAPHIC INFORMATION SYSTEMS; PROBLEM SOLVING; QUERY LANGUAGES;

BLOCKING BOUNDED-DEGREE PLANAR GRAPHS; TRIANGULAR IRREGULAR NETWORKS (TIN);

ALGORITHMS;

EID: 0032256751     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)