Decomposing polygons into r-stars or alpha-bounded subpolygons
To make computations on large data sets more efficient, algorithms will frequently divide information into smaller, more manageable, pieces. This idea, for example, forms the basis of the common algorithmic approach known as Divide and Conquer. If we wish to use this principle in planar geometric co...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
University of Saskatchewan
2004
|
| Subjects: | |
| Online Access: | http://library.usask.ca/theses/available/etd-08032004-194707/ |