SIGN IN
SIGN UP
Computing similarity between piecewise-linear functions
Full Text:
Pdf
Buy this Article
Authors:
Pankaj K. Agarwal
Duke University, Durham, NC, USA
Boris Aronov
Polytechnic Institute of NYU, New York, NY, USA
Marc van Kreveld
Utrecht University, Utrecht, Netherlands
Maarten Löffler
University of California, Irvine, Irvine, CA, USA
Rodrigo I. Silveira
Universitat Politècnica de Catalunya, Barcelona, Spain
2010 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 26
· Downloads (cumulative): 150
· Citation Count: 1
Published in:
· Proceeding
SoCG '10
Proceedings of the 2010 annual symposium on Computational geometry
Pages 375-383
ACM
New York, NY
, USA
©2010
table of contents
ISBN: 978-1-4503-0016-2
doi>
10.1145/1810959.1811020
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 algorithm
computations on discrete structures
geometrical problems and computations
piecewise-linear function
polyhedral terrain
randomized algorithm
similarity
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