Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"planar triangulation"”.
-
Unstructured surface and volume decimation of tessellated domains
… is presented. The discretized space may be a planar triangulation, a general 3D surface triangulation, or a 3D tetrahedrization. The decimation algorithm enforces Dirichlet boundary conditions, uses only existing vertices, and assumes manifold geometry. Local dynamic vertex removal is …
-
Hamiltonian cycles in maximal planar graphs and planar triangulations
In this thesis we study planar graphs, in particular, maximal planar graphs and general planar triangulations. In Chapter 1 we present the terminology and notations that will be used throughout the thesis and review some elementary results on graphs that we shall need. In Chapter 2 we study the …
-
Splines on polytopal complexes
… vertex. Such bases are well known in the case of planar triangulations for $d\ge 3r+2$~\cite{HongDong,SuperSpline}. In Chapter~\ref{ch:LSSplines} we show that there is an analogue of locally-supported bases over polyhedral partitions, in the sense that, for $d\gg 0$, there is a basis for …
-
Hamiltonicity of maximal planar graphs and planar triangulations
… cycles and hamiltonian paths in maximal planar graphs and planar triangulations. The first part of this dissertation focus on the question, what is the maximal number k, so that every maximal planar graph with at most k separating triangles is hamiltonian? An analysis of the structure …