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 20 of 208 for “"triangulations"”.

  1. Reconfiguring Triangulations

    … results in this thesis lie at the confluence of triangulations and reconfiguration. We make the observation that certain solved and unsolved problems about triangulations can be cast as reconfiguration problems. We then solve some reconfiguration problems that provide us new insights about …

    waterloo Repository record for Reconfiguring Triangulations (opens in a new tab)

  2. Adaptive triangulations

    … approximation of functions over sets of triangulations. Recently developed adaptive methods, where the hierarchy of triangulations is not fixed in advance and depends on the local properties of the function, have received considerable attention. The quick development of these adaptive …

    manitoba Repository record for Adaptive triangulations (opens in a new tab)

  3. Deletion-Induced Triangulations

    Let d > 0 be a fixed integer and let A ⊆ ℝd be a collection of n ≥ d + 2 points which we lift into ℝd+1. Further let k be an integer satisfying 0 ≤ k ≤ n-(d+2) and assign to each k-subset of the points of A a (regular) triangulation obtained by deleting the specified k-subset and projecting down …

    uky-thes Repository record for Deletion-Induced Triangulations (opens in a new tab)

  4. Morphing planar triangulations

    … al. proved that the morphing problem for planar triangulations can be solved using polynomially many steps. In 1990 it was shown by Schnyder that using special drawings that we call Schnyder drawings it is possible to draw a planar graph on a O(n)×O(n) grid, and moreover such drawings can be …

    waterloo Repository record for Morphing planar triangulations (opens in a new tab)

  5. Optimal Two-Dimensional Triangulations

    … over all its triangles is the smallest among all triangulations of S.

    uiuc Repository record for Optimal Two-Dimensional Triangulations (opens in a new tab)

  6. Finding obstructions within irreducible triangulations

    … of a surface S as subgraphs of the irreducible triangulations of the surface S with a crosscap added. A new data structure, i.e. an augmented rotation system, is presented and used to create an exponential-time algorithm for embedding graphs in any surface with a constant-time check of the …

    uvic Repository record for Finding obstructions within irreducible triangulations (opens in a new tab)

  7. Veering Triangulations: Theory and Experiment

    … the stable lamination of the monodromy. These triangulations were introduced by Agol in 2011, and have been further studied by several others in the years since. In the first part of this work, we obtain experimental results which shed light on the combinatorial structure of veering …

    temple Repository record for Veering Triangulations: Theory and Experiment (opens in a new tab)

  8. Inscribable polytopes via Delaunay triangulations

    Die Arbeit behandelt einschreibbare simpliziale Polytope und insbesondere deren f-Vektoren. Durch Konstruktion spezieller Delaunay Triangulierungen zeigt der Autor folgende Hauptresultate: Zu jedem simplizialen Polytop gibt es ein eingeschriebenes simpliziales Polytop gleicher Dimension, das gleich …

    fu-berlin Repository record for Inscribable polytopes via Delaunay triangulations (opens in a new tab)

  9. Minimum Feature Size in Proper Triangulations

    … This measure applies to both a polygon and its triangulations, and the ratio of the input minimum feature size to that of the triangulation is the degradation. Even when Steiner vertices are allowed, some degradation remains unavoidable for proper triangulations, in which every bounded face has …

    ottawa-retro Repository record for Minimum Feature Size in Proper Triangulations (opens in a new tab)

  10. Counting Hamiltonian cycles in planar triangulations

    Whitney showed that every planar triangulation without separating $3$-cycles is Hamiltonian. This result was extended to all $4$-connected planar graphs by Tutte. Hakimi, Schmeichel, and Thomassen showed the first lower bound $n/\log _2 n$ for the number of Hamiltonian cycles in every $n$-vertex …

    gatech Repository record for Counting Hamiltonian cycles in planar triangulations (opens in a new tab)

  11. Concerning Triangulations of Products of Simplices

    … a combinatorial study of certain aspects of triangulations of cartesian products of simplices, particularly in relation to their relevance in toric algebra and to their underlying product structure. The first chapter reports joint work with Samu Potka. The object of study is a class of …

    qucosa-diss

  12. k-irreducible triangulations of 2-manifolds

    This thesis deals with k-irreducible triangulations of closed, compact 2-manifolds without boundary. A triangulation is k-irreducible, if all its closed cycles of length less than k are nullhomotopic and no edge can be contracted without losing this property. k-irreducibility is a generalization of …

    qucosa-diss

  13. Transforming Plane Triangulations by Simultaneous Diagonal Flips

    We explore the problem of transforming plane triangulations using simultaneous diagonal flips. Wagner showed that any n-vertex plane triangulation can be transformed to any other plane triangulation on equal number of vertices using a finite sequence of diagonal flips. Later on it has been …

    ottawa-retro Repository record for Transforming Plane Triangulations by Simultaneous Diagonal Flips (opens in a new tab)

  14. Weighted Delaunay Triangulations of Piecewise-Flat Surfaces

    … where we have to ensure that only finitely many triangulations are possible.When the vertices of a piecewise-flat surface have weights, we want to find the weighted Delaunay triangulation using a flip algorithm. In this dissertation, we prove that the maximum edge length during the algorithm is …

    arizona-thes Repository record for Weighted Delaunay Triangulations of Piecewise-Flat Surfaces (opens in a new tab)

  15. Spaces of Isotopic Triangulations of a 2-Cell

    Made available in DSpace on 2014-12-09T22:17:59Z (GMT). No. of bitstreams: 1 7105048.pdf: 4185806 bytes, checksum: 1846252767c8d24856dcb89ca51be162 (MD5) Previous issue date: 1970

    uiuc Repository record for Spaces of Isotopic Triangulations of a 2-Cell (opens in a new tab)

  16. Some Results on Vertex-Minimal Triangulations of Manifolds

    … some results on vertex-minimal (simplicial) triangulations of manifolds. We are interested in triangulations that have nice geometric and combinatorial properties. In the first chapter, we list some defnitions used throughout the thesis. In the second chapter, we give an elementary …

    maynooth Download PDF for Some Results on Vertex-Minimal Triangulations of Manifolds (opens in a new tab)

  17. A study of data-dependent triangulations for terrains

    When simplifying and approximating surfaces with triangulations, we must determine what is a good triangulation. Thus, we need to define the criterion to measure the quality of a triangulation. There exist many useful criteria in the literature, such as Max-Min angle, Min-Max angle, least squares …

    concordia Download PDF for A study of data-dependent triangulations for terrains (opens in a new tab)

  18. The Microcanonical Density of States and Causal Dynamical Triangulations

    … non-perturbatively using causal dynamical triangulations is initiated. Regge calculus expressions for extrinsic curvature are extended to the case of Lorentzian hypersurfaces and used to derive Regge calculus expressions for quasilocal energy-momentum. The Regge version of the black hole …

    toronto-retro Repository record for The Microcanonical Density of States and Causal Dynamical Triangulations (opens in a new tab)

Page 1 of 11