Voxel-space shape grammars
| dc.contributor.advisor | Marais, Patrick | en_ZA |
| dc.contributor.advisor | Gain, James | en_ZA |
| dc.contributor.author | Crumley, Zacharia | en_ZA |
| dc.date.accessioned | 2014-12-27T19:54:54Z | |
| dc.date.available | 2014-12-27T19:54:54Z | |
| dc.date.issued | 2012 | en_ZA |
| dc.description.abstract | The field of Procedural Generation is being increasingly used in modern content generation for its ability to significantly decrease the cost and time involved. One such area of Procedural Generation is Shape Grammars, a type of formal grammar that operates on geometric shapes instead of symbols. Conventional shape grammar implementations use mesh representations of shapes, but this has two significant drawbacks. Firstly, mesh representations make Boolean geometry operations on shapes difficult to accomplish. Boolean geometry operations allow us to combine shapes using Boolean operators (and, or, not), producing complex, composite shapes. A second drawback is that sub-, or trans-shape detailing is challenging to achieve. To address these two problems with conventional mesh-based shape grammars, we present a novel extension to shape grammars, in which a voxel representation of the generated shapes is used. | en_ZA |
| dc.identifier.apacitation | Crumley, Z. (2012). <i>Voxel-space shape grammars</i>. (Thesis). University of Cape Town ,Faculty of Science ,Department of Computer Science. Retrieved from http://hdl.handle.net/11427/10319 | en_ZA |
| dc.identifier.chicagocitation | Crumley, Zacharia. <i>"Voxel-space shape grammars."</i> Thesis., University of Cape Town ,Faculty of Science ,Department of Computer Science, 2012. http://hdl.handle.net/11427/10319 | en_ZA |
| dc.identifier.citation | Crumley, Z. 2012. Voxel-space shape grammars. University of Cape Town. | en_ZA |
| dc.identifier.ris | TY - Thesis / Dissertation AU - Crumley, Zacharia AB - The field of Procedural Generation is being increasingly used in modern content generation for its ability to significantly decrease the cost and time involved. One such area of Procedural Generation is Shape Grammars, a type of formal grammar that operates on geometric shapes instead of symbols. Conventional shape grammar implementations use mesh representations of shapes, but this has two significant drawbacks. Firstly, mesh representations make Boolean geometry operations on shapes difficult to accomplish. Boolean geometry operations allow us to combine shapes using Boolean operators (and, or, not), producing complex, composite shapes. A second drawback is that sub-, or trans-shape detailing is challenging to achieve. To address these two problems with conventional mesh-based shape grammars, we present a novel extension to shape grammars, in which a voxel representation of the generated shapes is used. DA - 2012 DB - OpenUCT DP - University of Cape Town LK - https://open.uct.ac.za PB - University of Cape Town PY - 2012 T1 - Voxel-space shape grammars TI - Voxel-space shape grammars UR - http://hdl.handle.net/11427/10319 ER - | en_ZA |
| dc.identifier.uri | http://hdl.handle.net/11427/10319 | |
| dc.identifier.vancouvercitation | Crumley Z. Voxel-space shape grammars. [Thesis]. University of Cape Town ,Faculty of Science ,Department of Computer Science, 2012 [cited yyyy month dd]. Available from: http://hdl.handle.net/11427/10319 | en_ZA |
| dc.language.iso | eng | en_ZA |
| dc.publisher.department | Department of Computer Science | en_ZA |
| dc.publisher.faculty | Faculty of Science | en_ZA |
| dc.publisher.institution | University of Cape Town | |
| dc.subject.other | Computer Science | en_ZA |
| dc.title | Voxel-space shape grammars | en_ZA |
| dc.type | Master Thesis | |
| dc.type.qualificationlevel | Masters | |
| dc.type.qualificationname | MSc | en_ZA |
| uct.type.filetype | Text | |
| uct.type.filetype | Image | |
| uct.type.publication | Research | en_ZA |
| uct.type.resource | Thesis | en_ZA |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- thesis_sci_2012_crumley_z.pdf
- Size:
- 6.13 MB
- Format:
- Adobe Portable Document Format
- Description: