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 47 for “"triangulations"”.
-
Optimal Two-Dimensional Triangulations
… over all its triangles is the smallest among all triangulations of S.
-
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 …
-
Root polytopes, triangulations, and subdivision algebras
… results about root polytopes, such as explicit triangulations and formulas for their volumes and Ehrhart polynomials. Using the polytope technique an explicit combinatorial description of the reduced forms of monomials is also given. Inspired by Kirillov's algebras, the relations of which can be …
-
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 …
-
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
-
Euclidean Dynamical Triangulations: Running Couplings and Curvature Correlation Functions
… the progress made so far in Euclidean Dynamical Triangulations, a lattice theory of gravity, we examine how the couplings of the theory run with scale. We find that the dimensionless couplings $\hat{G}$ and $\hat{\Lambda}$ are not separately relevant, but $G\Lambda$ is. We argue that the lattice …
-
Hamiltonian cycles in maximal planar graphs and planar triangulations
… 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 fundamentals of planarity, since it is the …
-
An Existence Theorem for Planar Triangulations With Vertices of Degree Five, Six, and Eight
Made available in DSpace on 2014-12-11T18:24:02Z (GMT). No. of bitstreams: 1 7405660.pdf: 3504436 bytes, checksum: 49bb05fcf3050feba84eb456d373fd44 (MD5) Previous issue date: 1973
-
Partial Delaunay triangulations based routing, address configuration and date-centric storage in ad hock network
The work of this thesis is based on a recently proposed memoryless Greedy-Face-Greedy (GFG) routing algorithm that guarantees delivery in connected unit disk graphs (where two nodes are connected if and only if their distance is no more than the transmission radius, which is equal for all nodes). …
-
Topological modeling with simplicial complexes
… work described in this thesis is about regular triangulations, weighted $\alpha$-shapes and homeomorphic triangulations.
-
Investigating the Symmetry of the q,t-Catalan Polynomials Using New Statistics on Plane Binary Trees, Triangulations of Convex Polygons, and Paired Lattice Paths
… other combinatorial objects: plane binary trees, triangulations of convex polygons, and paired lattice paths; all of which are counted by the Catalan numbers. New statistics will be introduced on these objects in hopes of developing a combinatorial reason for the symmetry of the q,t-Catalan …
-
The topology of Baues complexes and flip graphs
… geometric combinatorics. These sets include the triangulations of a polytope, the tilings of a zonotope, and the extensions of an oriented matroid. Some long-standing conjectures are resolved, including the connectedness of triangulations of a product of two simplices and the sphericity of …
-
Discrete Riemann Maps and the Parabolicity of Tilings
… for such tilings. The final chapter considers triangulations of open topological disks. It has been shown that one can classify such triangulations as either parabolic or hyperbolic, depending on whether an associated combinatorial modulus is infinite or finite. We obtain a criterion for …
-
Parallel Delaunay Refinement and Space -Time Meshing
… all its dihedral angles are less than 90°. Triangulations of three-dimensional domains with acute tetrahedra are useful in mesh generation. We give several constructions for tiling space with acute tetrahedra.
-
On the Construction of Linear Prewavelets over a Regular Triangulation.
… over uniform refinements of regular triangulations have been studied. A corresponding theorem is given to ensure the linear independence of a set of different pre-wavelets obtained by summing pairs of these semi-prewavelets. This provides efficient multiresolutions of the spaces of …
-
Molecule surface triangulation from alpha shapes
… robust, and results in typologically correct triangulations. Our algorithm can also be used to accurately compute the shape of cavities in proteins.
-
Construction of Piecewise Linear Wavelets.
… linear wavelets with smaller support over type-2 triangulations. Then, parameterized wavelets are constructed using the orthogonality conditions.</p>
-
Geometric Decompositions and Networks - Approximation Bounds and Algorithms
… introduce the concept of higher-order Delaunay triangulations. We give an algorithm to compute which edges can be included in a higher-order Delaunay triangulation. We show that for 1-order Delaunay triangulations, most of the criteria we study can be optimized in O(n log n) time, for example, …
-
Compass routing on geometric graphs.
… based routing algorithms for trees, Delaunay triangulations and orthogonal convexly embedded geometric graphs. Several related results on various types of geometric graphs were also studied.
-
Algorithms for Smooth and Deformable Surfaces in Three Dimensions
… a parametric representation, static and dynamic triangulations. The triangulation algorithm is guaranteed to terminate with a high quality triangle mesh. In our investigation, geometric properties of the skin serve as the foundation of our proofs and insights for the algorithms. The proofs can be …
Page 1 of 3