Return to search

Circle Packing in Euclidean and Hyperbolic Geometries

Given a graph that defines a triangulation of a simply connected surface, it is possible to associate a radius with each vertex so that the vertices represent centers of circles, and the edges denote patterns of tangency. Such a configuration of circles is called a circle packing. We shall give evidence for the existence and uniqueness of circle packings generated by such graphs, as well as an explanation of the algorithms used to find and output a circle packing on the complex plane and hyperbolic disc. / Master of Science

Identiferoai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/32390
Date30 May 2008
CreatorsWilkerson, Mary Elizabeth
ContributorsMathematics, Floyd, William J., Haskell, Peter E., Thomson, James E.
PublisherVirginia Tech
Source SetsVirginia Tech Theses and Dissertation
Detected LanguageEnglish
TypeThesis
Formatapplication/pdf
RightsIn Copyright, http://rightsstatements.org/vocab/InC/1.0/
Relationdraft.pdf

Page generated in 0.0017 seconds