#### Title

Multiplicatively Weighted Crystal Growth Voronoi Diagrams

#### Date of Award

7-1991

#### Document Type

Thesis (Ph.D.)

#### Department

Department of Computer Science

#### First Advisor

Scot Drysdale

#### Abstract

Voronoi diagrams and variants of Voronoi diagrams have been used for many years to model crystal growth. If the boundary of the growing crystals are circular and all the crystals start at the same time and have the same constant growth rate, then the Voronoi diagram is used to model the growth. If the crystals start at different times, the additively weighted Voronoi diagram is used to model the crystal growth. In this thesis, I propose a new type of Voronoi diagram called the multiplicatively weighted crystal growth Voronoi diagram, that can be used to model crystal growth when the crystals have different constant growth rates. In this new model, the distance from a site to a point in its region is measured along a shortest path lying entirely within the region. In the multiplicatively weighted crystal growth Voronoi diagram, a growing crystal (or region) may "wrap around" another site's region. When a region wraps around, distances from the site are in part measured along the boundary of the two regions, treating one of the regions as an obstacle, rather than along a straight line that passes through the region.

The worst case size of the multiplicatively weighted crystal growth Voronoi, diagram is 0(n 2). To construct the diagram, techniques from numerical analysis are used to approximate and to intersect curves described by a system of first order differential equations. Numerical methods to approximated a curve construct a polygonal approximation of the curve. One step of the numerical methods constructs an edge of the polygonal approximation. In the new Voronoi diagram, a step may require 0(n ) constant time operations. Let S be the number of steps required by the numerical method used just to draw the diagram. In the worst case, the algorithm presented in this thesis requires O (n 3) intersection calculations plus O (nS lg S ) time using O (n 3 + S ) space. A variant of this algorithm requires O (n 3) intersection calculations plus O (nS 2 + n 2S ) time using O (n 2) space.

Also presented are some variants of the new Voronoi diagram. One of these variants uses a convex polygon distance function. The multiplicatively weighted crystal growth Voronoi diagram using a convex polygon distance function does not require numerical methods to construct.

#### Recommended Citation

Schaudt, Barry F., "Multiplicatively Weighted Crystal Growth Voronoi Diagrams" (1991). *Dartmouth College Ph.D Dissertations*. 64.

https://digitalcommons.dartmouth.edu/dissertations/64

## Comments

Originally posted in the Dartmouth College Computer Science Technical Report Series, number PCS-TR92-177.