Straight Skeletons and Mitered Offsets of Nonconvex Polytopes

We give a concise definition of mitered offset surfaces for nonconvex polytopes in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbbm {R}}^3$$\end{document}R3, along with a proof of existence and a discussion of basic properties. These results imply the existence of 3D straight skeletons for general nonconvex polytopes. The geometric, topological, and algorithmic features of such skeletons are investigated, including a classification of their constructing events in the generic case. Our results extend to the weighted setting, to a larger class of polytope decompositions, and to general dimensions. For (weighted) straight skeletons of an n-facet polytope in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbbm {R}}^d$$\end{document}Rd, an upper bound of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(n^d)$$\end{document}O(nd) on their combinatorial complexity is derived. It relies on a novel layer partition for straight skeletons, and improves the trivial bound by an order of magnitude for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$d \ge 3$$\end{document}d≥3.

geometric and algorithmic properties have been studied, in computational geometry and also in more practically oriented fields.
The most prominent and widely used skeletal structure is the medial axis. It represents the set of centers of all multi-tangential circles (or spheres) inscribed to the object. Defined by distances to the boundary, the medial axis keeps a strong correspondence to the shape of the object; we refer the reader to [6,8,29] for an account of properties and further literature. However, even when the object boundary is piecewise linear (like for a polygon in the plane, or a polytope in 3-space), the medial axis contains curved elements when the object is nonconvex. This is a drawback in its computer construction and representation, and sometimes also in applications, especially in three dimensions where the medial axis attains a complex topology and a high algebraic degree. In fact, there have been several approaches to linearizing and simplifying this concept.
The so-called straight skeleton of a polygon (or polytope) offers a potential alternative. This structure is not defined via distances but rather in a procedural way, by means of a mitered boundary offsetting process which shrinks the object in a self-parallel way till it vanishes. In two dimensions, the shrinking process is combinatorially trivial, and the geometry of the straight skeleton is well understood [3,4]. It is a unique graph whose leaf nodes are polygon vertices like with the medial axis, but whose arcs stem from angle bisectors and thus are straight-line segments. Figure 1 gives an illustration and some further explanations.
The planar straight skeleton has proved useful in various areas, including CAD (offset calculation and path generation), image processing (shape comparison and manipulation), architecture (automatic roof design), GIS (terrain and city modeling), and others; see e.g. [8,16,21,32] and references therein. Still, designing fast and simple construction algorithms has remained a challenge, though powerful tools like motorcycle graphs [21] and gradient-based decompositions [16] have been developed, which are of interest in their own right.
It is desirable to find appropriate generalizations of the straight skeleton to three dimensions, as this would provide piecewise linear solutions for three main operations on nonconvex 3D polytopes which the medial axis cannot offer: Offset calculation (a standard operation in CAD), the construction of a skeletal structure (that encodes the shape of the polytope in a suitable manner), and decomposition (into a polyhedral mesh with simple cells). However, the precise definition of the shrinking process in 3D Fig. 1 The boundary of the input polygon is translated inwards at unit speed (left). Thereby, the vertices of the polygon move on angle bisectors and trace out a unique tree structure-the straight skeleton (right). There are two kinds of 'events' that alter the polygon boundary combinatorially: A polygon edge shrinks to length zero (the edge event), or a polygon vertex runs into a non-incident polygon edge (the split event) bears difficulties, and even the existence of a mitered offset surface which is continuous and not self-intersecting is no longer trivial.
Surprisingly, not much attention has been paid in computational geometry to these basic questions. Intuitively speaking, shrinking a given polytope means offsetting its boundary surface in inward direction, in a self-parallel way and at unit speed. Thereby the polytope facets 'sweep out' the cells of the 3D straight skeleton. The polytope edges (which move in angle bisector planes), and the polytope vertices (which move along trisector lines), trace out the sheets and the spokes of the skeleton, respectively, which border its cells. The shrinking polytope undergoes changes of various kinds, purely geometrical, or of combinatorial nature (changes in the boundary structure), or topological (appearance or merge of tunnels, or breaking apart).
Erickson (see [18]) observed the interesting fact that offset surfaces that arise in this way may be ambiguous, leaving different choices for the shrinking process and thus for the skeleton construction. Indeed, we encounter this problem already 'in the first moment', when polytope vertices of higher degree have to be resolved into several vertices with different incidence structure on the offset polytope surface: In general, only polytope vertices of degree 3 behave like polygon vertices, in the sense that they do not split when the object is shrunk infinitesimally. An elegant idea how to reduce the vertex resolution problem to a two-dimensional problem is proposed in Barequet et al. [12], using the combinatorial structure of the weighted 1 straight skeleton [7,13,21] in a sectional plane that cuts off the polytope vertex in question. It remains unclear, though, how to generalize this method to vertices whose incident polytope faces positively span 3-space (for example, saddle point type vertices), as the use of more than one sectional plane leads to the necessity of merging planar straight skeletons, which is an unsolved problem.
The present paper, which contains and extends material from the conference papers [9,10], is further concerned with these questions. Necessary and sufficient conditions for valid mitered offset surfaces of a nonconvex polytope are given (Sect. 3), along with a proof of existence, and a discussion of their basic properties and ambiguities. An (inevitably general) definition of nonconvex polytopes is stated in Sect. 2. We then revisit the two-dimensional reduction of the vertex resolution problem, and generalize it for polytope vertices of arbitrary type (Sect. 4). This solves, at the same time, the 3D straight skeleton construction problem for nonconvex polytopes (Sect. 5), as polytope vertices of higher degree caused by the shrinking process can be treated in the same uniform manner. In fact, for our vertex splitting algorithm, the type of a skeleton construction event needs not be known in order to process the event correctly. We gain further insight into the structure of 3D straight skeletons, concerning their facial structure and topology in Sect. 5, and their geometry in Sect. 6, where we also provide an enumeration and categorization of all events that can take place in the generic case. A more general class of polytope decompositions is introduced in Sect. 7, where certain members can be computed by a simple direct method. The basic concepts and proofs in Sects. 3-7 do not depend on the offset speed, nor on the dimension, which allows for extending our results to the weighted setting (Sect. 8), and to general dimensions (Sect. 9). We conclude the paper with some experimental results obtained by implementing our 3D straight skeleton construction algorithm (Sect. 10). Some potential applications are mentioned, like flattening a polytope [19], decomposing a polytope [22] into small monotone cells, and offsetting a polygonal mesh for the purpose of ε-thinning [34].
There are certain special cases where 3D straight skeleton algorithms have been known. First of all for convex polytopes, where the straight skeleton coincides with the medial axis, and can be interpreted as the (projected) lower envelope of n hyperplanes in 4-space that correspond to the n polytope facets. The skeleton therefore consists of convex cells whose overall size (combinatorial complexity) is (n 2 ) in the worst case, and it can be computed in O(n 2 ) time by any optimal 4D convex hull algorithm; see e.g. [27]. Similarly, the straight skeleton for axis-aligned (or orthogonal) polytopes is the medial axis in the L ∞ -metric, and has a quadratic behavior in size as well; the computation time increases by a polylogarithmic factor [12,25]. In these particular settings, the straight skeleton is a unique structure. No algorithmic results or nontrivial upper size bounds have been known for (more) general polytopes. However, a superquadratic lower bound of (n 2 α 2 (n)) on the skeleton size exists [12].
We give an O(n d ) upper bound on the combinatorial complexity of straight skeletons for arbitrary boundary-connected polytopes in d-space, including their positively weighted versions. This improves the trivial bound by an order of magnitude. The argument is based on a unique layer partition for straight skeletons and related cell complexes, introduced in Sect. 7, which may be of interest on its own.

Polytope
Here we define the type of polytope we would like to work with, and give some related definitions and explanations.
A convex polytope is the finite intersection of closed halfspaces of Euclidean threespace R 3 , with nonempty interior. A polytope is a bounded subset of R 3 which can be expressed as the finite union of convex polytopes. This definition is quite general. A polytope can have tunnels, voids, or even be disconnected. The boundary of a polytope has a facial structure and consists of vertices (points of intersection of three linearly independent supporting planes), edges (minimal closed 2 subsets of intersection lines bounded by two vertices), and facets (minimal closed subsets of supporting planes bounded by edges). Note that polytope facets are connected, but are not required to be simply connected. Moreover, there might exist so-called touching faces, for example, a vertex or an edge touching the interior of a non-incident facet. That is, the boundary complex of a polytope needs not be face-to-face. Polytopes with boundary singularities of various kinds arise naturally during the shrinking process, even for the simple setting where the input polytope is homeomorphic to a ball and all its facets are triangles.
A polytope, Q, can have various types of vertices. It will turn out useful to draw the following general distinction: A vertex v of Q is called a touching vertex if there exists some ε > 0 such that each sphere, centered at v and having a positive radius v w u Fig. 2 A polytope Q with complex topology. Q contains a tunnel, a void, and three mutually touching faces-a facet, an edge, and the vertex v. The bottommost facet is not simply connected. Q is a connected polytope, but is neither interior-connected nor boundary-connected. The closed complement Q of Q (in a suitable bounding volume) is a valid polytope as well. When Q is shrunk, i.e., when Q is expanded, a complicated combinatorial change on the boundary takes place at vertex v of at most ε, intersects the boundary of Q in a disconnected set. (In the polytope in Fig. 2, the vertex v is of the touching type, but the vertices u and w are not.) A vertex is called non-touching, otherwise. Among the latter vertices, certain types are particularly relevant. A vertex v is pointed if there exists an open (geometric) disk whose intersection with Q is exactly v. A saddle vertex is incident to edges that positively span 3-space. 3 These two types are exclusive, but not exhaustive among the non-touching vertices. If not already present in Q's boundary, touching vertices and saddle vertices will be created generically in the polytope offsetting process, including such having coplanar facets, or some facet with a reflex angle.
An edge e of a polytope Q is called convex, reflex, or flat respectively, if the dihedral interior angle spanned by e's incident facets is smaller, larger, or equal to π . If e is part of a boundary singularity of Q, then the definition is meant locally for each respective part of Q. For instance, the edge uv in Fig. 2 is flat in the left part of the polytope, and convex in the right part. A non-touching vertex v of Q is called convex if all edges incident to v are convex. Likewise, v is called reflex if all its edges are reflex. Note that convex vertices are pointed, but reflex vertices are neither pointed nor saddle vertices. A saddle vertex necessarily has edges of both convexity types. The degree of a vertex v of Q is the number of edges of Q that are incident to v. Vertex degrees have to be at least 3, because vertices come from intersecting three or more planes.
We impose no general position assumption on a polytope, nor is this needed for our structural and algorithmic results. For the ease of exposition, a generic behavior of the facet offset planes will be assumed at certain places, though only temporarily.

Valid Offset Surfaces
In this section, we give a characterizing definition of mitered offset surfaces and a proof of their existence, along with a discussion of some of their relevant properties.

Characterization
Let Q be a polytope as defined in Sect. 2. Consider some vertex, v, of Q with degree m. We have m ≥ 3, but the degree of v can be arbitrarily large, m ≤ n −1, where n counts the number of facets of Q. To ease the subsequent description we assume, here and in Sect. 3.2, that v is a non-touching vertex; we will come back to the general situation (which is similar) in Sect. 4.2.
Let f 1 , . . . , f m be the facets of Q incident to v. Each such facet f i defines a supporting plane H i , and we denote with H i the parallel offset of H i by some fixed value > 0, inward with respect to Q. Note that we may have H i = H j for i = j, when two facets f i and f j are coplanar. Our interest is in the arrangement defined by the offset planes H 1 , . . . , H m , that is, in the dissection of R 3 induced by these planes. This structure has to comprise all possible offset surfaces that may result (locally) from resolving the vertex v. We denote this arrangement by A(v); its combinatorial properties do not depend on , provided this offset parameter is positive. Now center a sphere, U , at the vertex v, sufficiently small to intersect only faces incident to v. The intersection of U with the polytope Q is a spherical polygon, S, which is simply connected because v is a non-touching vertex. Note that S is not necessarily contained in a hemisphere of U (for example, when v is a saddle vertex). In the following definition, the planes H i serve as functions over the spherical domain S. More precisely, H i (x) measures the distance from v to H i in the direction x ∈ S. Definition 3.1 A valid offset surface for v is (the graph of) a radial function over S that satisfies the following three conditions.
(1) For every x ∈ S we have (x) = H i (x) for some index i.
(2) (x) = ∞ holds for all x on the boundary of S. (3) is continuous.
A valid offset surface for v thus is a radially visible 4 polyhedral terrain over S, expressible as the union of certain facets from the arrangement A(v), by conditions (1) and (3), and locally fitting with its unbounded facets to the offset polytope surface by condition (2). In particular, has no self-intersections because is a radial function. Observe that in the limit → 0 supports the facets of Q incident to v, because then all planes H i concur at v. These properties are sufficient to have an offset polytope, Q , of Q defined after splitting the vertex v according to . They are also necessary, which is evident except for radial visibility that we give a closer look now. (The existence of Q is guaranteed by Theorem 3.3 in the next subsection.)

Lemma 3.2 Let be the union of all facets of Q that have changed combinatorially, as a result of resolving the vertex v of Q. If
is not radially visible from v, then Q contains some facet offsetting toward the exterior of Q . The converse of the statement holds, too.
Proof Let r be an infinite ray originating at v and with r ∩ = ∅. The ray r can intersect only transversely, because the offset planes H i avoid v. Let p 1 be the first point of intersection, at facet f 1 , say. (Without loss of generality, r does not intersect any edge of . We can alter r infinitesimally, otherwise.) For increasing , the planes H i move away from v, such that the facet f 1 offsets toward the interior of Q . Now, if is not radially visible with respect to v, then (and only then) a second point, p 2 , of intersection of r with exists such that the line segment p 1 p 2 lies inside Q . But the facet touched by p 1 p 2 at p 2 will offset toward the exterior of Q . The lemma follows.
Facets that shift in the 'wrong' direction contradict the polytope shrinking process, in the sense that a sequence of polytopes Q , obtained when increasing the offset parameter , is not ordered by containment. In particular, there will exist points inside Q which are swept over by the offsetting polytope boundary more than once. This fact is intolerable for the construction of a 3D straight skeleton, if the skeleton cells are supposed to partition the polytope Q.
There exist surfaces for v which are not radially visible but do not self-intersect; see Fig. 4(middle). This shows that ruling out self-intersections is a condition too weak for our purposes. On the other hand, Definition 3.1 offers maximal generality. It conforms with the classical mitered offsetting process for polygons in the literature, but enables additional offset combinatorics in certain situations. The interested reader may consult Sect. 8.1 at this point, for a brief discussion of the planar case.

Existence and Basic Properties
The question of the existence of valid offset surfaces arises. An affirmative answer follows from the results in [9,10] described in Sect. 4.2. We find it instructive to give an alternative (and dimension-independent) proof, which is directly based on the offset plane arrangement A(v).

Theorem 3.3 A valid offset surface as in Definition 3.1 always exists. Moreover,
can be chosen such that all its facets are unbounded.
Proof Let K be the set of all unbounded cells of A(v) whose radial projection to the sphere U lies in the function domain S. We claim that the boundary surface, F(K), that results from the union of these cells constitutes a valid offset surface. Clearly, F(K) is continuous and it satisfies condition (2). It remains to show that F(K) is radially visible from v. Assume that some ray r emanating from v intersects the boundary of a (convex) cell C in K a second time. Then C has to be adjacent there to another cell in K; otherwise, by the continuity of F(K), some offset plane H i contributing to F(K) would split C into a bounded and an unbounded part-a contradiction. To get rid of the bounded facets of F(K) (if any), we now include into K, one by one, cells adjacent to such facets. (These cells are all bounded; see Fig. 4 for an example of the cell adding process.) This process terminates, because the added cells will enlarge the unbounded facets of F(K) to such an extent that no bounded facets remain: For each unbounded facet of F(K), f i , which is extendable in this way, eventually some cells will be added that contain a facet from the same supporting plane H i . Upon termination, F(K) is a valid surface, as unbounded facets always offset in the 'right' direction and thus do not violate radial visibility by Lemma 3.2. Theorem 3.3 can be generalized to touching vertices (see Sect. 4.2) and is of fundamental importance for our considerations. The existence of a mitered offset boundary-and with it, the existence of a 3D straight skeleton-for general nonconvex polytopes in R 3 hinge upon its validity.
Valid offset surfaces are not unique in general; see [18]. The smallest possible example of ambiguity is for a saddle vertex of degree 4 whose edges alternate between being convex and reflex [9], as in Fig. 12. We use a bigger example to illustrate how valid offset surfaces are obtained from the offset plane arrangement. Consider the degree-7 vertex in Fig. 3(left). The displayed set of arrangement cells (right) is the smallest set that yields a valid offset surface. All facets of this surface are, by accident, unbounded. Still, we can add bounded cells while keeping the surface radially visible, for instance, the cell C shown in Fig. 4(left). This creates a surface vertex, u, of degree 6. Adding the cell D instead of C leads to a temporary violation of radial visibility (middle). We have the peculiar situation that one offset plane (marked with H ) supports the surface with both sides now, such that one of the two facets defined by H (the hidden triangular facet of D) would shift toward the exterior of the polytope; cf. Lemma 3.2. This can be remedied by adding the cell C next (right). In the resulting valid surface, all facets are unbounded again. No more cells can be added in this example without destroying radial visibility beyond repair.
In conclusion, three valid solutions exist. In one of them, the vertex v gets resolved into 8 surface vertices, rather than only 5 as in the other two cases. (Such vertices are marked with '•' in the figures.) Moreover, a degree-6 vertex u occurs there.
These phenomena may be unwanted in applications. Higher-degree surface vertices complicate the resolution problem for future vertices that arise in the offsetting process for the polytope Q, in a structural respect and also algorithmically when the resulting combinatorial changes (later called events) have to be implemented. Generally, offset surfaces of small combinatorial complexity seem desirable, also in view of a 3D straight skeleton construction for Q. Bounded surface facets (we term them orphan facets) trace out extraneous skeleton cells, such that the volume swept over by an individual offset plane is not interior-connected any more; see Sect. 5. For this reason, we may require that each offset plane defines a single (and then unbounded) facet in the surface, as it is the case when a convex vertex v of Q is resolved: The unique surface then is the radial lower envelope 5 of the offset planes, and v splits into vertices of degree 3 in the generic case, i.e., when no 4 offset planes pass through the same point. Indeed, we can have similar positive features for arbitrary polytope vertices v. (The case of touching vertices is covered in Corollary 4.4, see Sect. 4.2.)

Corollary 3.4
Let v be a non-touching vertex of the polytope Q, and let m be the degree of v. There exists a valid (orphan-free) offset surface for v whose edge graph is a forest with at most m − 2 inner vertices. In the generic case, all these vertices have degree 3.
Proof By Theorem 3.3, there exists a valid offset surface for v such that all facets of are unbounded. The edge graph of then has no cycles, and is a tree or a forest if certain edges flatten out due to coplanarity of v's polytope facets. To see that exclusively contains vertices of degree 3 in the generic case, we observe that surface vertices of degree ≥4 then are necessarily incident to some orphan facet: Let w have degree ≥4. Then w is incident to at least 4 facets and, because exactly 3 planes in A(v) pass through w, at least 2 facets for w stem from the same plane, say H i . But H i cannot define 2 unbounded surface facets incident to w (by Definition 3.1 (2); points x with (x) = −∞ would exist, otherwise), so at least one of them is an orphan facet. The number of vertices of is at most m − 2, the maximal number of inner nodes in a tree with m leaves. Let us observe that the lower (or upper) envelope of two valid offset surfaces for v is a valid offset surface as well. This directly follows from Definition 3.1. In other words, the set X of valid offset surfaces for v is closed under taking envelopes. This implies two partial orders on the elements in X , and the existence of two unique extreme surfaces − , + ∈ X . Extreme surfaces are not necessarily orphan-free, as Fig. 8(middle) indicates: The maximum set of cells has been added to obtain + .
The shrinking process for the polytope Q refers to the inner offset of its boundary. In fact, the quest for an outer offset for Q, which may be relevant in certain practical applications (and where we have < 0 for the offset planes H i ) leads to an equivalent problem: It can be viewed as an inner offset problem, when Q is replaced by the polytope Q that results from taking the (closed) complement of Q in a suitable enclosing box. As a consequence, all our results are applicable to outer offsets as well.

Reduction to Two Dimensions
For algorithmic purposes, it is of advantage to reduce the vertex resolution problem to one dimension less. We will distinguish two cases, depending on the type of the polytope vertex considered. More specifically, we discuss a two-dimensional reduction for pointed polytope vertices first, and then proceed to a generalization for arbitrary vertices, including the touching vertex type.

Pointed Case Revisited
Let us consider any pointed vertex v of the polytope Q. Recall from Sect. 2 that v needs not be a convex vertex, that is, v can have reflex incident edges. However, there exists a plane E that intersects all edges of Q incident to v. Moreover, as v is a non-touching vertex by assumption, E intersects Q (locally at v) in a simple polygon, which will be denoted by P in the sequel. If v is of degree m then P has m edges, e 1 , . . . , e m .
When the offset parameter increases in the shrinking process for Q, the polygon P shrinks to the inside as well. More precisely, its edges e i ⊂ E ∩ H i move in a selfparallel manner and at individual speeds w i = 1 sin α i > 0, where α i is the dihedral angle formed by E and the facet(s) of Q corresponding to the offset plane H i . This planar offsetting process traces out the so-called weighted straight skeleton [7,13,21] of P with respect to the edge weights w i . Note that the particular position of the sectional plane E influences both P and its weights w i , . . . , w m , in a way such that the resulting skeleton, SK(v), remains combinatorially unaffected: A polygon vertex u shared by edges e i and e j moves in an angle bisector plane, B i j , of H i and H j (which is independent of and E). Therefore, u traces out a skeleton arc along the line B i j ∩ E. In fact, the skeletons obtained for different choices of E are radial projections of each other (with respect to the polytope vertex v, where all such bisector planes B i j pass through).
Barequet et al. [12] proposed the interesting idea of using the incidence relations of the weighted straight skeleton SK(v) to resolve the vertex v. We will elaborate on the properties of this skeleton in some more detail here.
Weighted straight skeletons are not unique when degenerate conditions arise. Edge events that involve parallel polygon edges can cause ambiguity; see e.g. [13]. (For unweighted polygons, both edge events and split events always yield a unique offset boundary, at least in the classical setting. 6 ) However, edge weights are not independent in our case, which leads to the special property below that we will prove first. Let us call a polygon vertex convex, reflex, or flat, respectively, if its incident interior angle is smaller, larger, or equal to π . We observe that a vertex of our sectional polygon P is convex (respectively, reflex) if and only if its defining edge in the polytope Q is convex (respectively, reflex). In other words, the convexity status of a vertex of P, or of any of its offset polygons, is not influenced by the particular position of the sectional plane E. Then some polygon edge e has to shrink to length zero, and the offsets e 1 and e 2 of two other edges e 1 and e 2 get in touch at u, forming an interior angle of at least π . Let us assume first that, before the event, e 1 and the offset e of e define a convex interior angle (as drawn in the figure). We fix the sectional plane E orthogonal the line segment uv, and such that uv is of unit length. Then the supporting line i of edge e i is at distance cot α i from u. Note that we have α 1 , α 2 < π 2 . As e i shifts with speed 1 sin α i , the line i reaches u at time cos α i . But we have α 1 = α 2 in our case, by the existence of e before the event. We conclude that 1 and 2 cannot reach u at the same time, which is necessary for the occurrence of u as an offset vertex. A similar argument for the nonexistence of u applies when the offsets e 1 and e form a reflex interior angle (this case is not shown in the figure). It remains to recall that the vertex structure of SK(v) is the same for all choices of the plane E.
Note that when a (convex) vertex u is created in an edge event, then α 1 = α 2 holds for the position of E chosen above; see Fig. 5(middle). To be precise, in the degenerate case where two or more edges vanish at the same time in the event, rather than a single edge e, the vertex u may even be flat in order to have α 1 = α 2 ; see Fig. 5(right). But then we must have 1 = 2 , instead of mere parallelism of these supporting lines, such that e 1 and e 2 merge into a single edge, and u actually is not created as a polygon vertex. (Observe that u leaves no further trace, but still represents a node of SK(v).) As a consequence, Lemma 4.1 still holds. In particular, the afore-mentioned ambiguous case for parallel edges is excluded (where we have 1 = 2 , hence α 1 = α 2 ). The vertex u is not generated in the left and the right case, respectively. In the case shown in the middle, the skeleton faces sharing the arc a continue in a monotone way In summary, there is a unique way to proceed in the construction of SK(v) after each event. That is, we have a similar behavior as in the unweighted case [4].
The inner arcs of SK(v) form a tree such that exactly one face g i for each edge e i of P is present, unless the degenerate case above occurs and certain vertices in the offset polygon 'flatten out'. SK(v) then is a forest where some collinear edges of P border the same skeleton face. Interestingly, the faces of SK(v) have the following connectivity behavior, which we explain below: They are monotone polygons, in particular, the intersection of a face g i with any line normal to the defining edge e i is connected. This property is well known for the unweighted straight skeleton [4], but does not hold for weighted straight skeletons in general, unless the underlying polygon is convex; see e.g. [7,13]. To see the monotonicity property, we observe that non-monotonicity always arises in the neighborhood of skeleton nodes created by so-called sticking events; see e.g. [31]. These are edge events where an arc incident to a reflex polygon vertex is involved. However, when a node u of SK(v) is generated in a sticking event, then we must have the situation in Fig. 5(middle), by Lemma 4.1. The skeleton construction then continues with an arc a starting from u, in a way such that the two faces which share a are monotone in the required directions.
By Lemma 4.2, the improvements in [15,16] of the subquadratic-time algorithm in [21] for constructing straight skeletons are applicable to SK(v); they are based on monotone faces. As a consequence, SK(v) can be computed in (roughly) O(m 4 3 ) time, when m is the degree of v. The next assertion, which has been stated informally in [12], shows the relevance of SK(v) for resolving the pointed vertex v.

Lemma 4.3 There is a valid offset surface for v that radially projects to SK(v).
Proof Clearly, the domain for such a surface has to be the spherical polygon S obtained by radially projecting the polygon P onto a sphere U centered at v. (S is contained in an open hemisphere of U now, namely, in the radial projection of the sectional plane E.) Consider an arbitrary point x ∈ S, and denote with x its radial projection to P. We define the surface by putting (x) = H i (x) if and only if x lies in the unique (closed) face g i of SK(v) that is bordered by the edge e i of P. It remains to prove that satisfies the conditions in Definition 3.1. Obviously, is radially visible from v and fulfills (1) and (2) by construction. To see that is also continuous, (3), consider any inner arc a of SK(v), and let g i and g j be the two skeleton faces incident to a. Arc a is contained in an angle bisector plane B i j of the offset planes H i and H j , and B i j passes through the vertex v. This implies that arc a radially projects to the line H i ∩ H j . (Note that these two planes cannot be identical, by the existence of a.) We conclude that for each x ∈ S with x ∈ a, we must have H i (x) = H j (x), that is, the facets of fit continuously. Lemma 4.3 implies Corollary 3.4 in Sect. 3.2, for the special case of pointed polytope vertices v. In particular, each polytope facet f i incident to v gives rise to a single and unbounded facet f i in the surface above. In the degree-7 vertex example discussed in Sect. 3.2, the orphan-free surface in Fig. 3(right) is the one of all solutions that corresponds to SK(v).
We remark that Lemma 4.3-in conjunction with Lemma 4.2-puts some restriction on valid offset surfaces. This is demonstrated in Fig. 6. If the degree-5 vertex v (left) could be resolved in two different ways, then the two surfaces (middle, left/right) were obtained. The former surface cannot come from SK(v), because the face f is not monotone there. So it must be the latter one, which (unlike the former surface) does not result from a self-parallel polygon offsetting process, not even for arbitrary edge weights. We conclude that there is a unique solution, which is the one shown in Fig. 6(right).
There is another and more well-known projection surface for weighted straight skeletons of a polygon P, called the skeleton roof ; see e.g. [7,21]. This surface does not stem from any offset planes, but rather from the planes L i that result from lifting each point x ∈ P vertically, by 1 w i times the (signed) distance of x to the supporting line i of an edge e i of P.
The skeleton roof corresponding to SK(v), and the offset surface for v in Lemma 4.3, have the same convex/reflex structure of their edges: The convexity status of a surface edge is uniquely determined by the interior angle formed by the respective two edges of P. Figure 7 offers an illustration. Note that Lemma 4.1 implies that all valleys of this roof (i.e., reflex edges) have to start at the boundary of P, a property that in the unweighted case is characterizing for the skeleton roof, among all possible roofs for P; see [4]. As a consequence, a similar restriction for reflex edges can be used to distinguish the offset surface from all other possible solutions. We will see in Sect. 7 that a generalization of this property to one dimension higher (Lemma 7.4) leads to an alternative characterization of 3D straight skeletons, equivalent to their procedural definition in Sect. 5. We observe finally that when the edge weights cot α i (instead of 1 sin α i ) are used for the sectional polygon P, then the resulting skeleton roof degenerates to a pyramid with apex v and base P; compare the proof of Lemma 4.1. This is the object we obtain when we cut off the vertex v from Q with the plane E, because the planes L i defining the roof are now the facet planes of v.

Bisector Graphs
In this subsection, we discuss a two-dimensional reduction of the vertex resolution problem for arbitrary polytope vertices.
Non-pointed polytope vertices are more complicated to deal with. For example, if a vertex v of the polytope Q is a saddle vertex, then a single sectional plane (like in the preceding subsection) does not suffice to intersect all the edges incident to v. Using two sectional planes leads to one or more unbounded polygons of intersection with Q in either plane. If the degree of v is high, these polygons can be arbitrarily complex, having a large number of convex and reflex vertices. Though the weighted straight skeleton inside each such polygon can be defined and computed much like in the (bounded) case before, we now face the task of combining several skeletons that stem from two different planes. This inherits the problem of merging straight skeletons, which is unsolved so far. In fact, a solution would imply a novel divide & conquer method for computing straight skeletons.
This situation can be circumvented when a sectional sphere U as in Sect. 3 is used for a two-dimensional reduction. In the sequel, let v be an arbitrary vertex of the polytope Q. We first consider the spherical polygon S = U ∩ Q, which may have a more general shape now: The boundary of S stays connected as long as v is nontouching (for instance, a saddle vertex), but it necessarily disconnects if v is a touching vertex, and S needs not be simply connected any more, and even can disconnect itself.
Still, a valid offset surface for v always exists. In fact, Definition 3.1 and Theorem 3.3 from Sect. 3 generalize directly to more general domains S. The only difference introduced by a touching vertex v concerns the facet planes for v. In addition to the facets of Q that have v as a vertex, there exist facets f i of Q now which are only g g' x Fig. 8 Bisector graphs with a tree structure (left), or containing cycles which correspond to orphan facets (middle, dark gray). Embedding a different tree leads to crossing arcs (right) touched by v, and whose offset planes H i have to be taken into account for the arrangement A(v) as well. Note that v may touch a facet f i singularly, or an edge or a facet where v is a vertex may touch f i . In any case, the offset plane arrangement A(v) is well defined, such that all the results from Sect. 3 can be extended. Let now be a valid offset surface for v. We observe that can contain holes and can be disconnected, if the same happens for the spherical polygon S. Our interest is in the incidence structure of the edges of , which is encoded in the set of nondifferentiability of the radial function over S whose image is . This set defines a geometric graph in the interior of S, which we term the bisector graph, G v ( ), for v and . Trivially, the arcs of G v ( ) pairwise do not cross, but rather partition S into maximal subdomains (called regions) where the function (x) is differentiable. In geometric terms, the regions of G v ( ) are the radial projections of the facets of .
The arcs of G v ( ) are subsets of great circles b i j of the form b i j = B i j ∩ U , where B i j is the angle bisector plane through v of the offset planes H i and H j . Notice that the arcs of S are not considered to be part of G v ( ). The nodes of S are therefore of degree 1 in G v ( ), and will be called its leaves. The inner nodes of G v ( ) are of degree 3 or higher, where a higher degree can occur for two reasons: the presence of orphan facets in as in Fig. 4(left), or because the offset arrangement A(v) is not generic. Figure 8(left/middle) displays the bisector graphs for two valid offset surfaces of a vertex v with degree 10. The domain S is a pentagonal star, sufficiently small to be almost flat. Examples like this can be duplicated and combined, to show that the number of possible valid offset surfaces is as large as 2 (m) in the worst case, when v is of sufficiently high degree m. This is already true for surfaces having the forest structure as in Corollary 3.4, that is, for bisector graphs without orphan regions: In Fig. 8, the regions g and g are already different. In such an example of exponential behavior, v can either be a touching vertex, being the common apex of (m) pyramids with pentagonal stars as bases, or a pointed vertex when the stars are joined into a connected spherical polygon. If orphan regions are allowed, then there exist examples (based on Fig. 27) where v splits into (m 2 ) surface vertices. The graph in Fig. 8 (right) contains crossing arcs, and therefore is not a bisector graph. Various (spherical) illustrations of bisector graphs are given in Sect. 6, along with the events they represent in the construction of 3D straight skeletons. Our next aim is an extension of Corollary 3.4 that includes the touching vertex type. To this end, we call a bisector graph G v ( ) outerplanar (with respect to the spherical polygon S for v) if all regions of G v ( ) are adjacent to the boundary of S. Observe that G v ( ) is outerplanar if and only if contains no orphan facets. The graph then captures the features of an offset surface which are desirable for the reasons mentioned in Sect. 3.2. Revisiting the proof of Corollary 3.4, we see that the surface considered there already yields a bisector graph G v ( ) with the required properties. Denote with c ≥ 0 the number of elementary cycles in G v ( ).

Corollary 4.4
Let v be an arbitrary vertex of the polytope Q, and let m be the number of facets that contain v. There exist (orphan-free) valid offset surfaces for v such that G v ( ) is an outerplanar graph with at most m + 2(c − 1) inner nodes. In the generic case, all these nodes have degree 3.
Cycles in outerplanar bisector graphs stem from the shape of the domain S and from the sphere topology. Such graphs may also be disconnected, even within a single connected component of S. In the illustrations given in Sect. 6, G v ( ) is always outerplanar.
To obtain a canonical bisector graph for a polytope vertex v, the minimum surface − or the maximum surface + (defined at the end of Sect. 3.2) can be utilized, or their orphan-free variants when outerplanarity is required. Another unique bisector graph for v, which is always outerplanar, is the so-called spherical skeleton, G * v , of S on the sectional sphere U , introduced in [9]. This skeleton is defined by a carefully tuned shrinking process for S, based on the moving offset planes H i . The task of constructing G * v is somewhat involved, concerning the arising events which are more numerous than in the case of planar straight skeletons. We decided not to include the details here, and refer the interested reader to [9] for a description of this material instead. The spherical skeleton G * v can be computed in O(m 2 log m) time, where m is the number of facets of Q that contain v.
Observe that the existence of G * v implies a general proof of existence for valid offset surfaces. In fact, G * v is a generalization to the sphere of the weighted straight skeleton SK(v) in Sect. 4.1. This shows In contrast to SK(v), the use of a sectional sphere, rather than a sectional plane, obviates the need for weighting the arcs of the obtained spherical polygon.
To select more than one bisector graph for v, the offset arrangement A(v) can be used directly. A(v) contains (m 3 ) cells, which can be computed in optimal (m 3 ) time [20]. This is also the worst-case time complexity for extracting the first outerplanar bisector graph with the cell adding technique in Theorem 3.3: It is not hard to find an example where a cubic number of cells have to be added. On the other hand, A(v) implicitly encodes all possible solutions (which can be exponentially many even when only outerplanar graphs are sought), thus providing all possible choices of how to proceed in the offsetting process.
A computationally simpler and still flexible approach, and the one we have implemented for the 3D straight skeleton construction, is the following. By Corollary 4.4, we can enumerate all combinatorially different outerplanar graphs which are relevant, and check whether they are bisector graphs for the polytope vertex v under consideration. Being easy to implement, this method is plausible when the degree m is a constant, independent of the number n of facets of the input polytope. Indeed, most solids can be approximated accurately by (boundary-meshed) polytopes with vertices of small constant degree. Also, in the generic case, the shrinking process can only create offset polytope vertices of degree ≤8, as it will turn out in Sect. 6.
The graph enumeration is facilitated by the following observations. Let S 1 , . . . , S t be the connected components of the spherical polygon S for the vertex v to be resolved. We can treat each component S k separately, and moreover, adapt to the properties of S k . If the boundary of S k is connected then Corollary 3.4 applies, and attention can be restricted to graphs that are forests. The same can be done if v is a non-touching vertex, where we also have only one connected component. Let now m k be the number of arcs of S k , and consider the system (b i j ), 1 ≤ i < j ≤ m k , of great circles, obtained by intersecting the sphere U with the angle bisector planes B i j associated with S k . The next lemma provides a criterion for recognizing whether a given candidate graph is a bisector graph. (1) and (2) then a valid offset surface with facets from the offset planes H 1 , . . . , H m k can be constructed, similar as in the proof of Lemma 4.3. Conversely, any bisector graph has to fulfill (1), because the vertices of a surface are of degree at least 3. Assume now that G does not embed inside S k without arc crossings, and refer to Fig. 8(right). We claim that the offset planes above now give a surface for G that is not radially visible from v, implying that G cannot be a bisector graph: Let two arcs in the embedding of G cross at the point x ∈ S k . Then the ray from v and through a suitable point in the neighborhood of x intersects two surface facets (rather than only one) in their interiors.

Lemma 4.5 Let G be an outerplanar graph for S k . Then G is a bisector graph for S k and v if and only if (1) all inner nodes of G have degree ≥ 3, and (2) the arcs and nodes of G can be embedded on the respective components of the circle arrangement
Condition (2) in Lemma 4.5 can be tested in O(m k log m k ) time, for example, by using a generalized plane sweep algorithm for line segment intersection; see e.g. [17]. As a useful byproduct, the geometric embedding of G provides us with extra information, such that only connected graphs with inner nodes of degree exactly 3 need to be generated: Arcs of G missing in the corresponding bisector graph, and thus causing its disconnectedness, reveal themselves by the identity of the respective offset planes. (Sometimes two arcs of G which are incident to such a 'flat' arc have to be concatenated into a single arc of the bisector graph; this is reflected by their containment in the same great circle b i j .) Moreover, nodes of degree ≥4 in the bisector graph are witnessed by arcs of G of length zero. These observations make the enumeration particularly easy when G is a forest, where it suffices to generate all labeled and unrooted binary trees with m k leaves [26].
In summary, a universal engine for vertex resolution is obtained, which works for arbitrary polytope vertices and in all degenerate cases. This 'vertex splitter' is useful not only for initially splitting the higher-degree vertices of the input polytope Q, but also for handling all the events that arise later during the offsetting process for Q. Even any multiple event can be processed, i.e., a combination of events of possibly different types, which take place at the same point in space, and which can be arbitrarily complex. (For example, when we shrink the complement of the polytope shown in Sect. 2, the vertex v gives rise to a multiple event. See also Fig. 27 in Sect. 8.) In fact, the type of an event needs not be known in advance in order to process it correctly. Still, we will give a complete categorization of (non-initial) events in Sect. 6, under the assumption that the offset planes behave generically.

Straight Skeletons in Three-Space
After having settled some basic questions about mitered offset surfaces for general nonconvex polytopes, we can now return to the main concern of this paper: the construction of 3D straight skeletons for such input polytopes. We will maintain full generality in this section, to point out the general validity of the results. In Sect. 6, we will have to introduce a generic condition, to be able to categorize the skeleton construction events in a transparent way.

Construction Process
Like in two-dimensions, the skeleton construction complies with the shrinking process for the given polytope Q, and is driven by so-called events. These are combinatorial changes in the boundary structure of the offset polytope Q . Events take place only if there is a change in the number of offset planes H i that intersect in the same vertex of Q . This number is at least three; the results in Sect. 3 ensure that only valid polytopes as defined in Sect. 2 are generated. When an event happens at vertex v, then four or more offset planes participate, which when shifted further, constitute the respective offset arrangement A(v).
Initially, for infinitesimally small , various events will have happened simultaneously in general, which split higher-degree vertices of Q into vertices of smaller degree. (We will call such events the initial events, to distinguish them from the noninitial events that occur later in the offsetting process for Q.) Then, when increases, between any two consecutive events the boundary of Q keeps its incidence structure while offsetting. Each facet, edge, and vertex of Q traces out a certain part of a cell, or sheet, or spoke, respectively, as we shall name these skeleton components. The edges of Q move in angle bisector planes, and the vertices of Q move along trisector lines, which are the common intersections of three bisector planes. This implies that a piecewise-linear structure is being constructed.
Every event is associated with a vertex v of Q where the number of offset planes that contain v undergoes a change. The vertex v becomes part of the skeleton in the event, being an endpoint of certain skeleton spokes. We will call such endpoints the corners of the skeleton. Note that events may happen simultaneously also for a fixed value > 0, such that k ≥ 2 different vertices v 1 , . . . , v k of Q are involved at the same time in different events. Now, the way how each such vertex v i gets resolved fixes the combinatorics and the geometry of the boundary of Q , for infinitesimally increased . This, in turn, uniquely determines how the skeleton construction for the polytope Q will proceed for larger , till the next event is encountered.
By the results in Sects. 3 and 4, the resolution of a vertex v i is always possible via its offset arrangement A(v i ), but this may be an ambiguous process. This concerns the initial events, but also the non-initial ones, especially when a non-generic or multiple event occurs. (Recall that a multiple event refers to a single vertex, unlike simultaneous events.) Still, Definition 3.1 guarantees that any possible (infinite) sequence of offset polytopes Q , for growing from 0 to ∞, is totally ordered by inclusion. Moreover, the boundary of Q changes continuously with , such that each point x ∈ Q is swept over by the shrinking polytope boundary exactly once. This implies that the offsetting process cannot 'cycle' or lead to overlapping skeleton parts, and that Q (which before might have disconnected into other components having vanished already) eventually has to collapse to volume zero, in a final event. In summary, a piecewise-linear cell complex inside Q is constructed; see Figs. 10 and 29 for illustrations. We are now ready to state a main theorem of this paper.

Theorem 5.1
Let Q be a polytope in R 3 as defined in Sect. 2. Any of the (at least one) mitered offsetting processes for Q as in Definition 3.1 terminates with the construction of a piecewise-linear decomposition of Q.

Facial Structure, Topology, and Size
In the decomposition a straight skeleton defines for a polytope Q, the cells are nonconvex sets in general. Studying their structure is therefore a nontrivial task.
We start by arguing that skeleton cells are always bordered by some polytope facet. The skeleton cell of a facet f i of Q is defined as the total volume swept over by the boundary part of Q that comes from the offset plane H i for f i . This volume is a connected set, and the reason is that H i contributes to the boundary of Q in a continuous way: By definition of the vertex resolution process, H +ε i can yield a facet in Q +ε only if H −ε i did so in Q −ε , for infinitesimal ε with > ε > 0. In particular, once having stopped contributing to the polytope boundary, an offset plane cannot reappear, because it does not participate in any future vertex resolutions.
Observe that different (but then coplanar) facets of Q can border the same cell, if they define the same offset plane. Similarly, a single offset facet can lose simple connectedness or split into orphan pieces, as in Figs. 4 and 8. The produced skeleton cell, C, then can split into several interior-connected orphan cells, though C still stays connected through the vertices that have been resolved. (Fig. 27 offers an illustration for the planar case.) Such probably undesirable artifacts can be avoided, when abiding by the orphan-free offset surfaces in Corollary 4.4. Unavoidable is the occurrence of tunnels in skeleton cells and of holes in skeleton sheets, e.g., when Q has facets with holes. Simple examples exist in this case; see Fig. 29.
In any case, the cells share another property which is helpful when using 3D straight skeletons as a partitioning structure: Each cell C is monotone, in the sense that the intersection of C with any line normal to its defining facet(s) of Q is connected or empty. This follows from Lemma 7.2 in Sect. 7, which covers a more general class of The two possible (generic) incidence structures at a straight skeleton corner v cell complexes for Q introduced there. The monotonicity implies the absence of voids in skeleton cells, even when the polytope Q itself is not void-free. We now take a closer look at the facial structure present in a straight skeleton for Q. The main fact determining the incidence structure is that, in the offset polytope Q , all vertices are of degree at least 3 for any value of . This implies that each spoke has 3 incident sheets and cells, respectively, or more in non-generic cases (which we do not discuss in detail here), but not possibly only 2.
Consult Fig. 9. Let be the trisector line that supports a spoke s, and consider an endpoint v of s which is an inner corner of the skeleton (that is, v is not a vertex of Q). Another trisector line = has to pass through v. The six involved bisector planes, one triple for and one for , now can be pairwise different or not. In the former case (left), v is incident to 6 sheets, 4 spokes that span 3-space, and 4 cells, like in a convex cell complex.
In the latter case (right), one plane in the triple for identifies with a plane in the triple for . (No other pair can identify, by = ). This plane, call it B, contains the lines and , each of which defines two collinear spokes of v. These 4 spokes can span only 2 diametral sheets contained in B, but they span 4 other sheets that stem from the two bisector planes different from B in each triple. The latter sheets therefore have v as a 'flat' corner. Again, 4 cells meet at v, but there are two cells, say C 1 and C 2 , each of which is supported by both sides of the plane B, having a double-adjacency there. Note that the resulting cell complex is still face-to-face, because v is a corner in all participating faces. Therefore, this geometric anomaly implies no inconsistency with the local incidence structure given in a convex face-to-face cell complex. The events shown in Figs. 12, 13, and 21 lead to such an interesting constellation, in a generic way. In conclusion, from an implementation point of view, any of the various available data structures for storing convex cell complexes can be used for 3D straight skeletons.
Geometrically, when a skeleton cell is considered as a separate polytope, it can have several kinds of vertices, including the reflex and the saddle type. Touching vertices occur as well, namely, as corners that concatenate orphan parts of the same skeleton cell. However, in the geometric degeneracy described above, the vertex v is not a touching vertex for the cells C 1 and C 2 .
Returning to topological issues, let us study the spoke graph of a 3D skeleton next, i.e., the graph formed by its spokes and corners. Whereas skeleton cells are always connected, this is not true for the spoke graph. Two examples can be found in Sect. 6.1. They reflect that vertices of Q which disappear in the interior of a polytope facet or edge (in the events E 6 and E 5 ) are responsible, as they leave no further trace. Such situations arise naturally, in contrast to the 2D case: The planar straight skeleton cannot disconnect, unless geometric degeneracies are present in the input polygon; see Proof Suppose the contrary, and let I be some isolated component of the spoke graph that is not connected to the boundary of Q. Then there exists some closed surface which separates I from Q's boundary, but does not intersect any spoke or sheet in the straight skeleton for Q. Hence there must be a cell with a void which entirely surrounds I , and the cells therein (whose existence is witnessed by the spokes in I ) are not bordered by the boundary of Q. These are contradictions to two of the properties of a skeleton cell, mentioned at the beginning of this subsection.
By Lemma 5.2, graph connectedness is regained when the spoke graph is joined with the graph formed by the edges of Q, provided the latter graph is connected. (This can always be achieved when Q has no voids, by triangulating the boundary of the input polytope Q after the skeleton construction). We point out that this connectivity property is not shared by the trisector arcs of the medial axis of Q, which has a more complex topology; see e.g. [29]. This complicates the application of tracing algorithms for computing 3D medial axes. We will address such algorithms in Sect. 7.
Naturally, the combinatorial complexity of a 3D skeleton is an interesting quantity. It is defined as the total number of cells, sheets, spokes, and corners of the skeleton. Let the polytope Q have n facets. The number of cells is at most n, as each facet borders a unique connected cell. However, a cell can consist of various orphan cells connected via corners. The number of corners is trivially bounded from above by n 4 , because 4 offset planes have to concur in the event that constructs a particular corner, and this can happen only once for each quadruple of planes. This implies a bound of O(n 4 ) on the size of any straight skeleton; the numbers of corners, spokes, and sheets, respectively, are linearly related. (See also the result in Sect. 7.3.) Let now B i j be the bisector plane of the offset planes H i and H j . A single trisector line i jk = B i j ∩ B jk can contribute at most n − 2 spokes to the skeleton, because i jk contains at most one corner for each index different from i, j, k. By a similar index count, a single bisector plane B i j contributes at most 1 2 (n 2 − 3n + 4) sheets-the maximum number of planar faces in an arrangement of n − 2 lines. These bounds are tight in order, as the example in Fig. 10 shows. This implies that a single cell can have a combinatorial complexity of (n 2 ), even without decomposing into orphan cells. Figure 10 also reflects that the number of facets of the offset polytope Q can increase quadratically. However, the overall size of a straight skeleton has a cubic upper bound, at least in the customary and probably most useful setting, by the following theorem which we will prove in Sect. 7.2. Clearly, the result also holds when Q consists of several connected components. Notice that Q may contain tunnels, but voids are disallowed. No assumptions of nondegeneracy are required. Previously only the trivial upper bound O(n 4 ) has been known. We stress that the currently best result for the medial axis [28] is O(n 3+ε ). Still, Theorem 5.3 leaves ample room for improvement, when compared to the lower bound of (n 2 α 2 (n)) in [12]. This kindles the hope for a smaller worst-case size of straight skeletons.
Various different straight skeletons for a polytope Q can exist-at least exponentially many by the results in Sect. 4.2, even for the setting in Theorem 5.3. On the other hand, there are canonical straight skeletons for Q, for example, the one obtained by resolving each vertex with the spherical skeleton [9]. The variety of possible solutions gives freedom for adapting to practical applications; we will come back to this issue in Sect. 10.

Event Classification
The information about all possible mitered offsets and straight skeletons of a polytope is comprised in the structure of the individual events. It is therefore of interest to provide a description and categorization of these events, which is the purpose of this section. Though rich in detail and space consuming, this task leads to several insights into the geometry and combinatorics of the offsetting process, and its occasional peculiarities. Also, the presented material will be helpful when an implementation different from ours is intended. (Our algorithm is based on the largely event-independent vertex splitter in Sect. 4.2.) We supplement our study with numerous illustrations.
A problem inherent to the given input conditions is that the initial events can be arbitrarily complex. We therefore make no attempt to classify these events here, although this is possible at least in an overall way following the material to come, for example by referring to the vertex types.
By contrast, the non-initial events have a controllable structure for every input polytope Q, if we limit attention to orphan-free offset surfaces. We adopt this restriction (which is commonly assumed implicitly in the literature) for the rest of this section. The anatomy of the events then can be simplified, when the polytope offset planes show a non-degenerate behavior in the following sense: Definition 6.1 A polytope Q fulfills the generic condition if there is no value > 0 such that 5 among its offset planes H 1 , . . . , H n pass through the same point. Identical offset planes (for coplanar facets of Q) are counted as a single plane.
We shall see in Sect. 6.3 that coplanar facets, if not already present in Q, arise naturally in the offset polytope Q . Definition 6.1 implies, by the geometry of planes in space, that each fixed quadruple of offset planes can share a point only for a single value of . Lemma 3.5 guarantees now that only offset surfaces with vertices of degree 3 are created in an event. In fact, Q is a simple polytope for all but finitely many values of . Moreover, the degree of a vertex v to be resolved in a non-initial event is trivially limited to 4 2 · 2 = 12. Actually the maximum degree is 8, by Lemma 6.4, such that the arising (degree-3) bisector graphs have at most 8 leaves, and can be singled out quickly by graph enumeration. Being especially important, the offset arrangement A(v) contains exactly 4 planes. Note that this also excludes any multiple non-initial event. The generic condition can be enforced for any polytope Q, by infinitesimally altering the offset speeds.
Concerning 3D straight skeletons, the condition guarantees that exactly 4 j skeleton faces of dimension j are incident to each inner corner, for 1 ≤ j ≤ 3. This means that a vertex v of Q , for > 0, can resolve into at most 4 vertices: Each of them will trace out one skeleton spoke starting at the corner v, and the number of spokes incident to a corner is 4 1 = 4. Corners which are vertices of the input polytope Q can have a larger or a smaller number of incident spokes, sheets, and cells.
There are several meaningful ways to give a taxonomy of events: By the effect they cause on the polytope, by the types of polytope faces that are interacting, or by the 'localness' of the events. We decided to use the last approach, as it preserves some of the features of the two-dimensional case, and also reflects the way how we implemented the detection (though not the handling) of events.

Edge (Vanish) Events
When constructing a straight skeleton in the plane, one of the two possible (generic) events is the edge event [4]. A polygon edge shrinks to length zero, and its two neighboring edges become adjacent. Occasionally, three edges vanish at the same time, when a triangular component of the offset polygon collapses to a point.
A generalization to three dimensions entails several events of this kind. One up to six edges of the offset polytope Q can vanish now at the same time, because all six edges of a tetrahedron supported by four offset planes can be present on the boundary of Q . We will adopt the term edge (vanish) events. Such events are totally local and can be detected by the fact that some edge of Q attains length zero. The We start with the simplest edge event, which we denote with E 1a and display in Fig. 11. (The number in the event index indicates how many edges are vanishing.) A single edge e disappears (left) and is replaced by the edge e which borders facets from two different offset planes (middle). In the moment when e 'flips' to e, a convex vertex v of Q with degree 4 is created (right). The bisector graph that resolves v into two vertices of degree 3 is a unique binary tree. Concerning the 3D skeleton construction, two spokes and a sheet are completed 7 at corner v, and the construction of two spokes spanning a new sheet in a different bisector plane starts at v. Also, four already partially constructed sheets get extended further.
The situation stays similar when the generated degree-4 vertex v is pointed but nonconvex, or is a reflex vertex. However, there are events where exactly one edge vanishes but with different characteristics, for instance when a saddle vertex is generated. Such edge events correspond to the sticking event in the polygon case [31], and can arise in two different forms.
See is the only ambiguous event among the non-initial events (in the generic and orphanfree case). The bisector graph G v ( 2 ) for the latter surface 2 is shown (right). The bisector graph G v ( 1 ) for the former surface 1 , which is also a tree, is obtained by prolonging the arcs a and b so as to cut off the arcs c and d. Equivalently, in the three-dimensional setting, 2 is obtained from 1 by adding the (single) tetrahedral cell of the offset arrangement; cf. Sect. 3.2. It is interesting to note that the spherical skeleton (see Sect. 4.2) produces the surface 2 , the one having more convex edges. The actions for the 3D skeleton dictated by event E 1b are not unique, of course. After the completion of a sheet at v, the construction may continue either with a new sheet in a different, or in the same bisector plane. In the former instance, the skeleton continues like for a convex vertex v. In the latter instance, the constellation of the involved sheets and cells deserves particular attention. The completed sheet and the starting sheet are coplanar and touch at v after the event. The four extending sheets also have v as a corner, but v sits between two collinear spokes on their common boundary, being a 'flat' corner there. This is exactly the situation depicted in Fig. 9(right) in Sect. 5.2: Two of the skeleton cells incident to v 'wrap around' this corner, such that each of them is supported by both sides of a single bisector plane. These cells are therefore adjacent in two sheets. Observe that the offset polytope retains the incidence structure of its boundary in this event instance. Figure 13 illustrates the second possibility of creating a saddle vertex v, which is the event E 1c . The difference to the event E 1b is that v is incident to a facet containing a reflex interior angle at v (right). In the shown polytope, the edge e of the kiteshaped facet vanishes (left), and the edge e appears in the mirrored image of this facet (middle). Again we have the peculiar fact that the edges e and e are parallel. They do not flip, because they separate the same two facet offsets (shown shaded). Therefore the polytope retains its boundary incidence structure in the event, though there is a switch in the orientation of the edges e and e. The bisector graph is a unique binary tree, that is, this event is unique. The effect of the event on the 3D skeleton is the same as in the instance with the double-adjacency above: The completed sheet and the starting sheet are coplanar, as they stem from the edges e and e. This leads to the described geometric degeneracy in the cell structure.
We now turn to the description of edge events where more than one edge vanishes. Let us treat the case of (exactly) 3 edges next. The respective event, denoted by E 3 , v a Fig. 14 Five polytope edges vanish in the edge event E 5 is easy to imagine without a picture. A boundary triangle of Q shrinks to a degree-3 vertex v, which henceforth stays a vertex of the offset polytope for a while. The bisector graph is a 3-star. Three sheets, three spokes, and also one cell of the skeleton get completed at corner v, and three already partially constructed sheets get adjacent at a new spoke. This spoke has v as a starting point.
Going up by one dimension, 6 edges vanish in the event E 6 (the maximum possible) when an entire tetrahedron on the boundary of Q collapses to a point v. Such a tetrahedron can sit on top of some facet f of Q , or constitute an isolated part such that a connected component of Q disappears. The final event in the shrinking process is of the latter form. Notice that a hole of f may collapse in the former case. In both cases, four spokes and six sheets get completed at v, that is, all that can be incident to a corner in the generic case. Three cells are completed in the former case, and four in the latter. After that, v disappears as a vertex of Q (but not as a skeleton corner, of course). The skeleton does not continue with any new sheets or spokes at v, though with the extension of the cell swept out by f in the former case. As a remarkable fact, the skeleton spoke graph disconnects then, at least locally: In the neighborhood of v, the current part of the spoke graph loses contact to the shrinking boundary of the offset polytope. Note further that the bisector graph is empty in both cases, because the spherical polygon is either void or a hemisphere.
In a similar event, E 5 , exactly 5 edges may vanish when the collapsing tetrahedron has two vertices which are the endpoints of two collinear edges of a facet of Q , as in Fig. 14(left). These collinear edges merge into a single edge (middle), at the point v the tetrahedron shrinks into. The spherical polygon is a 2-gon in this event, formed by two semicircular arcs. The bisector graph consists of a single arc a (right). Four spokes, five sheets, and two skeleton cells get completed at v, which then disappears from Q . In particular, no new spokes start at v, that is, the spoke graph construction does not continue there again (in spite of the fact that the bisector graph is connected now). The skeleton continues with the extension of the partial sheet that corresponds to the arc a, and the two incident cells.
The last three events are the generalizations of the triangle collapse event in the polygon case. Notably, in three dimensions some edges of Q can vanish also in events that topologically change the polytope or its non-vanishing facets. There are reasons for not including such events into the class of edge events, which will become apparent in Sects. 6.5 and 7.2. We give a brief listing of these events below, but postpone their detailed description to the subsections devoted to their classes. Detection still can be done directly, by the collapse of edges of Q . An example where one edge vanishes is the event in Fig. 20(right). No new edge is produced, but an existing edge splits instead, and with it the entire polytope. Events where two edges vanish are the one in Fig. 19, and the inverses of the events in Figs. 16, 17, and 18. (Inverse events are explained in the next subsection.) Facets of Q merge in these events, or holes (e)merge. There is also a case where three edges vanish, namely, the inverse of the piercing event in Sect. 6.4. A hole in a facet vanishes now, and the offset polytope may split. The event where exactly four edges vanish is the inverse of the kissing event in Sect. 6.4. As its specialities, the polytope may split and the spoke graph construction does not continue locally.
This completes the enumeration of edge events. In retrospect, these events can create all types of polytope vertices but the touching type, though only with degree at most 4. The offset polytope does not change its topology in edge events, nor does any of its facets, unless polytope pieces, facets, or holes in facets collapse entirely. The spoke graph of the skeleton locally disconnects when 5 and possibly when 6 edges vanish (in the events E 5 and E 6 , respectively). We have also encountered an ambiguous event, the saddle vertex example E 1b . Collinearities forced by saddle vertices have led to geometric degeneracies in the 3D straight skeleton (in E 1c and possibly in E 1b ).

Inversion and Ambiguity
Before proceeding with the description of event types, let us focus on the feature that each event can be associated with its inverse event. One way to interpret inverse events is by considering outer offsets, where the offset parameter decreases. For example, the inverse of the edge event in Fig. 11 transforms the polytope shown in the middle into the one on the left-hand side. The inner and the outer offset problem are equivalent, by the argument at the end of Sect. 3.2. This enables the following definition, which is also meant for the non-generic case and for non-orphan-free vertex resolution. For a vertex v of Q , let A (v) denote the combinatorially unique offset plane arrangement for < . (Note that is negative if Q = Q.) Definition 6.2 Let E be an event at the polytope vertex v with corresponding spherical polygon S. The inverse event E −1 of E is obtained by applying to v all possible bisector graphs for A (v) inside the spherical polygon U \ S.
The event E −1 gives all the valid outer offset surfaces for v, and thus all possible boundary structures of the polytope before the event E, that is, when Q is expanded infinitesimally. The identity (E −1 ) −1 = E is evident from the definition which is based on taking complements, and from the fact that A (v) is the reflection through v of the arrangement A(v) in Sect. 3.
The valid offset surfaces defined by A (v) and A(v), respectively, are combinatorially different in general. This is due to the difference of the underlying spherical polygons, which are complements but not reflections of each other. For example, the bisector graph for the event in Fig. 17 is connected, but disconnects for the inverse event into the bisector graph shown in Fig. 19. Nevertheless, inversion preserves a structural similarity that makes the ambiguity of events 'direction-insensitive', at least in the Fig. 15 The offset surfaces for the 1-edge-vanish event E 1a and its inverse (left), and for the 3-edgesvanish event E 3 and its inverse (right). The resolved vertex (filled circle) sees two tetrahedron facets for E 1a and E −1 1a , and one tetrahedron facet for E 3 and E −1 3 setting we agreed on at the beginning of Sect. 6. Let us call an event k-ary if exactly k valid and orphan-free inner offset surfaces exist for the respective polytope vertex v.

Lemma 6.3 Let E be a generic non-initial event.
Then E is at most 2-ary, and if E is unary (respectively, binary) then so is E −1 .
Proof The arrangement A(v) for E is defined by 4 planes, and therefore contains a single bounded cell T which is a tetrahedron. T may or may not participate in an inner offset surface for v. So there are at most two such surfaces, and at least one of them must be valid and orphan-free by Corollary 4.4. The arity of events now depends on how v 'sees' the (opaque) tetrahedron T . Clearly, if v lies inside T , then T cannot influence the offset surfaces at all, and E is unary. E −1 is unary as well, because v then also lies inside the reflected tetrahedron T in A (v). Refer to Fig. 15 now. If v sees a single facet of T , then T defines one or three orphan facets in the inner offset surface, and T leads to an outer offset surface which is not radially visible (or vice versa). So neither T nor T can be added to build a valid and orphan-free surface. Therefore both E and E −1 are unary. Observe next that v cannot see three facets of T , because all planes in A(v) are at the same distance from v. So let v see exactly two facets of T . If the presence (or the absence) of T defines two orphan facets in the inner surface or violates its radial visibility, then T acts the same in the outer surface. E and E −1 are unary in these cases. Otherwise, both T and T may be used or not, and E and E −1 are binary events.
We conjecture that the arities of E and E −1 are the same also in the non-generic case and for initial events. Note that unique events (i.e., events with only one valid inner offset surface altogether) are unary, but not conversely. For example, the inverse E −1 3 of the 3-edges-vanish-event E 3 is unary, but has a second valid instance where the triangle which collapsed in E 3 is restored as an orphan facet; see Fig. 15(right). This also shows that Lemma 6.3 cannot be extended to surfaces with orphan facets, even not when only surface vertices of degree 3 are admitted. Several unary events discussed in Sect. 6.3 also have a second inverse instance with orphan facets, though surface vertices of degree 4 or degree 6 arise there.
On the other hand, it will turn out that generic non-initial events always define unary inverse pairs (E, E −1 ), with one exception: One of the (already discussed) saddle vertex events, namely E 1b , and its inverse are binary. Consequently, four different pairs of inverse event instances exist. For two such pairs, the exchanged polytope edges are supported by offsets of the same line. The instances paired up there are self-inverse, because they preserve the boundary structure of Q . A similar situation arises in the unary saddle vertex event E 1c in Fig. 13.
Fixing a pair of inverse instances for resolving a vertex v uniquely determines the structure of the 3D straight skeleton, in the entire neighborhood of the skeleton corner v. A canonical way of defining such pairs is obtained, for example, by utilizing the spherical skeleton (Sect. 4.2) for vertex resolution. This may be particularly useful in the non-generic case, where most events have k-ary variants for k ≥ 2, but nevertheless a canonical straight skeleton will be constructed.
We remark that, although the inverse of an event always exists, the polytopes Q −t and Q +t can be combinatorially (but not geometrically) different in the limit t → 0. For example, when the event E 3 takes place and lets a triangular facet collapse, then Q −t in the limit still contains the isolated vertex v that results from the collapse, whereas v is not present in Q +t . Still, the inverse event E −1 3 is capable of restoring the vanished facet in one of its instances; see above. A similar situation arises when a tetrahedron shrinks to a vertex, in the events E 5 or E 6 .
This implies that for any given value > 0, the process which shrinks Q to Q can be reversed by the application of inverse events, provided the event history has been recorded. However, when only the information present in Q is used, one will in general not end up with the initial polytope Q when expanding Q again, even when all events so far have been unique: Some of the offset planes may have become redundant in the shrinking process, and then cannot be restored any more. Such a 'loss' of planes can only happen for edge events, and there only for E 3 , E 5 , and E 6 , where cells of the skeleton get completed. The inverse of a triangle collapse (where a new triangle is born), or of a tetrahedron collapse (where a new tetrahedron is born), thus do not occur in the shrinking process.
Observe finally that the inverse of each initial event for a polytope Q will occur as a non-inverted event, when the given input polytope has a void in the shape of Q. Such events can have an arity which is exponentially high in the degree m of a vertex v. For example, we can combine (m) small copies of the spherical 7-gon for the 'binary' vertex in Fig. 3, to construct a spherical polygon for v with m arcs. This puts an arity of 2 (m) on the event that resolves v.

Facet (Boundary) Events
So-called facet (boundary) events are characterized by the property that either the boundaries of two coplanar facets of Q get into contact, or the boundary of a facet of Q gets into self-contact. A facet splits, or pinches off a hole on its boundary, or two facets or holes merge. Facet events can be viewed as counterparts of the split event for planar straight skeletons [4], where the boundary of the input polygon self-contacts and the polygon splits apart.
Detection of events in this class can still be done locally, either directly by observing the collapse of edges in Q , or by looking at the self-contacting facet f of Q . The  Fig. 17 The vertex/edge contact F ii is similar to the facet event in Fig. 16 value of where the boundary of f (possibly) gets into self-contact can be calculated directly in O(k 2 ) time, when f has k edges. As an alternative, a weighted straight skeleton for f can be used. Negative edge weights [13] may occur now, however, because f can have edges that shift toward its exterior. A simple and usually fast implementation is by triangulating all the facets of Q beforehand, and detecting facet changes by the collapse of triangles [3]. This works in O(h) overall time for all facets per increase of , when Q has h facets and each of them is of constant size.
Facets events show the richest forms, and they can be systematized by the dimension of the facet boundary pieces that get into contact. Most similar to the planar case is the type vertex/edge contact, F i , which is illustrated in Fig. 16: A vertex of the shaded facet runs into an opposite edge. A degree-5 vertex v of Q is created by this contact, and the shaded facet disconnects at v. Observe that v is non-touching, but is neither a pointed vertex nor a saddle vertex. We may call v an almost pointed vertex, because its spherical polygon S is contained in a closed hemisphere of U , but not in any open one (as is required for being pointed); S is a pentagon where one arc is a semicircle. The bisector graph is a binary tree with 3 inner nodes, which reflects that v gets split into three degree-3 polytope vertices.
The same anatomy arises for a similar case of a vertex/edge contact, F ii , displayed in Fig. 17. In particular, the bisector graph has the same combinatorial tree structure in both cases, and is unique such that there exists only one valid offset surface. Any other surface built from the same planes necessarily contains facets offsetting toward the exterior of the polytope (cf. Lemma 3.2). Notice that-in contrast to before-the vertical facet f extends now locally at v after the event. In the 3D skeleton, a spoke v Fig. 18 The facet event F iii produces a tunnel in the vertex/edge contact f v Fig. 19 The facet event F iv gives rise to a vertex/vertex contact ends at the corner v and three spokes start there. Also, four sheets are extended, and two sheets are created.
There is another case of a vertex/edge contact, the facet event F iii where the offset polytope alters its topology. This is illustrated in Fig. 18. The shaded facet contains a hole (left), and its boundary gets in self-contact there, squeezing the hole into two (middle). A vertex v of degree 5 is created intermediately (right), which is of the touching type now: The boundary of the spherical polygon consists of two parts, a triangle and a 2-gon. On the other hand, the spherical polygon is still connected, and the bisector graph even has the same tree structure as in the events F i and F ii . This is interesting in view of the fact that a tunnel is created in the offset polytope by this event. The actions for the skeleton are the same as above.
Consider Fig. 19 next. The geometry of the shown polytope (which has similarities to the polytope for the event E 5 in Fig. 14) generically enforces a facet event, F iv , of the type vertex/vertex contact. The two short edges of the shaded facet simultaneously shrink to length zero (left). At the same moment, the object on top of the adjacent facet, f , shrinks so as to touch the boundary of f at a vertex v of Q , where two collinear edges merge now into one. The objects then drifts away on top of the generated hole of f (middle). The vertex v has degree 5 and is of the almost-pointed type. The spherical polygon is connected, but the bisector graph is disconnected, being a forest consisting of a 3-star and a single arc. This graph has only one inner node; accordingly, v is 'resolved' into only one vertex of the offset polytope. That is, v does not split at all, but rather loses two collinear edges. Actually, this event is the inverse of the facet event F ii in Fig. 17, but in the complementary setting (i.e., where the interior and exterior of the polytope are exchanged). Therefore, the respective reverse actions take place in the skeleton. Note at this point that the inverse of a facet event has to be a facet event again.
We also observe that the two contacting vertices have to move along the same offset line. Another case where this happens is depicted in Fig. 20. The characteristics of this event, F v , differ from the preceding one. Two vertices at the far side of the shaded facet meet (left), such that a hole pinches off from the boundary of this facet, and another one for the adjacent facet (middle). At the same moment, a touching vertex v of Q of degree 6 is generated. Vertex v resolves into only two offset vertices, because two collinear edges of the shaded facet merge into one. Thereby, a tunnel is generated in the offset polytope. The spherical polygon is connected but contains two holes (similar as in Fig. 18). The bisector graph disconnects, however, into a single arc and a binary tree with two inner nodes. In the skeleton, two spokes arrive at corner v, and two are created. Five sheets continue, and one sheet is born.
The last distinguishable case of a vertex/vertex contact is when a saddle vertex of Q is generated, in the facet event F vi . See Fig. 21. The shaded facet splits, and a hole is released from the boundary of an adjacent facet, with a small polytope on its top. The created saddle vertex v is of degree 6 with two collinear edges, and the spherical polygon is a hexagon. The bisector graph is a forest with two 3-stars, and v resolves accordingly into two vertices. Again, two skeleton spokes arrive at corner v, and two are born. However, six sheets arrive at v and all six extend. Interestingly, the v Fig. 22 The facet event F viii with a vertex/edge/edge contact degenerate incidence structure shown in Fig. 9(right) occurs again, because the two sheets that stem from the collinear edges of v are coplanar. Observe that the contacting vertices do not span a polytope edge, nor do the new offset vertices after v's resolution. Consequently, a double-adjacency of cells arises.
Finally, there also exist facet events of mixed type, and a vertex/vertex/edge contact may occur. This type, F vii , is shown in Fig. 20(right). One may be tempted to classify this event (and, similarly, also F iv ) as an edge event, as it causes some edge e to vanish. However, the shaded facet splits at the created vertex v of Q , and with it another facet, which settles the type of the event. Actually, this event represents the 'pure' generalization to three dimensions of the planar split event, because it splits the polytope at v, at least locally. Note that v is a touching vertex of degree 6, and resolves into only two vertices. The bisector graph and the spherical polygon disconnect as well (but not the spoke graph), into two 3-stars and two spherical triangles, respectively. This event is the inverse of the vertex/vertex contact event F v , in the complementary setting. In the skeleton, the respective reverse actions take place.
A facet event of the mixed type can also involve a vertex/edge/edge contact. Such an event, F viii , is depicted in Fig. 22. The shaded facet pinches off a hole as does its mirrored neighbor facet, when two of their common vertices meet at vertex v of Q (left). This creates an edge of Q by merging, but another edge arrives there at the same time and splits. Consequently, v is of degree 8 and has two pairs of collinear edges (right). The degree of the constructed skeleton corner v is still 4 (as in all other noninitial events), because v splits into only two vertices in the offset polytope (middle). These vertices belong to two objects sitting on the two holes born in the event. The spherical polygon is boundary-connected, but the bisector graph is a forest with three components, two 3-stars and an isolated arc. Once more, two skeleton spokes get completed and two created. Six already existing sheets concur at v and extend, like in the event F vi . But now v is of the almost-pointed type in Q , and its degree is the maximum that can be attained in the generic case: Lemma 6.4 For all > 0, the degree of the vertices of Q is limited to 8.

Proof
Let v be some vertex of Q for given > 0. The number of offset planes passing through v is at most 4, and each plane can contribute at most 2 facets of Q incident to v. But the number of facets and edges incident to v must be the same, because these faces correspond bijectively to the arcs and nodes of the spherical polygon for v. To convince ourselves that the enumeration of facet event types is complete, we observe that the vertex/vertex/edge/edge contact has already been covered by the event F viii . Moreover, the concurrence of three non-neighboring vertices of Q , or of three edges, respectively, is outruled by the generic condition in Definition 6.1: At least five offset planes would have to pass through a common point, as can be seen from the discussion of collision types in the next subsection.
In summary, all facet events are unary, as are their inverses by Lemma 6.3. Notice that the latter mostly stem from coplanar constellations (e.g., F −1 i , F −1 vi , and F −1 viii ) but are still generic. Some facet events cause a topological change of the offset polytope. However, facet events cannot disconnect the spoke graph: The singular vertex created on the facet boundary cannot disappear without giving rise to new offset vertices. Forced collinearities (in the event F vi ) may lead to a degenerate geometry of straight skeleton cells, as with edge events, but not to deficiencies in the spoke graph.

Global (Collision) Events
It remains now to consider the class of global (collision) events, where combinatorially unrelated faces of Q collide. By the global nature of such events, they can be recognized only by inspecting the entire polytope boundary, unless an auxiliary data structure is used. In an implementation, one might want to maintain a suitable volume partition of Q , for example a tetrahedrization based on Steiner points in the interior of Q ; see e.g. [14]. Events then can be identified by keeping track of tetrahedra collapses in the partition, similar as in one dimension lower for the facet events, whose detection is then automatically included.
By convention, we assign the inverse of a global event to the same class. All such events are unique, because the resolved vertex v always lies inside the tetrahedron T defined by the arrangement A(v); see the proof of Lemma 6.3. For the same reason, global events cause a topological change of Q , and the boundary of the spherical polygon is necessarily disconnected. As an interesting fact, the bisector graph has to contain cycles now. Again, the distinction of event types can be done by the dimension of the polytope faces that are interacting.
See Fig. 23 for the first type, the vertex/facet collision. The front vertex of a tetrahedral dent of the polytope approaches the shaded facet (left) and pierces a triangular hole into its interior (middle), which suggests the name piercing event, G p , for short. In between, a touching vertex v of Q is generated (right), which is incident to three facets, and touches the interior of one facet. The spherical polygon is connected but contains a hole. Its boundary consists of a spherical triangle and a great circle, the latter stemming from the touched facet. The bisector graph is a cycle of length 3, connected to its leaves in the spherical triangle. Conforming to this graph structure, the vertex v resolves into 3 vertices that span a hole of the pierced facet. This constructs a tunnel in the offset polytope. In the 3D skeleton, three sheets get v as a corner and extend, but their common spoke is completed there. Three spokes are born at v, along with three sheets spanned by them.
The inverse of the piercing event, G −1 p , lets 3 edges of the offset polytope vanish. However, a tunnel disappears or (in the complementary setting) the offset polytope splits locally-the reason why we classify G −1 p as a global event and not as an edge event. Still, G −1 p can be detected directly, like the inverse of the following event. The edge/edge collision or kissing event, G k , has a similar anatomy that is displayed in Fig. 24. The front edges of two reflex wedges of the polytope approach each other (left). In the moment they contact at a point in their interiors, a touching vertex v of Q of degree 4 is created, incident to two pairs of collinear edges (right). The vertex v then resolves into 4 vertices spanning a nonplanar quadrangle (middle), which opens a tunnel in the offset polytope. We recall from the beginning of Sect. 6 that 4 new offset vertices is the maximum that can be achieved under generic conditions. The bisector graph consists of a 4-cycle connected to the spherical polygon boundary, which disconnects into two semicircular 2-gons. The spherical polygon itself is connected. Interestingly, in the 3D skeleton, an isolated corner v with four incident spokes is generated. Four sheets are initiated too, and the two sheets traced out by the front edges of the colliding wedges are extended. This leads to a (temporarily) isolated part of the spoke graph. However, this part stays connected to the offset polytope boundary from the exterior, and will therefore connect to some other part of the spoke graph in later events.
The inverse of the kissing event, G −1 k , is the only event where exactly 4 edges of the offset polytope vanish. But the topological effect of this event is the same as for the inverse piercing event, which hinders its inclusion into the class of edge events.
Combinatorially, there are six possibilities to pair up polytope faces of dimensions 0 to 2. Let us go over them systematically now. Two possibilities are (partially) ruled out by our generic assumption: The type vertex/vertex collision leads to 6 or 5 offset planes passing through the same point, unless two pairs of identical planes are present. In that case, the event shapes into the facet event F v in Fig. 20(left). Similarly, a vertex/edge collision yields 5 concurring offset planes, unless an identical pair is involved. The resulting event is the facet event F iii in Fig. 18, but in the complementary setting. The vertex/facet collision is the piercing event G p .
By contrast, the type edge/edge collision is only partially covered by the kissing event, because the contacting edges may be collinear. One or two pairs of coinciding offset planes are involved then, but in the latter case the planes have differently-oriented normal vectors in each pair. Such a collinear contact of edges, and also the next type, the edge/facet collision, can be interpreted as limit cases of the type facet/facet collision, the last possible combination. This event necessarily requires two coinciding offset planes of different orientation.
These last three event types contain geometric degeneracies which are not excluded by the generic assumption. We observe that, in the moment of collision, more than one new vertex can be created in the polytope Q . Still, such an event is not a multiple event, as it does not take place at a single point in space. Rather, it can be seen and treated as a collection of simultaneous events: Each new vertex v of Q can be be resolved individually, and the results assembled into the surface of the offset polytope. The individual events are simple modifications of the piercing event and the kissing event, respectively, and therefore are unique. Consequently, the combined event is unique as well. We do not further elaborate on the details here.

Concluding Observations
The enumeration of the generic events is now complete. In spite of their sometimes quite complex anatomy, all events but one are unary. In the less obvious cases, this can be verified easily by using bisector graphs as a tool. Another general observation is that events do not change class when being inverted (which is partially due to the convention made for global events).
One can give a gross classification of events, based on whether or not the offset polytope Q or any of its non-vanishing facets experiences a boundary contact (or loses such a one). For edge events this does not happen, whereas all the facet events and global events involve an effect of that kind. This suggests to join the latter events into the overall class of contacting events, as opposed to the contact-free edge events. This distinction will turn out important in Sect. 7.2. We recall that contacting events can neither complete the construction of a cell in the straight skeleton, nor disconnect its spoke graph.
On the other hand, only the contacting events have the ability to alter the 3D topology of the polytope. Tunnels may be created or destroyed, either locally like in the facet event F iii in Fig. 18 and its inverse, respectively, or globally like in the piercing event G p and its inverse. Similarly, when the polytope splits, as for example in the event F vii in Fig. 20(right), then it does so either locally by destroying a tunnel, or globally by incrementing the number of its connected components. The latter change causes the polytope boundary to disconnect. As a remarkable fact-which is already reflected in our event enumeration-this is the only way a boundary disconnection can happen, also in the non-generic case: Lemma 6.5 Let Q be an arbitrary polytope. In a valid offsetting process (according to Definition 3.1) where Q shrinks to volume zero, no new voids can appear in any offset polytope.
Proof Assuming the contrary, let a corresponding event happen at the point v in the offset polytope Q , for some value . Denote with X the new void in the polytope Q +ε , for sufficiently small ε. If point v lies on the boundary of Q such that the void was released from there, then there exists a ray emanating from v which intersects the boundary of X at least twice. This contradicts the radial visibility of the created offset surface. Otherwise, the void did appear in the interior of Q . By the nature of the shrinking process, we must have v ∈ X , and the offset planes supporting the facets of X have collectively swept over X during the interval [ , + ε], starting from v. But prior to the resolution of v, these planes must have arrived at v. Therefore, they have swept over points in X already earlier, for offset values smaller than . This cannot happen in a valid offsetting process.
Notice that, nevertheless, an event capable of creating a void in the interior of Q exists, namely, the inverse E −1 6 of the 6-edges-vanish event E 6 where a tetrahedron collapses. By Lemma 6.5, the event E −1 6 does not occur in the shrinking process. (Compare, in this context, the observations at the end of Sect. 6.2.) An event where a void is released from the boundary of Q is generally missing, because it presumes an invalid shape of the offset surface.
This situation parallels the two-dimensional case. When the input polygon is shrunk, no holes can be generated, neither in its interior nor at its boundary. It is instructive to visualize that such planar hole generations do take place for the polytope facets-in the piercing event and, for example, in the facet events of type vertex/vertex contact, respectively. The intuitive explanation for the lack of the corresponding events in the input dimension 2 (for a polygon) and 3 (for a polytope) is that an additional dimension is needed to enable the generating boundary singularities.
The variety of the skeleton construction events and their properties is admittedly confusing, and an overview may be helpful. The following table summarizes the (generic and orphan-free) events that can take place in the shrinking process for a nonconvex polytope. We respect the order of classes and the notations established in the preceding subsections: edge events E x , facet events F x , and global events G x . For each event, the following information is displayed in the respective table row: The generating type of contact, if any (indicated as vertex/edge/facet); the degree and the type of the offset polytope vertex v created at this moment; the structure of the bisector graph (we denote with B k a binary tree with k leaves, and with C k a length-k cycle connected to k leaves); the connectivity behavior of the spherical polygon S (boundary-connected, boundary-disconnected, or disconnected); the number of spokes/sheets/cells completed and created in the straight skeleton being constructed (the number of extending skeleton faces is the rest to 4/6/4); the local behavior in the spoke graph construction (continuing, not continuing, or starting); the 3D topological changes in the offset polytope, if any; and finally the inverse event (here F denotes the event F in the complementary setting, ' ' indicates that the inverse event only relates to itself, and / ∈ means that the event exists but does not arise). The arity of events is not included; we refer to the beginning of this subsection. Global events of the collision types collinear-edge/edge, edge/facet, and facet/facet are not listed; these simultaneous events can have a more complex structure. Apart from that, the table represents a complete enumeration, as is also indicated by the regularities of vertex degrees (Column 4) and of bisector graph structures (Column 6).

Roof Complexes
Our main results on mitered offset surfaces and straight skeletons are based on arrangements of planes in 3-space, and therefore can be generalized naturally. We will address extensions in three different directions-which can be combined-in the present section and in Sects. 8 and 9, respectively. Arrangements will play a double role, for resolving vertices of a polytope Q on the one hand, and for defining piecewise-linear surfaces above Q, on the other.
It is well known that the straight skeleton of a polygon in the plane defines a roof surface in three dimensions [4,21]. We have mentioned this property already in Sect. 4.1 and illustrated it (for the weighted case) in Fig. 7. In short terms, the straight skeleton is the vertical projection of the roof surface. Similar is the situation in one dimension higher, which we will exploit now to define more general cell decompositions for polytopes.

Basic Properties
Let Q be our polytope in R 3 . Every straight skeleton, SK, of Q defines a fourdimensional surface as follows. Let C 1 , . . . , C n be the cells that constitute SK, and denote with H i the plane that supports the cell C i at a facet of Q. We identify R 3 with the hyperplane W 0 : t = 0 of R 4 , where t stands for the 4th coordinate. Now consider the hyperplanes with δ(x, H i ) measuring the normal distance of a point x ∈ W 0 to H i (signed to be positive on the side of H i that contains C i ). Viewing L i as a linear function on W 0 , the skeleton roof for SK is defined as the piecewise-linear and continuous function ϕ : We can also define more general roofs for Q, by relaxing the condition that binds roofs to straight skeletons. Definition 7.1 Let ψ : Q → R by a continuous function with ψ(x) = 0 for all x on Q's boundary, and ψ(x) = L i (x) for at least one index i. We call the graph of ψ a roof for the polytope Q, and the subset of Q where ψ is non-differentiable a roof complex for Q.
Roof complexes are cell complexes inside Q, coming from vertically projecting onto W 0 the faces of the piecewise-linear surface in R 4 defined by a roof. Among such decompositions of Q, there have to be all its straight skeletons. But also different cell complexes are contained in this class, as is indicated (in one dimension lower) by Figs. 4 and 8. However, the local incidence structure in a roof complex has to be the same as in a straight skeleton, as both structures are defined by the same type of piecewise-linear functions.
Note the similarity between roof surfaces and offset surfaces in Definition 3.1. In fact, offset surfaces can be seen as the roofs defined by a radial function ψ U on a sphere U in R 3 . Roof complexes on U then have bisector graphs as their spoke graphs, and among them the spherical skeleton [9] takes the role of the skeleton roof complex. This reflects the dimension-recursive structure of straight skeletons, which we will make use of in Sects. 7.3 and 9.
One difference to straight skeletons is that a roof complex can contain additional cells, namely, more than one connected cell for a given facet f i of Q. In particular, if there exist orphan cells for f i , then they are not necessarily concatenated by corners of the complex like in a straight skeleton; see Sect. 5.2. Only one of these cells is bordered by f i . Nevertheless, the cells have a useful property even for roof complexes which are not orphan-free.

Lemma 7.2 The union of cells in a roof complex for Q, defined by a fixed facet f i of Q, is a point set which is monotone with respect to f i .
Proof Let X be the point set in question, and let ψ be the function that induces the roof complex for Q. We generalize the proof in [3] to one more dimension. Take some line in the hyperplane W 0 and normal to the supporting plane H i ⊃ f i , and consider the restriction ψ| of ψ to . We have ψ| (x) = L i (x) if x ∈ X , and ψ| (x) = L j (x) < L i (x) for some index j = i if x ∈ Q \ X , the inequality coming from the fact that is normal to the plane H i but not to the plane H j . As a consequence, if X is not monotone such that can be chosen to intersect X in a disconnected set, then the function ψ| is discontinuous. But this is a contradiction, because ψ| is the restriction of the continuous function ψ.
By the monotonicity property expressed in Lemma 7.2, no voids can exist in the cells of a roof complex, even if Q itself has voids. This has the nice effect that the proof of Lemma 5.2 in Sect. 5 generalizes, which is somewhat unexpected as roof complexes are a much more general concept of cell complexes.

Lemma 7.3 The spoke graph of any roof complex for Q does not contain parts which are isolated from Q's boundary, and therefore has O(n) connected components.
Although not every roof corresponds to a straight skeleton, any fixed roof R for Q encodes a unique shrinking process for Q. This has been discussed for the twodimensional case in [4]. Let W stand for the horizontal hyperplane t = of R 4 , for ≥ 0. (W represents the 'water level' in the two-dimensional island model.) Consider the intersection W ∩ R. This intersection bounds a polytope Q , which shrinks for increasing . As all roof hyperplanes have the same slope, the edges and vertices of Q move in angle bisector planes, and along trisector lines, respectively. Clearly, this offsetting process traces out the roof complex for Q that corresponds to R. Notice that the process respects Definition 3.1, because a valid cell complex u v Fig. 25 Roof-based shrinking process for a polygon. Interesting events arise at vertices u and v (without overlapping parts) is constructed. If R is a skeleton roof, then a particular straight skeleton construction process for Q results, as in Sect. 5. Figure 25 offers an illustration in one dimension less. We observe that events are enabled now which do not occur in any straight skeleton construction process: At the vertex u of R the inverse edge event E −1 3 takes place (in three dimensions), such that a triangular facet of Q is initiated. Moreover, when R contains a local minimum (not shown in the figure) then the inverse edge event E −1 6 occurs, and a void in Q is generated.
Note that a tetrahedron collapse E 6 will take place at each local maximum of R. (In particular, the polytope Q vanishes in such an event when achieves a global maximum.) There also are 'switching-type' events, which are not roof-specific but come from non-orphan-free vertex resolution, like the point-symmetric exchange of facets at the roof vertex v above.
The event E −1 3 initiates the construction of a cell in the roof complex D for R, which is an orphan cell unless it merges later with a partially constructed cell bordered by Q's boundary. Likewise, E −1 6 and also E −1 5 initiate (up to four) cells in D which are possibly orphan cells. Conversely, when these three inverse events are never induced when W is raised, then all cells of D stay connected to the boundary of Q (but get possibly squeezed into orphan parts by switching events). More importantly, the corresponding shrinking process then always can be realized by resolving the vertices of Q , without explicit reference to R. This leads to the following alternative characterization of straight skeletons in R 3 .

Lemma 7.4 Let R be a roof for Q, and let D be its roof complex. D is a straight skeleton for Q if and only if the inverse edge events E −1
3 , E −1 5 , and E −1 6 do not arise in the shrinking process defined by R.
Being orphan-free is not a sufficient condition for a roof complex to be a straight skeleton, as we recall from Fig. 4(right).

Layers in Roofs and Skeletons
For certain roof complexes, a canonical partition of the corners into so-called layers can be specified. This structural property, which we will describe now, leads to the first non-trivial upper bound on the size of straight skeletons in R 3 , and also is of separate interest. For simplicity, we restrict attention to straight skeletons constructed by orphan-free vertex resolution. The results in this subsection can be extended to the class of orphan-free roof complexes.
Consider a polytope Q with connected boundary, and let SK be a straight skeleton for Q as above. We may assume that the cells of SK are topological balls: Cells are interior-connected by the orphan-free construction of SK, and cells do not contain voids because of their monotonicity (Lemma 7.2). Moreover, tunnels in cells can be avoided by augmenting the polytope with flat edges, such that holes in facets connect to the outer facet boundary. Such edges give rise to additional sheets in SK, but this does not alter the remaining parts of the cell complex geometrically, except that flat corners and spokes are introduced. The combinatorial complexities of SK and of the unrefined complex are of the same order.
There exists an enumeration method for the sheets in SK, by a greedy process. As all cells in SK are homeomorphic to balls, we have a topological structure like for convex cells (apart from multiple adjacencies). Also, all cells are bordered by Q's boundary, which is connected by assumption. Therefore, the inner corners of SK can be added one by one, in a way such that each corner completes one or more sheets in SK adjacent to already completed ones. In particular, there exist triangular sheets incident to the boundary of Q, to get the enumeration started. By Lemma 7.3, all corners of SK can be accessed, and hence all sheets completed, in this process.
Each corner of SK corresponds to the event that constructs it. At this point, we recall the notion of contacting events from Sect. 6.5. Global events and facet events are contacting, and all edge events are contact-free. (In a more general roof shrinking process, the events E −1 3 , E −1 5 , E −1 6 , and the switching-type events are also contact-free, but they do not occur in the construction of SK; see Lemma 7.4.) The above distinction of events into two classes induces a coloring on the inner corners of SK. We color a corner v blue if its event is contact-free, and red, otherwise. The -value where the event happens is called the time stamp of v.
The greedy process above can be guided by corner colors. In a first round, we complete a maximal set of sheets by blue corners. We start with the triangular sheets, and collect all accessed blue corners in a set 1 . In a second round, we complete a set of sheets by red corners, but only while the largest time stamp in 1 is not exceeded. We collect these red corners in a set 2 . This process is repeated by switching colors until it terminates. We claim that a unique partition of the inner corners of SK into subsets 1 , . . . , k is produced, which will be called the layers of SK.
The following interpretation of layers implies the correctness of the claim. 1 is a maximal set of edge events which can be carried out correctly without using any information about contacting events. 2 is a neighbored set of contacting events which have been ignored meanwhile. Because we could not further enlarge 1 with blue corners, 1 contains corners which are local maxima in the roof for SK, and the contacting events in 2 split Q (at least locally) if we execute the events in 1 ∪ 2 in shrinking order, i.e., for ascending time stamps. This explains why we can continue with the next blue layer after collecting 2 , as triangular sheets with blue corners are enabled again in the complex SK ∩ Q unless Q vanishes entirely.
We obtain a linear extension of the partial order in each layer i when sorting i by time stamps. Concatenation of the sorted subsets now gives a unique total order of the inner corners of SK, which we term the greedy order for SK. This order will construct SK sheet by sheet, but differently from the shrinking order, in general. Visualizing the situation for straight skeletons in two dimensions (Fig. 26, left), we see edge events correspond to blue corners, and split events to red corners. All red corners are connected to the polygon boundary [4]. However, they cannot be collected in a single layer, in general, and there can be linearly many layers.
Our next aim is to realize the greedy order of events in a different geometric way, with the intention of analyzing their overall number. To this end, in the layer partition for SK, we reverse the sorted order in each red layer. We then scan through this modified greedy order v 1 , v 2 , . . . , v t of corners, and maintain a surface ( ) in R 3 in the way described below (and illustrated in Fig. 26 for the planar case).
Initially, ( 0 ) is the boundary surface of Q. For a currently processed blue corner v j with time stamp j , we construct ( j ) by offsetting ( j−1 ) with the amount j − j−1 > 0, and performing the edge event for v j , which becomes a vertex of the surface. Self-intersections resulting from missed contacting events are ignored. That is, the parts of ( j−1 ) inverted by self-intersections extend by sliding along trisector lines, without combinatorial changes that come from contacts. ( j ) has planar facets, because the offset vertices for a fixed facet of Q stay in the same offset plane. Therefore, the original edge event at v j can be carried out correctly on ( j ).
In conclusion, ( ) is a connected, but in general self-intersecting, piecewise-linear surface during the first blue layer (and each later layer).
For each corner v j in the subsequent red layer, a self-intersection of ( j−1 ) gets untangled at v j when the surface is offset, because j − j−1 is now negative. The point v j becomes a vertex of ( j ), and a wrongly oriented triangle or tetrahedron on the surface disappears there. (Figure 15 shows two among several possible cases; an edge (left) or a triangle (right) of ( j−1 ) vanishes, respectively.) As before, shrinking parts-which are now inverted-and extending parts undergo edge events, without interference from contacts, and ( ) stays connected and piecewise linear.
The philosophy behind this construction is that, because events are processed in independent portions, they can be performed consistently on ( ) in the modified greedy order. Thereby, all events for Q are eventually transformed into contactfree events for ( ). The polytope Q has to be boundary-connected, so that the surface ( ) can capture the mutual boundary influence in Q .
Note that ( ) cannot have more edges and facets than Q. No edge or facet of ( ) ever splits, because all performed events are contact-free, and resemble the assumed orphan-free vertex resolution for SK. In fact, the size of ( ) decreases monotonically: Whenever a new surface edge is created, at least one edge vanishes in the same event. Concerning the size and number of layers, the following holds. Proof SK consists of interior-connected cells, by its orphan-free construction. We now recall that each blue layer includes corners that correspond to local maxima in the skeleton roof for SK. Therefore, at least one cell of SK gets fully completed, if the events in this layer were performed in shrinking order. In the last blue layer, at least 4 cells get completed when the offset polytope vanishes entirely. The number of cells of SK is at most n, and we obtain k ≤ 2(n − 3).
For the cardinalities of layers we give the following arguments. While staying within a fixed layer , we offset ( ) in a fixed direction. Assume first that is a blue layer. For each corner v in , an edge event takes place, and at least one edge e on ( ) vanishes in this event. Consider the bisector plane B i j that contains the edge e. We study the interplay on B i j while increases. Let e ⊂ = H i ∩ H j , and let H k and H m be the two offset planes that define the endpoints of e. The three lines and = H k ∩ B i j and = H m ∩ B i j arrive at v at the same time, causing e to vanish. Edge e may reappear immediately, for example when v is a saddle vertex, but this can happen only once. Otherwise, as no contacting events can hinder their influence, at least one of and will reach any further point x ∈ B i j earlier than . This implies that B i j contributes at most two edges to ( ) while is processed. Hence at most two corners in can be charged to B i j . From i < j ≤ n we conclude that the cardinality of a blue layer does not exceed 2 · n 2 . If is a red layer, then its number of corners is bounded from above by the size of the pattern of self-intersection on ( ). This size is O(n 2 ), because ( ) has only O(n) edges and facets. From Theorem 7.5 an upper bound of O(n 3 ) on the size of (orphan-free) straight skeletons can be inferred. We have stated this result in Theorem 5.3 in Sect. 5.
The number of layers depends on the shape of the polytope Q. Let us call Q nearconvex if it allows for some straight skeleton with a single (blue) layer. That is, no contacting events occur, hence the greedy order is identical to the shrinking order. For example, convex polytopes are near-convex. Also, the surface ( ) is intersectionfree once the last red layer has been processed, and ( ) then bounds a near-convex polytope; see Fig. 26 again. Recognizing and characterizing near-convex polytopes, or polygons, are interesting problems; an application is described in Sect. 10 For general roof complexes for Q, the layer partition needs not exist: The shrinking process can introduce voids in Q , and cells are not always bordered by Q's boundary. In case of its existence, the partition may consist of a super-linear number of layers, if the complex contains a large number of orphan cells. Likewise, when vertex resolution is not orphan-free in the straight skeleton construction, then cells get locally but not necessarily globally completed in blue layers. Examples of size (n 3 ) exist in these cases; see Sect. 8.

Computing Roof Complexes
From the algorithmic point of view, roof complexes provide an alternative way of computing monotone decompositions of a polytope Q, without resorting to straight skeleton algorithms.
The surface of a roof for Q consists of (the union of) faces from the arrangement, L(Q), of the n roof hyperplanes L 1 , . . . , L n in R 4 ; see Sect. 7.1. As a consequence, the combinatorial size of any roof complex is bounded from above by the combinatorial size of L(Q), which is (n 4 ).
To construct a roof for Q, one can compute the arrangement L(Q) in O(n 4 ) time in a preprocessing step [20], and then apply the cell adding technique from Sect. 3.2 directly (rather than using it in one dimension lower for vertex resolution). We start with the zone in L(Q) for the horizontal hyperplane W 0 , that is, the collection K of arrangement cells intersected by W 0 . Let K be the union of the cells in K. As long as K does not define a valid function on Q, we continue adding to K cells of L(Q) incident to (three-dimensional) facets which violate this property. This process terminates with a collection of cells whose boundary surface defines a roof for Q.
Depending on the kind of cell complex we are aiming at, we can continue the process. For simplicity, let us assume that L(Q) is generic. As long as roof vertices of degree larger that 4 exist, we can add respective cells, at the same time restoring with additional cells (if necessary) the property that K defines a function. This yields a roof complex D with inner corner degree 4.
Still, the complex D may contain orphan cells, which can be repaired by adding cells incident to roof facets which do not intersect W 0 . An orphan-free complex D * with at most n cells is obtained, where the requirement that K gives a valid roof is then automatically fulfilled. The cell complex D * is not unique, but rather depends on the order in which cells are added. To recognize whether D * is a straight skeleton for Q, we can inspect the inner corners of D * concerning the event they embody. By Lemma 7.4, the answer is affirmative if and only if the events E −1 3 , E −1 5 , and E −1 6 are not encountered. It remains unclear how to specify an order on the cells of L(Q) that produces a straight skeleton. Counterexamples exist, already in two dimensions [4], to the conjectures that the minimal or the maximal orphan-free roof (seen as functions on Q) yield a straight skeleton. The (overall) minimal roof R − , or maximal roof R + respectively, can contain orphan facets and thus seem less relevant in practical applications.
The following observations indicate that it may be hard to improve the upper size bound of O(n 4 ) for general roof complexes. By a result in [11], the combinatorial size of such a complex in R 1 (which is a partition of a line segment) can already be near-quadratic in n. Also, an attempt to apply the lower envelope bound for n linear partial functions in R 4 , which is O(n 3+ε ) [28], is doomed to fail when only Q is given, without additional knowledge about the roof complex. This is already true in two dimensions [4]. Finally, the large size of k-levels in hyperplane arrangements in R 4 is discouraging. (The k-level is composed of all arrangement faces which lie below exactly k − 1 hyperplanes, and the best known upper bound on its complexity is O(n 2 k 2−ε ); see [1].) On the other hand, a roof can never be a subset of any k-level for fixed k when Q is nonconvex: At each locally nonconvex part of Q, some of the hyperplanes L i will transversely cut the roof surface, and the intersected roof faces then belong to different levels. When Q is a convex polytope then the (n − 1)-level of L(Q), which is the lower envelope of L 1 , . . . , L n , constitutes the only existing roof.
The cell adding method is conceptually simple and flexible, and may construct polytope decompositions of small size in many cases. For example, the size of orphan-free 3D straight skeletons is bounded by O(n 3 ) (Theorem 5.3), and tends to be subquadratic in most examples (Sect. 10.1). This raises the question of whether a possible tracing algorithm, based on the enumeration method for sheets in Sect. 7.2, can avoid the (n 4 ) time (and space) barrier in Lemma 7.7, and achieve an output-sensitive runtime. The layer partition of corners for orphan-free roof complexes even shows that their computation can in principle be parallelized; each layer is structured only by a partial order, rather than by a total order. Unfortunately, it seems that finding the layer partition requires prior knowledge of the roof complex.

Weighted Setting
A concept already considered in [3,21] is to individually tune the speeds of the edges of a polygon in its shrinking process. Naturally, doing the same for the facets of a polytope raises our interest. In practical applications, such weighted mitered offset surfaces might be of particular interest, as they offer additional flexibility for adapting to given needs.

(Weighted) Polygons Revisited
As a warm-up, we reconsider the polygon case in the light of Definition 3.1. Let a polygon, P, be the two-dimensional equivalent of a polytope as defined in Sect. 2. P may contain holes, and also touching vertices which then belong to more than two edges. We equip each edge e i of P with an individual weight w i > 0, which represents its velocity in the shrinking process. Polygon vertices move on weighted angle bisectors, which are straight lines such that the weighted straight skeleton is a piecewise linear structure; see also Sect. 4.1.
For a given vertex v of P, its valid offsets are now given by the (dimensionindependent) conditions in Definition 3. If no degeneracies occur in the shrinking process for P, then vertex offsets are always unique: A(v) is defined by only two lines for initial events, and by three lines for non-initial events. In the latter case, A(v) contains a single bounded (triangular) cell t. It is easy to verify that t either must, or cannot, contribute to an inner offset which is radially visible. That is, edge events and split events are unique.
For multiple events, Definition 3.1 offers more generality than the standard polygon offsetting process. There is ambiguity caused by orphan edges, also for unweighted polygons. As an example, see Fig. 27(left) for a multiple split event, which is also called a vertex event in the literature [21]. Edge events can occur multiply as well, when two or more edges of P vanish at the same time. Such an event can be resolved either as in Fig. 5(right), or as in Fig. 25(middle) where orphan cells of the skeleton are created. The latter instance might be called a switching event, as a point-symmetric exchange of edges takes place. Switching events have the advantage that they keep the straight skeleton of P connected when parallel edges get merged, because no vertex On the other hand, skeleton cells do not stay interior-connected when orphan edges are allowed in events (but remain connected via the resolved vertex). In fact, a fixed edge e i of P can trace out (n) concatenated orphan cells when P has n edges; see Fig. 27(right). Multiple events can lead to planar straight skeletons whose combinatorial complexity is (n 2 ).
In the weighted case, ambiguity arises in a generic way in a new edge event: The offsets of two parallel edges e i and e j of P with w i = w j can merge into one edge, because the edge that separated them vanishes at vertex v. See Fig. 28 for this sliding event, its three radially visible offsets, and the different skeletons generated by them. The sliding event does not disconnect the weighted straight skeleton. In the offset line arrangement A(v), the triangular cell t degenerates to two slabs separated by the third offset line. Therefore, this type of ambiguity cannot be fixed by ruling out orphan edges owing to the more general definition of an offset boundary; the arity of the sliding event is 2.

Weighted Skeletons in 3-Space
We now study the effect of weighting on a polytope Q in R 3 . The discussion in the preceding subsection already indicates that there are no substantial differences to the unweighted case.
Most importantly, Definition 3.1 extends to weighted offset surfaces in R 3 , also in the case where the offset arrangement A(v) contains parallel planes that stem from differently weighted parallel facets of Q. Moreover, the existence is guaranteed: The proof of Theorem 3.3 generalizes straightforwardly, which also implies that weighted offset surfaces have to exist in orphan-free form. Weighted straight skeletons for Q therefore are well-defined cell complexes, for arbitrary positive facets weights.
The generic condition (Definition 6.1) now has to involve both weights and offset plane positions. In particular, two parallel offset planes H i and H j with the same orientation may identify for some value > 0 if w i = w j , and are counted as two different planes. Note that a non-generic weighting can force three offset planes to intersect in a common line for all values of .
Weighting legitimates more offset surfaces, because for general weights new combinatorics for a polytope vertex can arise. This is also true for orphan-free vertex resolution, which will be assumed in the sequel. For example, we can now obtain the two surfaces in Fig. 6(middle), by assigning a weight w > 1 to the facet f of the degree-5 vertex v, and weight 1 to its four other facets. Stated in different terms, for such a weighting the arity of the initial event at v is upgraded from 1 to 2. The spherical polygon for v stays the same, of course, but its bisector graphs change as being defined by weighted angle bisector planes. The vertex splitter in Sect. 4.2 will automatically recognize this situation, by checking the validity of candidate graphs with respect to the altered spherical embedding; cf. Lemma 4.5.
As in two dimensions, new weighting-specific events related to parallelism arise in R 3 . For example, when we resolve the apex of a pyramid based on the polygon P in Fig. 28(right) in an initial event, we obtain the three offset surfaces shown, for a fixed suitable set of facet weights. This is not possible when all weights have to be the same, as we recall from Sect. 4.1.
Similarly, when the polygon P is a facet (or a hole in a facet) of the offset polytope Q , then facet weights can be adjusted to let such a sliding edge event happen at vertex v, as a non-initial event. Thereby, the two parallel edges of P arrive at v, and in the orphan-free version they merge into a single edge. This edge can take over the offset movement of either merged part, which results in two different offset polytopes. In the weighted straight skeleton, three spokes are completed at v, and one new spoke (among two possible collinear choices) is constructed in one go at time . Vertex v becomes a skeleton corner of degree 4, like for unweighted skeletons. The spoke graph does not continue at v. This event is generic, belongs to the class of edge events because one edge vanishes, and is of arity 2. Notice that A(v) contains no parallel planes in this case, but three planes parallel to the same line.
There also exists a non-initial generic sliding facet event. It stems from two parallel planes in A(v), and is the 3D analogue of the planar sliding event. This event resembles the facet/facet collision event in Sect. 6.4. However, the identifying offset planes have the same orientation now, such that the event is not global. It can be categorized as a facet event, because two polytope facets merge into a single facet of Q . On the other hand, there is similarity to a simultaneous edge event, because several polytope edges incident to the merging facets vanish at different vertices of Q . The event is binary, because the new facet might proceed with either speed of its merged parts. For each vanished edge, a skeleton corner is generated where 4 spokes are completed, such that the spoke graph construction does not continue at these corners (like in the events E 5 , E 6 , and G −1 k ). We recall from Sect. 6.3 that certain facet events, or their inverses, also merge two parallel facets into one. If these facets carry different weights, then the event is not generic any more, though the structure of the (now binary) event does not change. By weighting other facets, however, a combinatorially different bisector graph can be obtained for some facets events, which then stay generic and unary. For instance, this happens for the inverse of the facet event F v (but in its non-complementary setting).
No other new weighted events exist in the generic case. A(v) cannot contain 3 or 4 parallel planes, and 4 nonparallel planes which are parallel to the same line lead to the global event of type collinear-edge/edge collision, in Sect. 6.4. Edge events and global events where A(v) lacks all kinds of parallelism remain combinatorially unaffected when weighted, and their arity is preserved. Global events with geometric degeneracies do not change either.
In summary, the initial events can change when weighted, but generic non-initial events do not, except possibly for facet events, albeit new event types are enabled. The incidence structure of the produced weighted straight skeleton, SK w , of Q is that of a cell complex as in Sect. 5.2. Generally, the properties of SK w are almost the same as of an unweighted skeleton. All cells of SK w are bordered by Q's boundary, because weighted offset planes still contribute continuously during the construction of SK w in the shrinking process. This property is important. It implies that there are at most n interior-connected cells, when the construction obeys orphan-free vertex resolution. Also, the property is needed for Lemma 5.2 to hold: The spoke graph of SK w is connected to Q's boundary. In fact, the layer construction in Sect. 7.2 extends (see also below), such that the O(n 3 ) upper bound in Theorem 5.3 is valid for the combinatorial complexity of weighted straight skeletons in R 3 .
When orphan facets may be produced in the resolution of vertices, then a cubic lower bound exists. The construction in Fig. 27(right) can be generalized to R 3 in an obvious way, which results in a straight skeleton of size (n 3 ) even when all weights are put to 1.
The only larger difference to the unweighted case is the lack of monotonicity of the skeleton cells (Lemma 7.2). For general facet weights for Q, only the cell of the facet with smallest weight, which corresponds to the steepest roof hyperplane, is monotone. In particular, this implies that the cells in SK w can have voids-but only if Q does the same, similar to the two-dimensional case. Hence Lemma 7.3 still extends to the spoke graph of weighted roof complexes without orphan cells.
No other proofs in earlier sections are based on the monotonicity property, such that the respective results carry over to the weighted setting. For instance, if Q is a boundary-connected polytope, then none of its offset polytopes contains voids (Lemma 6.5), so that all cells in SK w are still void-free. (This is needed in the derivation of the cubic size bound in Theorem 5.3.) Also, the computation of roof complexes extends (Lemma 7.7), and works in O(n 4 ) time for weighted roofs.
In this context, let us mention an optimality property of weighted roofs for convex polytopes Q, proved in [7]. Let Q have n facets and volume 1. For any positive numbers λ 1 , . . . , λ n with λ i = 1, there exists a weighted roof complex for Q such that its cells C i have volumes λ i . More precisely, facet weights w 1 , . . . , w n for Q can be found, such that the resulting weighted roof complex for Q (which is now unique and identical to SK w ) decomposes Q into prescribed shares. This result does not generalize to nonconvex polytopes, because SK w then can change discontinuously with the weighting.

Higher Dimensions
The concepts of polytope, radial visibility, and arrangement of planes generalize to Euclidean d-space R d , for d ≥ 4. As a consequence, many of the results in this paper are inherently dimension-independent, and have analogues in higher dimensions. This section comments on some implications.
The proof of the existence of mitered offset surfaces for a polytope vertex v, being based on its offset arrangement A(v), generalizes directly to arbitrary dimensions d. This also includes the orphan-free case, and positively weighted surfaces. Straight skeletons of nonconvex polytopes in R d therefore are well-defined geometric structures, both in their weighted and unweighted form. In a suitably generalized generic case (which we will assume below), straight skeletons are simple cell complexes, with exactly d+1 j skeleton faces of dimension j incident to each inner corner v. In particular, exactly d + 1 cells and spokes, respectively, meet at v. Geometric-but no combinatorial-degeneracies can occur in the cell structure, due to doubly-adjacent faces of various dimensions; cf. Sect. 5.2.
The regular structure of a straight skeleton stands in contrast to the incidence structure of the medial axis of Q, and the high algebraic degree of its components in R d , unless the defining Euclidean metric for the medial axis is replaced by some piecewise linear metric [2]. Note that a polytope Q in R d with n facets can have (n d 2 ) vertices. On the other hand, the number of cells in a straight skeleton (and also in the medial axis) of Q can be at most n, and the number of skeleton corners is trivially bounded by n d+1 . The structure of an event at a vertex v of Q in its shrinking process is determined by the arrangement A(v). For non-initial events, A(v) contains d + 1 hyperplanes which define a single d-simplex as the only bounded cell. This implies that, interestingly, such events are either unary or binary; there exist at most two resolution surfaces for v, like in the three-dimensional case (cf. the proof of Lemma 6.3). Initial events, of course, can be arbitrarily complex and have a high arity.
Our criteria for event classification are still meaningful. Concerning contacting events, we have global events where combinatorially unrelated parts of the offset polytope Q collide, and facet events where the same happens within some facet of Q . Edge events constitute the remaining class, where necessarily some edges of Q have to vanish, and where events are contact-free. Inverse events are well-defined via outer offsets or, equivalently, by generalizing Definition 6.2. The class of facet events may be further refined, by individually referring to face dimensions j, for 2 ≤ j ≤ d − 1.
Clearly, the number of event types within each class increases with the dimension. There are d+1 2 potential edge events, according to the same number of edges of a d-simplex. Also, there are (at least) quadratically many facet events and global events, because contacting faces of different dimensions have to be paired up. This is probably also the most suitable method for detecting these events, as higher-dimensional data structures tend to lose their efficiency in practice. However, all edge events (and all events from other classes where some edges vanish) can still be detected directly.
As bisector graphs are not appropriate any more, the algorithm of choice for event processing is the cell adding procedure using the arrangement A(v); see Sects. 3.2 and 4.2. For non-initial events, A(v) contains exactly 2 d+1 − 1 cells, such that the (at most 2) valid offset surfaces of a vertex v can be found reasonably quickly for small dimension d. Also for initial events, where O(m d ) cells have to be added, this method is still plausible when polytope vertices are of constant degree m ≥ d. This particularly concerns polytopes in R 4 , which might be the most interesting case. As with the bisector-graph based algorithm in Sect. 4.2, the type of an event needs not be known in advance, which makes a uniform treatment of events possible.
The concept of roofs and their complexes inside a polytope Q generalizes, and defines a decomposition of Q into polyhedral cells, which are monotone in the unweighted case. Simple cell complexes as in Lemma 7.7 can be computed in O(n d+1 ) time, once more by applying the cell adding technique, but now to the arrangement L(Q) of the n roof hyperplanes in R d+1 . Again, the main part of the algorithm is the construction of a hyperplane arrangement.
Finally, the sheet enumeration method from Sect. 7.2 extends to the 2-faces in straight skeletons of any dimension (including the planar case). Skeleton cells can be forced to be topological balls, by the augmentation of polytope facets with flat faces. Then blue triangles generated by edge events always have to be present in an orphan-free skeleton, and ( j + 1)-sheets can be constructed by completing j-sheets, for j ≥ 2. That is, the layer partition of corners and their greedy order exist. Simulating the greedy order by maintaining a surface ( ) in R d , we see that the number of layers stays linear in n for (weighted) straight skeletons, because each blue/red pair of layers can be charged to the construction of some skeleton cell again. The count for corners per blue layer can be done with respect to the angle (d − 1)-sector planes of the polytope Q (for example, the n 3 trisector planes in R 4 ). The same arguments as in the proof of Theorem 7.5 apply, and lead to an upper bound of O(n d−1 ) for a fixed layer. We obtain the following general theorem for the size of straight skeletons. Roof surfaces can be viewed as monotone terrains in (non-vertical) hyperplane arrangements in R d+1 , which are generalizations of monotone paths in line arrangements [11]. They range between zones and levels; see Sect. 7.3. As mentioned there, monotone paths in R 2 can be long, and the size of a k-level in an arrangement of planes in R 3 can be super-quadratic. But when only unbounded terrain facets are present, then obviously the terrain size in R 2 is 2, and O(n) in R 3 because the edges of the terrain form a planar graph with at most n faces. It remains unclear what happens in higher dimensions. However, from the straight skeleton bound in Theorem 9.1 we conjecture that monotone terrains composed of n unbounded facets behave like zones, having a combinatorial complexity of O(n d ) in R d+1 .

Practical Issues
In this section, we report on some experimental results and potential applications. Many more details concerning implementation aspects and experiments are provided in [33].

Implementation
We have implemented an algorithm that computes (weighted) straight skeletons in R 3 . To be able to accept input polytopes with vertices of higher degree, the algorithm also works in the non-generic case. This is eased by the fact that once an event has been detected, its processing needs not be adapted to its anatomy; all events are treated uniformly with the vertex splitter in Sect. 4.2. Constant time per event suffices, when the degree of the resolved vertex is a constant.
The detection of events, on the other hand, is a notoriously difficult and timeconsuming task, as is well known from the planar case. We have mentioned some possibilities for speed-up along with the event description. The problem is in finding the contacting events, especially the global ones. It seems hard to capture the interplay of the reflex faces of the polytope Q with a structure like the motorcycle graph [21,32], which reduces the worst-case runtime in two dimensions. In practice, a suitable volume tetrahedrization of Q should give a satisfactory detection method, with outputsensitive behavior and sublinear average runtime per event for most boundary-meshed polytopes. We have only implemented the straightforward method, as our main interest here is in the structural and quantitative properties of the computed skeletons. For facet events the detection is still fast, because facet sizes can be considered a constant for most polytope data. Figure 29 displays an example of the output. (In fact, most illustrations in Sect. 6 have been produced automatically.) The polytope Q is a cube with three pyramidal pits. It has 20 vertices which all have degree 3. Therefore, no initial events need to be performed, and the straight skeleton is constructed with a total of 49 non-initial events. The global events include 3 piercing events and 1 kissing event, the latter leading to a merge of two tunnels. There are 22 facet events, where 11 split the offset polytope. The edge events list as 10 of type E 3 , 8 of type E 6 , and only 5 where a single edge vanishes. Comparing the number of splits to the number of tetrahedra collapses, we see that 1 + 11 − 8 = 4 splits must be local and destroy tunnels in the offset polytope. There are more contacting events than edge events, due to the extreme shape of Q. The number of skeleton corners is vertices plus non-initial events, which gives 69. The skeleton is unique in this case, because there are no initial events, and the binary saddle vertex event E 1b does not occur. Observe that two facets of Q have holes (the topmost facet, and the one on the left side), and their cells contain tunnels. Indeed, there is no greedy order of the events; its existence has to be restored by adding three flat edges on the boundary of Q.
We have tested various polytopes of different sizes, mostly boundary-triangulated and modeling common shapes, but also polytopes of extreme shape, like the ones in Fig. 10 (ID: Pizza Box in the table below) and Fig. 29 (ID: Spiky), and related ones. One

Numbers of vertices and corners are indicated in bold
Events with arity larger than 1 give choice among different (orphan-free) offset surfaces, especially for initial events. For example, we can maximize the number of convex edges, or reflex edges respectively, at each event. As can be seen from the table (Columns 2 and 3), the former strategy led to fewer events, and thus to straight skeletons of smaller combinatorial size, apart from the first four polytopes whose skeletons are unique. This choice also tends to keep the volume large, whereas the polytope is 'slimmed down' more quickly when reflex edges are maximized. However, extreme volumes are not achieved; there exist counterexamples for initial events. Of course, the volume can be maximized (or minimized) directly in each event. Unfortunately, this local optimization strategy does not guarantee that the volume of the offset polytope Q is kept maximal (minimal) for all values of . Similarly, choosing fewer convex edges in some event can lead to later events which generate a polytope with more convex edges. Concerning skeleton size, extreme volume gave quite similar counts as extreme edge convexity, but none of these criteria produced the smallest (respectively largest) skeleton in all examples.
The effect of weighting on the straight skeleton can be seen in Column 4. In the respective polytope, all facets carry unit weight but one, whose weight was put to 10. This can lead to a drastic reduction of the skeleton size (Rows 1 to 3), when the heavyweighted facet defines a large cell and extrudes many other facets which had larger cells in the unweighted skeleton. The effect gets slightly stronger when convex offset edges are maximized, wherefore we used this construction rule.
The layer count L in Column 5 shows that usually only a few layers are present, unless the polytope has an extreme shape. Convex polytopes, like the one in Row 2, have a single layer; see Corollary 7.6. For three test polytopes the greedy order does not exist, because tunnels in skeleton cells arise. The number of layers tends to be larger when reflex offset edges are maximized; we used this choice in the table.
Concerning optimization criteria, let us mention a relation between the volume of the offset polytope Q and its surface area. Denote with the union of all offset facets created in Q +t when a vertex v of Q is resolved. As is radially visible, the volume V ( ) of the pyramid with base and apex v is the sum of the volumes of the respective pyramids based on 's facets. That is, V ( ) = A( ) · t 3 , when A( ) is the area of . Considering two offset surfaces 1 and 2 for v, the (local) volume difference of the offset polytopes Q 1 and Q 2 therefore is −(A( 1 ) − A( 2 )) · t 3 . This implies that maximizing the volume of an offset polytope minimizes its surface area, and vice versa.
An interesting though probably hard problem is to find (or even characterize) straight skeletons that require a minimal number of construction events. This question is also practically relevant, as such skeletons realize a minimum number of corners.

Applications
Planar straight skeletons enjoy various applications, and the same can be expected for their generalizations in three dimensions. We conclude this paper with mentioning a few promising candidates.
The most direct application is offset calculation for triangular, or more generally, polygonal meshes. This operation is important in CAD, for example, for the thinning of solid objects and tool path generation. A suitable offset definition for the meshed surface is usually problematic. Surfaces derived from the medial axis [29] are welldefined, but they are not piecewise linear any more. Spherical and cylindrical patches have to be dealt with, which arise in the neighborhood of reflex surface components. For mitered and thus polygonal offset surfaces, many heuristics for locally repairing and filling the mesh after its facet-based or vertex-based offsetting have been proposed; see e.g. [24,34].
Our method automatically produces a topologically correct mitered offset mesh (which can be re-triangulated if desired), and also determines the largest allowable offset threshold . Optimization criteria as in Sect. 10.1 can be applied, possibly combined with weighting strategies which are common in other offsetting approaches. As a byproduct, our vertex resolution process can be used to convert a triangulated input surface into a polygonal surface where all vertices have degree 3.
We say that a polytope Q can be flattened if Q can be collapsed by offsetting without tearing the surface [19]. In other words, Q can be shrunk to volume zero without the occurrence of any event that changes its topology. Clearly, Q must not contain voids or tunnels. Near-convex polytopes (Corollary 7.6) always can be flattened, because edge events do not cause topological changes, but there are also facet events with this property (see the event table in Sect. 6.5). Our straight skeleton algorithm will recognize when certain polytopes can be flattened, though we face the problem that skeletons are not unique: Whether Q stays a topological ball for all may depend on the shrinking process the skeleton is based on. A plausible heuristic is to resort to vertex resolution where the volume of Q is maximized.
Having agreed on a particular skeleton for Q, the following strategy can be used. Only edge events and facet events are performed, whose implementation is usually fast. The latter events are tested directly whether they tear the surface. Possibly arising global events are ignored, so that the obtained offset surfaces may self-intersect (a situation similar to that in Sect. 7.2). This will be detected in later edge events, though, when surface parts with a 'wrongly' oriented neighborhood get collapsed.
The two-dimensional case is much simpler. Exactly the near-convex polygons can be flattened, and this property can be recognized by constructing a unique straight skeleton. However, if weighting is allowed then no efficient method is known even in the planar case. A discussion of several generalized notions of convexity for polygons (being different from near-convexity) can be found in [5].
Every straight skeleton of a polytope Q, and more generally every roof complex for Q, defines a decomposition of Q into polyhedral cells. These cells are monotone in the unweighted case (Lemma 7.2), but can be of complex shape and large size. The shrinking process offers a direct means to refine the cells into simple shape: We can use the boundary surface of Q for partitioning, after each event or in well-spaced -intervals. This will produce a volume mesh with node degree ≤6 that mainly consists of prismatic cells. When the boundary facets of Q are sufficiently small (which is usually the case for boundary-triangulated polytopes obtained from approximating solid objects), then the cells in the mesh will tend to be small as well. Cells still unsuitable for a particular application, for example, in finite element methods [23], can be further refined with sheets normal to the defining facets of Q, because the monotonicity property is retained in such a volume mesh. Also, cell sizes can be steered by assigning a smaller weight to facets of Q which extrude other facet's cells. The monotonicity then may get lost, though.
We recall that a suitable roof complex D for the polytope Q to be volume-meshed may be computed beforehand, with the method in Sect. 7.3. Then the implementation of the shrinking process for D is much easier than that for any straight skeleton: The arising events only need to be processed in increasing order of time stamps, rather than also be detected, which is by far the more costly task. The time stamp of an event is given by the normal distance of the respective inner corner v of D to the 4 supporting planes of Q whose -offsets concur in v.
Like in two dimensions, a straight skeleton in R 3 can attain a shape that reflects little of the distance information to the boundary of the input polytope Q. This is due to reflex boundary features of Q that form small exterior angles, and may be undesirable in applications. A way to remedy this shortcoming [4], which has been systematically applied in the polygon case [30], is to 'mitigate' reflex vertices and edges of Q locally by introducing new facets. This can always be done, also when Q contains saddle vertices, in the offset polytope Q immediately after the initial events, because Q then is a simple polytope in the generic case (Sect. 6). We conjecture that a convergence result similar to the one in [30] can be established, showing that the skeleton of the truncated polytope approximates the medial axis of Q. However, the (possibly high) arity of the initial events has to be taken into account. With a result of this kind, straight skeletons could serve as an alternative to existing piecewise-linear approximations of 3D medial axes; see e.g. [8].