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
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
University of Minnesota M.S. thesis. September 2011. Major: Computer science. Advisor: Dr. Douglas Dunham. 1 computer file (PDF); vii, 44 pages, appendix I.
Chandarana, Dnyaneshwari Subodh.
Designing an algorithm that transforms each pixel back to motif in a fundamental region..
Retrieved from the University of Minnesota Digital Conservancy,
Content distributed via the University of Minnesota's Digital Conservancy may be subject to additional license and use restrictions applied by the depositor.