Steinitz Theorems for Orthogonal Polyhedra

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of convex polyhedra, we find graph-theoretic characterizations of three classes of simple orthogonal polyhedra: corner polyhedra, which can be drawn by isometric projection in the plane with only one hidden vertex, xyz polyhedra, in which each axis-parallel line through a vertex contains exactly one other vertex, and arbitrary simple orthogonal polyhedra. In particular, the graphs of xyz polyhedra are exactly the bipartite cubic polyhedral graphs, and every bipartite cubic polyhedral graph with a 4-connected dual graph is the graph of a corner polyhedron. Based on our characterizations we find efficient algorithms for constructing orthogonal polyhedra from their graphs.Comment: 48 pages, 31 figure

Hierarchically hyperbolic spaces I: curve complexes for cubical groups

In the context of CAT(0) cubical groups, we develop an analogue of the theory of curve complexes and subsurface projections. The role of the subsurfaces is played by a collection of convex subcomplexes called a \emph{factor system}, and the role of the curve graph is played by the \emph{contact graph}. There are a number of close parallels between the contact graph and the curve graph, including hyperbolicity, acylindricity of the action, the existence of hierarchy paths, and a Masur--Minsky-style distance formula. We then define a \emph{hierarchically hyperbolic space}; the class of such spaces includes a wide class of cubical groups (including all virtually compact special groups) as well as mapping class groups and Teichm\"{u}ller space with any of the standard metrics. We deduce a number of results about these spaces, all of which are new for cubical or mapping class groups, and most of which are new for both. We show that the quasi-Lipschitz image from a ball in a nilpotent Lie group into a hierarchically hyperbolic space lies close to a product of hierarchy geodesics. We also prove a rank theorem for hierarchically hyperbolic spaces; this generalizes results of Behrstock--Minsky, Eskin--Masur--Rafi, Hamenst\"{a}dt, and Kleiner. We finally prove that each hierarchically hyperbolic group admits an acylindrical action on a hyperbolic space. This acylindricity result is new for cubical groups, in which case the hyperbolic space admitting the action is the contact graph; in the case of the mapping class group, this provides a new proof of a theorem of Bowditch.Comment: To appear in "Geometry and Topology". This version incorporates the referee's comment

An Overview of Rendering from Volume Data --- including Surface and Volume Rendering

Volume rendering is a title often ambiguously used in science. One meaning often quoted is: `to render any three volume dimensional data set'; however, within this categorisation `surface rendering'' is contained. Surface rendering is a technique for visualising a geometric representation of a surface from a three dimensional volume data set. A more correct definition of Volume Rendering would only incorporate the direct visualisation of volumes, without the use of intermediate surface geometry representations. Hence we state: `Volume Rendering is the Direct Visualisation of any three dimensional Volume data set; without the use of an intermediate geometric representation for isosurfaces'; `Surface Rendering is the Visualisation of a surface, from a geometric approximation of an isosurface, within a Volume data set'; where an isosurface is a surface formed from a cross connection of data points, within a volume, of equal value or density. This paper is an overview of both Surface Rendering and Volume Rendering techniques. Surface Rendering mainly consists of contouring lines over data points and triangulations between contours. Volume rendering methods consist of ray casting techniques that allow the ray to be cast from the viewing plane into the object and the transparency, opacity and colour calculated for each cell; the rays are often cast until an opaque object is `hit' or the ray exits the volume

On organizing principles of Discrete Differential Geometry. Geometry of spheres

Discrete differential geometry aims to develop discrete equivalents of the geometric notions and methods of classical differential geometry. In this survey we discuss the following two fundamental Discretization Principles: the transformation group principle (smooth geometric objects and their discretizations are invariant with respect to the same transformation group) and the consistency principle (discretizations of smooth parametrized geometries can be extended to multidimensional consistent nets). The main concrete geometric problem discussed in this survey is a discretization of curvature line parametrized surfaces in Lie geometry. We find a discretization of curvature line parametrization which unifies the circular and conical nets by systematically applying the Discretization Principles.Comment: 57 pages, 18 figures; In the second version the terminology is slightly changed and umbilic points are discusse

Combinatorial and Geometric Properties of Planar Laman Graphs

Laman graphs naturally arise in structural mechanics and rigidity theory. Specifically, they characterize minimally rigid planar bar-and-joint systems which are frequently needed in robotics, as well as in molecular chemistry and polymer physics. We introduce three new combinatorial structures for planar Laman graphs: angular structures, angle labelings, and edge labelings. The latter two structures are related to Schnyder realizers for maximally planar graphs. We prove that planar Laman graphs are exactly the class of graphs that have an angular structure that is a tree, called angular tree, and that every angular tree has a corresponding angle labeling and edge labeling. Using a combination of these powerful combinatorial structures, we show that every planar Laman graph has an L-contact representation, that is, planar Laman graphs are contact graphs of axis-aligned L-shapes. Moreover, we show that planar Laman graphs and their subgraphs are the only graphs that can be represented this way. We present efficient algorithms that compute, for every planar Laman graph G, an angular tree, angle labeling, edge labeling, and finally an L-contact representation of G. The overall running time is O(n^2), where n is the number of vertices of G, and the L-contact representation is realized on the n x n grid.Comment: 17 pages, 11 figures, SODA 201