SIGN IN
SIGN UP
I/O-efficient dynamic point location in monotone planar subdivisions
Full Text:
PDF
Buy 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
Gerth Stølting Brodal
BRICS, University of Aarhus, DK-8000 Aarhus C., Denmark
Jeffrey S. Vitter
Center for Geometric Computing, Department of Computer Science, Duke University, Durham, NC
1999 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 6
· Downloads (cumulative): 106
· Citation Count: 17
Published in:
· Proceeding
SODA '99
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Pages 11-20
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©1999
table of contents
ISBN:0-89871-434-6
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
computations on discrete structures
design
geometrical problems and computations
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