Polygonization of implicit models
| dc.contributor.author | Rovira Galvez, Mauricio Andres | |
| dc.contributor.supervisor | Wyvill, B. | |
| dc.date.accessioned | 2018-12-20T18:30:50Z | |
| dc.date.available | 2018-12-20T18:30:50Z | |
| dc.date.copyright | 2018 | en_US |
| dc.date.issued | 2018-12-20 | |
| dc.degree.department | Department of Computer Science | en_US |
| dc.degree.level | Master of Science M.Sc. | en_US |
| dc.description.abstract | In computer graphics, implicit modelling is a way of representing models by using combinations of implicit functions. These are then polygonized to produce a mesh typically formed from either quads or triangles. We present a comparison of two fundamental algorithms in polygonization in order to produce an algorithm that is better than the current industry standard: Marching Cubes. By using planar cross- sections we are able to bypass several problems from Marching Cubes, as well as produce a mesh of higher resolution and quality. The algorithm is limited to surfaces of genus 0, but it still outperforms Marching Cubes both in runtime as well as overall mesh quality. | en_US |
| dc.description.scholarlevel | Graduate | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/10443 | |
| dc.language | English | eng |
| dc.language.iso | en | en_US |
| dc.rights | Available to the World Wide Web | en_US |
| dc.subject | polygonization | en_US |
| dc.subject | implicit models | en_US |
| dc.title | Polygonization of implicit models | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- RoviraGalvez_MauricioAndres_MSc_2018.pdf
- Size:
- 7.95 MB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: