Full text
| |
| Author(s): |
Lucas Moutinho Bueno
Total Authors: 1
|
| Document type: | Doctoral Thesis |
| Press: | Campinas, SP. |
| Institution: | Universidade Estadual de Campinas (UNICAMP). Instituto de Computação |
| Defense date: | 2016-09-16 |
| Examining board members: |
Jorge Stolfi;
José Coelho de Pina Junior;
Daniel Morgato Martin;
Christiane Neme Campos;
Orlando Lee
|
| Advisor: | Jorge Stolfi |
| Abstract | |
This thesis proposes algorithms to subdivide topological maps of two and three dimensions into triangulations colored on the vertices, using 3 and 4 colors, respectively. The algo- rithms attempt to create as few triangles (or tetrahedra) as possible in time compatible to the conventional method of the barycentric subdivision. We prove, both theoretically and empirically, that the proposed algorithms generate fewer triangles (or tetrahedra) than the barycentric subdivision. Colored triangulations are important for the use of the GEM data structure to repre- sent the topology of triangulations of any dimension d ? 2 (AU) | |
| FAPESP's process: | 12/14698-7 - GEM data structure for topological map triangulation of n dimensions. |
| Grantee: | Lucas Moutinho Bueno |
| Support Opportunities: | Scholarships in Brazil - Doctorate |