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 8 of 8 for “"convex polyhedron"”.
-
A pseudopolynomial algorithm for Alexandrov's theorem
… global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedron. Recent work by Bobenko and Izmestiev describes a differential equation whose solution is the polyhedron corresponding to a given metric. We describe an algorithm based on …
-
Boundaries of K-types in discrete series
… close to a set of lattice points in a noncompact convex polyhedron. In this paper we shall describe a recursive algorithm for finding the boundary facets of this polyhedron.
-
Closed quasigeodesics, escaping from polygons, and conflict-free graph coloring
… A closed quasigeodesic on the surface of a polyhedron is a loop which can everywhere locally be unfolded to a straight line: thus, it's straight on faces, uniquely determined on edges, and has as much flexibility at a vertex as that vertex's curvature. On any polyhedron, at least three …
-
Vertex enumeration and counting for certain classes of polyhedra
… some or all solutions that lie at corners of a convex polyhedron defined by a set of linear inequalities. Many algorithms have been developed for general polytopes. The most successful of these, from both an empirical and theoretical viewpoint, are based on pivoting. Dyer [24] gives an algorithm …
-
On folding and unfolding with linkages and origami
… to continuously flatten the surface of any convex polyhedron without distorting intrinsic surface distances or letting the surface pierce itself. This origami motion is quite general, and applies to convex polytopes of any dimension. To prove that no piercing occurs, we apply the same …
-
Interpretable Network Representations
… hull which represents a network as a 3D convex polyhedron using stochastic Kronecker graphs as the network embedding method, and a Spectral Path which represents a network as a 3D path connecting the spectral moments of the network and its subgraphs.<p>We demonstrate that network shapes …
-
Essays on Information Economics
… of rationalizable outcomes of a given game as a convex polyhedron. Chapter 4 is co-authored with Stephen Morris and Dirk Bergemann and is titled "A Strategic Topology on Information Structures.'' Two information structures are said to be close if, with high probability, there is approximate …
-
Flexible polyhedra - Exploring finite mechanisms of triangulated polyhedra
… whether each rotational position of a flexible polyhedron is physically possible; then a range of motion is defined between occurrences of clashes at the two ends; finally, an optimisation tool is used to maximise the range of motion. By using these tools, the range of motion of two types of …