An O(nlogn) implementation of the Douglas-Peucker algorithm for line simplification

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: John Hershberger Mentor Graphics
Jack Snoeyink Department of Computer Science, University of British Columbia
Published in:
Cover Image
 
· Proceeding
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Pages 383-384
ACM New York, NY, USA ©1994
table of contents ISBN:0-89791-648-4 doi>10.1145/177424.178097
An <italic>O</italic>(<italic>n</italic>log<italic>n</italic>) implementation of the Douglas-Peucker algorithm for line simplification Published by ACM 1994 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 102
· Downloads (cumulative): 834
· Citation Count: 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