Optimal base complexes for quadrilateral meshes
| Autor: | Konrad Polthier, Faniry H. Razafindrazaka |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Quadrilateral
Diagonal Aerospace Engineering 020207 software engineering Topology (electrical circuits) 02 engineering and technology Base (topology) Topology Computer Graphics and Computer-Aided Design Computer Science::Graphics Singularity Modeling and Simulation Bounded function Automotive Engineering 0202 electrical engineering electronic engineering information engineering Graph (abstract data type) 020201 artificial intelligence & image processing Gravitational singularity ComputingMethodologies_COMPUTERGRAPHICS Mathematics |
| Zdroj: | Computer Aided Geometric Design. :63-74 |
| ISSN: | 0167-8396 |
| DOI: | 10.1016/j.cagd.2017.02.012 |
| Popis: | In this paper we give an explicit algorithm to optimize the global structure of quadrilateral meshes i.e. base complexes, using a graph perfect matching. The approach consists of constructing a special graph over the singularity set of the mesh and finding all quadrilateral based complex subgraphs of that graph. We show by construction that there is always an optimal base complex to a given quadrilateral mesh relative to coarseness versus geometry awareness. Local structures of the mesh induce extra constraints which have been previously ignored but can give a completely different layout. These are diagonal, multiple and close to zero length edges. We give an efficient solution to solve these problems and improve the computation speed. Generally all base complex optimization schemes are bounded by the topology of the singularities, we explore the space of layouts encoded in the graph to identify removable singularities of the mesh while simultaneously optimize the base complex. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect