SIGN IN
SIGN UP
Generalized sweep methods for parallel computational geometry
Full Text:
Pdf
Buy this Article
Authors:
M. Goodrich
Dept. of Computer Science, The Johns Hopkins Univ., Baltimore, MD
M. Ghouse
Dept. of Computer Science, The Johns Hopkins Univ., Baltimore, MD
J. Bright
Dept. of Computer Science, The Johns Hopkins Univ., Baltimore, MD
Published in:
· Proceeding
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Pages 280 - 289
ACM
New York, NY
, USA
©1990
table of contents
ISBN:0-89791-370-1
doi>
10.1145/97444.97695
1990 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 11
· Downloads (cumulative): 372
· Citation Count: 5
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '13
Share:
|
Tags:
algorithms
geometrical problems and computations
parallelism and concurrency
trees
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