Rotation distance, triangulations, and hyperbolic geometry

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Rotation distance, triangulations, and hyperbolic geometry

Full text

Pdf (1.17 MB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the eighteenth annual ACM symposium on Theory of computing table of contents

Berkeley, California, United States

Pages: 122 - 135

Year of Publication: 1986

ISBN:0-89791-193-8

Authors

D D Sleator	Computer Science Department, Carnegie-Mellon University, Pittsbtirgh, PA
R E Tarjan	Computer Science Department, Princeton University, Princeton, NJ and AT&T Bell Laboratories, Murray Hill, NJ
W P Thurston	Mathematics Department, Princeton University, Princeton, NJ

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 28, Downloads (12 Months): 127, Citation Count: 5

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/12130.12143 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	H. M. S. Coxeter, Non-Euclidean geometry Toronto Press, Toronto, 1942.
	2	K. Culik and D. Wood, "A note on some ity measures," Info. Process. Lett. 15 (1982), 39-42.
	3	A. K. Dewdney, "Wagner's theorem for toms Discrete Math. 4 (1973), 139-149.
	4	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
	5	C. W. t.ec, "Catahm polytopes and triangulations the n-gon," Technical Report Number 36, Abteilung Mathematik der Ruhr-Universitat gochum, 1984.
	6	J. Milnor, "Hyperbolic geometry: the first Bulletin of the American Mathematical Society ary 1982), 9-24.
	7	Daniel Dominic Sleator , Robert Endre Tarjan, Self-adjusting binary search trees, Journal of the ACM (JACM), v.32 n.3, p.652-686, July 1985 [doi>10.1145/3828.3835]
	8	Robert Endre Tarjan, Data structures and network algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983
	9	W. P. Thurston, J. R. Weeks, "The mathematics three-dimensional manifolds," Scientific Ameiican (July 1984), 108-I20.
	10	W. T. Tutte, "A theorem on planar graphs," Am. Math. Soc. 82, (1956), 99-116.
	11	K. Wagner, "Bemerkungen zum vierfarbenpmblem," Jber. Deutsch. Math.-Verein. 46 (1936), 26-32.

CITED BY 5

	R. Cole, On the dynamic finger conjecture for splay trees, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.8-17, May 13-17, 1990, Baltimore, Maryland, United States
	Charu Aggarwal , Joel Wolf , Philip S. Yu, On optimal piggyback merging policies for video-on-demand systems, ACM SIGMETRICS Performance Evaluation Review, v.24 n.1, p.200-209, May 1996
	Leonidas Guibas , John Hershberger, Morphing simple polygons, Proceedings of the tenth annual symposium on Computational geometry, p.267-276, June 06-08, 1994, Stony Brook, New York, United States
	Chengwen Chris Wang , Jonathan Derryberry , Daniel Dominic Sleator, O(log log n)-competitive dynamic binary search trees, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, p.374-383, January 22-26, 2006, Miami, Florida
	Erik D. Demaine , Dion Harmon , John Iacono , Daniel Kane , Mihai Pătraşcu, The geometry of binary search trees, Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, p.496-505, January 04-06, 2009, New York, New York