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 207 for “"polyhedron"”.

  1. An algorithm for polyhedron modelling and its implementation

    … between 2-D polygon modelling and 3-D polyhedron modelling, the 2-D polygon modelling algorithm is presented next, followed by the 3-D polyhedron modelling algorithm.

    ubc Repository record for An algorithm for polyhedron modelling and its implementation (opens in a new tab) Download PDF for An algorithm for polyhedron modelling and its implementation (opens in a new tab)

  2. Constant storage for computing shortest paths for a polyhedron

    … for storing shortest path information for a polyhedron. This scheme is obtained by applying the constant storage scheme of Han and Saxena [5] on the outward layout of Sharir and Schorr [10]. We achieve constant storage and O(log n + k) time for computing the shortest path from the source …

    umkc Repository record for Constant storage for computing shortest paths for a polyhedron (opens in a new tab)

  3. Finding the minimum illuminating direction set for a polyhedron

    … illuminating direction set cover problem for a polyhedron seeks the minimum cardinality set of 3-D directions that illuminate the entire polyhedron surface. This thesis introduces a new algorithm for solving such problem. The algorithm includes four steps: (1) Computing sliding planes; (2) …

    iastate Repository record for Finding the minimum illuminating direction set for a polyhedron (opens in a new tab)

  4. The Master Equality Polyhedron: Two-Slope Facets and Separation Algorithm

    … presents our findings about the Master Equality Polyhedron (MEP), an extension of Gomory's Master Group Polyhedron. We prove a theorem analogous to Gomory and Johnson's two-slope theorem for the case of the MEP. We then show how such a theorem can lead to facet defining inequalities for MEPs or …

    waterloo Repository record for The Master Equality Polyhedron: Two-Slope Facets and Separation Algorithm (opens in a new tab)

  5. An integer polyhedron related to the design of survivable communication networks.

    The linear programming cutting plane method has proven to be quite successful for solving certain "hard" combinatorial optimization problems, c.f. (1), (6), (12), (24), (26). A great deal of this success is due to the use of problem specific cutting planes which define facets of the underlying …

    ottawa-retro Repository record for An integer polyhedron related to the design of survivable communication networks. (opens in a new tab)

  6. Modelling the relationship between a hyperbolic tessellation and a corresponding triply periodic polyhedron

    … user will also be able to create triply periodic polyhedrons in this system. Finally, the system models the relationship between a hyperbolic tessellation and a corresponding triply periodic polyhedron using an interactive and simple mechanism. The tool was created in the Unity Game Engine using …

    umn Repository record for Modelling the relationship between a hyperbolic tessellation and a corresponding triply periodic polyhedron (opens in a new tab)

  7. Establishing the Connection Between a Triply Periodic Polyhedron and its Hyperbolic Covering Tessellation

    The physical world we live in is usually portrayed using the five postulates of Euclidean geometry. Endeavors to infer the fifth postulate from other four led to the discovery of hy- perbolic geometry in 19th century. However some facts about hyperbolic geometry, for example the sum of angles in a …

    umn Repository record for Establishing the Connection Between a Triply Periodic Polyhedron and its Hyperbolic Covering Tessellation (opens in a new tab)

  8. Real flag manifolds and a construction of spaces over a polyhedron: Mathematical Investigations arising from the Jahn-Teller effect

    … of topological spaces over an arbitrary polyhedron and show that it subsumes the lattice construction of R. R. Douglas and A. R. Rutherford. A Simplicial Approximation Theorem is proven for the general construction, for maps from a polyhedron to one of our spaces lying over another …

    ubc Repository record for Real flag manifolds and a construction of spaces over a polyhedron: Mathematical Investigations arising from the Jahn-Teller effect (opens in a new tab) Download PDF for Real flag manifolds and a construction of spaces over a polyhedron: Mathematical Investigations arising from the Jahn-Teller effect (opens in a new tab)

  9. Covering polyhedra by motifs with triangular fundamental regions.

    In geometry, a “net” of a polyhedron is a two-dimensional figure where all the polygons are joined by edges, which when folded becomes a three-dimensional polyhedron. A “subnet” is a subset of a net which is formed by the faces of the polyhedron. Technically, multiple nets can exist for a …

    umn Repository record for Covering polyhedra by motifs with triangular fundamental regions. (opens in a new tab)

  10. Classifying simplicial dissections of convex polyhedra with symmetry

    A convex polyhedron is the convex hull of a finite set ofpoints in R3. A triangulation of a convex polyhedron is a decomposition into a finite number of 3-simplices such that any two intersect in a common face or are disjoint. A simplicial dissection is a decomposition into a finite number of …

    colostate Repository record for Classifying simplicial dissections of convex polyhedra with symmetry (opens in a new tab)

  11. Προκαταρκτικός σχεδιασμός προϊόντων: γεωμετρικά και πληροφοριακά μοντέλα για αλληλεπιδραστικό σχεδιασμό

    The “Automatic Construction of a Polyhedron from a Single Sketch” is still an unsolved problem, even for the plainest case where the polyhedron is trihedral and planar. This doctoral thesis presents an algorithm for the “Construction of a Polyhedron from a Single Plane Sketch” and provides a new …

    greece Repository record for Προκαταρκτικός σχεδιασμός προϊόντων: γεωμετρικά και πληροφοριακά μοντέλα για αλληλεπιδραστικό σχεδιασμό (opens in a new tab)

  12. Folding Orthogonal Polyhedra

    … indicated folds up into a simple orthogonal polyhedron. The folds are orthogonal and the direction of the fold (upward or downward) is also given. We present a polynomial time algorithm to solve this problem. Next we consider the same problem with the exception that the direction of the folds …

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

  13. Perturbed polyhedra and the construction of local Euler-Maclaurin formulas

    A polyhedron P is a subset of a rational vector space V bounded by hyperplanes. If we fix a lattice in V , then we may consider the exponential integral and sum, two meromorphic functions on the dual vector space which serve to generalize the notion of volume of and number of lattice points …

    bu Repository record for Perturbed polyhedra and the construction of local Euler-Maclaurin formulas (opens in a new tab)

  14. Fundamental Transversals on the Complexes of Polyhedra

    … 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 complex of a polyhedron under face adjacency relations, that a `Face …

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

  15. Reconstruction and Visualization of Polyhedra Using Projections

    … is to reconstruct a closed convex polygon (polyhedron) given the number of visible edges (faces) from each of a set of directions <em>S</em>. The main results for this problem include the necessary and sufficient conditions for the existence of a polygon that realizes the projections. This …

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

  16. Symbolic Representation of Convex Polyhedra in High-Dimensional Spaces

    … three original data structures, the Convex Polyhedron Decision Diagram (CPDD), the Decomposed Convex Polyhedron (DCP), and the Internally Decomposed Convex Polyhedron (IDCP), suited for representing symbolically convex polyhedra in high-dimensional spaces. For each of them, we develop an …

    liege Repository record for Symbolic Representation of Convex Polyhedra in High-Dimensional Spaces (opens in a new tab) Restricted access

  17. The structure and replication of some insect viruses

    … virus particle and an aggregated form of the polyhedron protein were separated and purified most effectively by density gradient centrifugation. Samples of virus particles and aggregated polyhedron protein were examined electron microscopically and used for the production of antisera. Antisera …

    oxford Repository record for The structure and replication of some insect viruses (opens in a new tab)

  18. Reconstruction of Orthogonal Polyhedra

    … lengths of an orthogonal polyhedral surface or polyhedron, is it possible to reconstruct the dihedral angles?" The second question is "Given the dual graph, dihedral angles and edge lengths of an orthogonal polyhedral surface or polyhedron, is it possible to reconstruct the facial angles?" The …

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

Page 1 of 11