Transforming Euclidean Object files to Hyperbolic Data files
2016-06
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Transforming Euclidean Object files to Hyperbolic Data files
Alternative title
Authors
Published Date
2016-06
Publisher
Type
Thesis or Dissertation
Abstract
The creation of repeating hyperbolic patterns has been of interest for more than 100 years. However, manual creation of these patterns was very tedious and time-consuming. Escher created such patterns manually in 1950's. At that time, he had no access to computers. Later on, several researchers, tried to create these patterns automatically. For this purpose, they had written code in C. Programs for automatic creation of these patterns now exist in C++ and JAVA. These programs take parameters p and q to generate a regular tesselation p,q of hyperbolic plane. Here p represents a regular p-sided polygon and q specifies the number of them that meet at each vertex. These program generates repeating hyperbolic patterns from hyperbolic data files. However, there is no means to generate hyperbolic data files from Euclidean object files.
Keywords
Description
University of Minnesota M.S. thesis. June 2016. Major: Computer Science. Advisor: douglas dunham. 1 computer file (PDF); vii, 49 pages.
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Naidu, Swetha. (2016). Transforming Euclidean Object files to Hyperbolic Data files. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/191250.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.