SIGN IN
SIGN UP
Arrangements of lines in 3-space: a data structure with applications
Full Text:
PDF
Buy this Article
Authors:
M. McKenna
Department of Computer Science, The Johns Hopkins University, Baltimore, MD
J. O'Rourke
Department of Computer Science, The Johns Hopkins University, Baltimore, MD
Published in:
· Proceeding
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Pages 371-380
ACM
New York, NY
, USA
©1988
table of contents
ISBN:0-89791-270-5
doi>
10.1145/73393.73431
1988 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 13
· Downloads (cumulative): 285
· Citation Count: 13
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
complexity measures
curve, surface, solid, and object representations
design
geometrical problems and computations
measurement
performance
projections
representations, data structures, and transforms
theory
visible line/surface algorithms
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