Designing an algorithm that transforms each pixel back to motif in a fundamental region.
Authors
Published Date
Publisher
Abstract
Current algorithms to create repeating hyperbolic patterns
transform the motif about the hyperbolic plane to points in the
Poincaré circle model. This is inefficient near the bounding circle
since the entire motif is drawn, even though it covers only few
pixels.
To avoid this shortcoming, we designed another algorithm that
transforms each pixel in a motif in a fundamental region and then
colors the original pixel using a color permutation of the color of
the final pixel. This solves the inefficiency problems of the
previous algorithms.
Keywords
Description
University of Minnesota M.S. thesis. September 2011. Major: Computer science. Advisor: Dr. Douglas Dunham. 1 computer file (PDF); vii, 44 pages, appendix I.
Related to
item.page.replaces
License
Series/Report Number
Funding Information
item.page.isbn
DOI identifier
Previously Published Citation
Other identifiers
Suggested Citation
Chandarana, Dnyaneshwari Subodh. (2011). Designing an algorithm that transforms each pixel back to motif in a fundamental region.. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/116918.
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.