Skip to main content
Conference ProceedingsOPEN ACCESS

An algorithm for finding three dimensional symmetry in Trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 1984 360-371
DOI: 10.1007/3-540-44541-2_34
8Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a model for drawing trees symmetrically in three dimensions and a linear time algorithm for finding maximum number of three dimensional symmetries in trees.

Cite

CITATION STYLE

APA

Hong, S. H., & Eades, P. (2001). An algorithm for finding three dimensional symmetry in Trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1984, pp. 360–371). Springer Verlag. https://doi.org/10.1007/3-540-44541-2_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free