SIGN IN
SIGN UP
Drawing planar partitions I: LL-drawings and LH-drawings
Full Text:
PDF
Buy this Article
Author:
Therese C. Biedl
School of Computer Science, McGill University, 3480 University St., Montreal, Quebec H3A2A7, Canada
Published in:
· Proceeding
SCG '98
Proceedings of the fourteenth annual symposium on Computational geometry
Pages 287-296
ACM
New York, NY
, USA
©1998
table of contents
ISBN:0-89791-973-4
doi>
10.1145/276884.276917
1998 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 11
· Downloads (cumulative): 259
· Citation Count: 3
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
computations on discrete structures
geometrical problems and computations
graph algorithms
theory
verification
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