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 337 for “"Polyhedra"”.

  1. Folding Orthogonal Polyhedra

    … foldings of orthogonal polygons into orthogonal polyhedra. The particular problem examined here is whether a paper cutout of an orthogonal polygon with fold lines indicated folds up into a simple orthogonal polyhedron. The folds are orthogonal and the direction of the fold (upward or downward) is …

    waterloo Repository record for Folding Orthogonal Polyhedra (opens in a new tab)

  2. 2-lattice polyhedra

    gatech Repository record for 2-lattice polyhedra (opens in a new tab)

  3. Unfolding and Reconstructing Polyhedra

    This thesis covers work on two topics: unfolding polyhedra into the plane and reconstructing polyhedra from partial information. For each topic, we describe previous work in the area and present an array of new research and results. Our work on unfolding is motivated by the problem of …

    waterloo Repository record for Unfolding and Reconstructing Polyhedra (opens in a new tab)

  4. Reconstruction of Orthogonal Polyhedra

    … this thesis I study reconstruction of orthogonal polyhedral surfaces and orthogonal polyhedra from partial information about their boundaries. There are three main questions for which I provide novel results. The first question is "Given the dual graph, facial angles and edge lengths of an …

    waterloo Repository record for Reconstruction of Orthogonal Polyhedra (opens in a new tab)

  5. FACES OF MATCHING POLYHEDRA

    Let G = (V, E, ~) be a finite loopless graph, let b=(bi:ieV) be a vector of positive integers. A feasible matching is a vector X = (x.: j e: E) J of nonnegative integers such that for each node i of G, the sum of the over the edges j of G incident with i is no greater than bi. The matching …

    waterloo Repository record for FACES OF MATCHING POLYHEDRA (opens in a new tab)

  6. Edge length minimizing polyhedra

    … edge length minimization problems on convex polyhedra: first, minimizing edge length for fixed volume (Melzak's Problem), and second, minimizing edge length for fixed surface area (Aberth's Problem). Specific examples are given that demonstrate the necessity of restricting the problems to …

    rice Repository record for Edge length minimizing polyhedra (opens in a new tab)

  7. INTERMEDIATE LOGICS AND POLYHEDRA

    Polyhedra enjoy a peculiar property: every geometric shape with a certain “regularity” – in specific terms, certain classes of (closed) topological manifolds – can be captured by a polyhedron via triangulation, that is, by subdividing the geometric shapes into appropriate “triangles”, called …

    milano Repository record for INTERMEDIATE LOGICS AND POLYHEDRA (opens in a new tab)

  8. Unfoldings of Convex Polyhedra

    A pseudo-edge graph of a convex polyhedron K is a 3-connected embedded graph in K whose vertices coincide with those of K, whose edges are distance minimizing geodesics, and whose faces are convex. We construct a convex polyhedron K in Euclidean 3-space with a pseudo-edge graph with respect to …

    gatech Repository record for Unfoldings of Convex Polyhedra (opens in a new tab)

  9. MICROMOLDING AND APPLICATIONS OF SOFT POLYHEDRA

    … approach was developed to create soft-polyhedra with more complex geometries such as tetrahedra, octahedra, dodecahedra and truncated octahedra. Compared to conventional methods of micromolding, this methodology combines the technique of micromolding with self-folding. Self-folding is …

    jhu Repository record for MICROMOLDING AND APPLICATIONS OF SOFT POLYHEDRA (opens in a new tab)

  10. SUBMODULAR FUNCTIONS, GRAPHS AND INTEGER POLYHEDRA

    … of the faces of certain combinatorially ­defined polyhedra. In particular, we examine the vertices and facets of these polyhedra. Chapter 2 contains the essential mathematical background in polyhedral theory, linear programming and graph theory. We also discuss the existence of an integer-valued …

    waterloo Repository record for SUBMODULAR FUNCTIONS, GRAPHS AND INTEGER POLYHEDRA (opens in a new tab)

  11. Smooth Isotopies of Manifolds Surrounding Polyhedra

    Made available in DSpace on 2014-12-09T22:17:51Z (GMT). No. of bitstreams: 1 6915397.pdf: 2258574 bytes, checksum: 4cf81ed0c3058278598374fe1f09f251 (MD5) Previous issue date: 1969

    uiuc Repository record for Smooth Isotopies of Manifolds Surrounding Polyhedra (opens in a new tab)

  12. Reconstruction and Visualization of Polyhedra Using Projections

    … reconstruction and visualization of polygons and polyhedra. <br /><br /> Three problems are considered in reconstruction of polygons and polyhedra, given a set of projection characteristics. The first problem is to reconstruct a closed convex polygon (polyhedron) given the number of visible edges …

    waterloo Repository record for Reconstruction and Visualization of Polyhedra Using Projections (opens in a new tab)

  13. The (Co)isoperimetric Problem in (Random) Polyhedra

    We consider some aspects of the global geometry of cellular complexes. Motivated by techniques in graph theory, we develop combinatorial versions of isoperimetric and Poincare inequalities, and use them to derive various geometric and topological estimates. This has a progression of three major …

    toronto-retro Repository record for The (Co)isoperimetric Problem in (Random) Polyhedra (opens in a new tab)

  14. Fully transitive polyhedra with crystallographic symmetry groups

    … up to euclidean similarity, fully-transitive polyhedra which have crystallographic symmetry groups. Branko Grunbaum's definition of polyhedron is used, in which the faces are "hollow" - i.e., a face is a collection of edges. The approach is algorithmic: in a euclidean space $R\sp{n}$, assume …

    rice Repository record for Fully transitive polyhedra with crystallographic symmetry groups (opens in a new tab)

  15. Fundamental Transversals on the Complexes of Polyhedra

    … Transversals' on the faces of the Complexes of polyhedra (meaning threedimensional polytopes). A Complex of a polyhedron is the collection of the vertex points of the polyhedron, line segment edges and polygonal faces of the polyhedron. We will prove that for the faces of any 3-dimensional …

    usf Repository record for Fundamental Transversals on the Complexes of Polyhedra (opens in a new tab)

  16. Rigidity Theory of Circles, Polygons, and Polyhedra

    … These structures include circle packings, polyhedra, and various special sets of points with inequality constraints, known as tensegrities. They are natural extensions of the bar-joint frameworks that occur in many studies. The rigidity of circles with a given tangency pattern and fixed …

    cornell Repository record for Rigidity Theory of Circles, Polygons, and Polyhedra (opens in a new tab)

Page 1 of 17