SIGN IN
SIGN UP
Optimal simplification of polygonal chain for rendering
Full Text:
PDF
Buy this Article
Author:
Lilian Buzer
CNRS, noisy le grand, France
Published in:
· Proceeding
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
ACM
New York, NY
, USA
©2007
table of contents
ISBN: 978-1-59593-705-6
doi>
10.1145/1247069.1247102
2007 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 16
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SoCG '12
Share:
|
Tags:
algorithms
approximation criterion
boundary representations
computations on discrete structures
efficiency
experimentation
geometric algorithms, languages, and systems
geometrical problems and computations
implementation
near linear time complexity
performance
polygonal chain
rendering quality
simplification
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder