Orthogonal trees

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Orthogonal trees

Full text

Pdf (312 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the seventh annual symposium on Computational geometry table of contents

North Conway, New Hampshire, United States

Pages: 89 - 97

Year of Publication: 1991

ISBN:0-89791-426-0

Author

H. S. M. Coxeter

University of Toronto

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 24, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/109648.109658 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	N. BOURBAKI 1968' Groupes et alg~bres de Lie, Chapitres 4, 5 et 6. Hermann, Paris.
	2	J. H. Conway , N. J. A. Sloane , E. Bannai, Sphere-packings, lattices, and groups, Springer-Verlag New York, Inc., New York, NY, 1987
	3	H.S.M. COXETER 1073: Regular polytopes (3rd ed.) Dover, New York.
	4	--1088' Regular and semi-regular polytopes, III. Math. Z. 200, pp. 3-45.
	5	--1989: Trisecting an orthoscheme. Computers Math. Appl. 17, pp. 59-71.