SIGN IN
SIGN UP
Optimal area-sensitive bounds for polytope approximation
Full Text:
PDF
Buy this Article
Authors:
Sunil Arya
The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
Guilherme D. da Fonseca
Universidade Federal do Estado do Rio de Janeiro (UniRio), Rio de Janeiro, Brazil
David M. Mount
University of Maryland, College Park, MD, USA
Published in:
· Proceeding
SoCG '12
Proceedings of the 2012 symposuim on Computational Geometry
Pages 363-372
ACM
New York, NY
, USA
©2012
table of contents
ISBN: 978-1-4503-1299-8
doi>
10.1145/2261250.2261305
2012 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 52
· Downloads (cumulative): 52
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SoCG '13
Share:
|
Tags:
algorithms
approximation
convexity
geometrical problems and computations
macbeath regions
polytopes
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