A New Polygon Nesting Trees Data Structure to Construct a Physical Polyhedral Object
Public Deposited- Resource Type
- Creator
- Abstract
We present a new data structure known as Polygon Nesting Tree Data Structure that has the capacity to output a polygon nesting tree at the given height h of a polyhedron. The data structure can produce a set of polygon nesting trees which is then sent to a layered manufacturing printer to produce the object. The thickness of a layer is controlled by composing a number of nesting trees where a higher number of nesting trees would improve the resolution of the polyhedron. Furthermore, we show some results of the implemented polygon nesting tree data structure slicing several polyhedra. The newly developed data structure can be used to solve other related problems.
- Subject
- Language
- Publisher
- Thesis Degree Level
- Thesis Degree Name
- Thesis Degree Discipline
- Identifier
- Rights Notes
Copyright © 2013 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, research, scholarship, and teaching. Theses may only be shared by linking to Carleton University Institutional Repository and no part may be used without proper attribution to the author. No part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner.
- Date Created
- 2013
Relations
- In Collection:
Items
Thumbnail | Title | Date Uploaded | Visibility | Actions |
---|---|---|---|---|
arruda-anewpolygonnestingtreesdatastructuretoconstruct.pdf | 2023-05-04 | Public | Download |