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

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Pankaj K. Agarwal Center for Geometric Computing, Department of Computer Science, Duke University, Durham, NC
Lars Arge Center for Geometric Computing, Department of Computer Science, Duke University, Durham, NC
T. M. Murali Brown University and Center for Geometric Computing, Department of Computer Science, Duke University, Durham, NC
Kasturi R. Varadarajan Center for Geometric Computing, Department of Computer Science, Duke University, Durham, NC
Jeffrey Scott Vitter Center for Geometric Computing, Department of Computer Science, Duke University, Durham, NC
I/O-efficient algorithms for contour-line extraction and planar graph blocking 1998 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 12
· Downloads (cumulative): 236
· Citation Count: 30

Published in:
· Proceeding
SODA '98 Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Pages 117-126
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1998
table of contents ISBN:0-89871-410-9

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder