This article is an orphan, as no other articles link to it . Please introduce links to this page from related articles ; try the Find link tool for suggestions. (March 2022) |
Polygons with holes, with simply connected brown regions and interior boundaries, including degenerate cases of single vertices and edges, (a,b,f). | |
Circular | Pentagonal |
An annulus can be approximated by two n-sided boundaries with the same center, but different radius. |
In geometry, a polygon with holes is an area-connected planar polygon with one external boundary and one or more interior boundaries (holes). [1] Polygons with holes can be dissected into multiple polygons by adding new edges, so they are not frequently needed.
An ordinary polygon can be called simply-connected, while a polygon-with-holes is multiply-connected. An H-holed-polygon is H-connected. [2]
Degenerate cases may be considered, but a well-formed holed-polygon must have no contact between exterior and interior boundaries, or between interior boundaries. Nondegenerate holes should have 3 or more sides, excluding internal point boundaries (monogons) and single edge boundaries (digons).
Area fill algorithms in computational lists the external boundary vertices can be listed in counter-clockwise order, and interior boundaries clockwise. This allows the interior area to be defined as left of each edge. [3]
A polygons with holes can be transformed into an ordinary unicursal boundary path by adding (degenerate) connecting double-edges between boundaries, or by dissecting or triangulating it into 2 or more simple polygons.
Polygons with holes can be seen as faces in polyhedra, like a cube with a smaller cube externally placed on one of its square faces (augmented), with their common surfaces removed. A toroidal polyhedron can also be defined connecting a holed-face to a holed-faced on the opposite side (excavated). The 1-skeleton (vertices and edges) of a polyhedron with holed-faces is not a connected graph. Each set of connected edges will make a separate polyhedron if their edge-connected holes are replaced with faces.
The Euler characteristic of hole-faced polyhedron is χ = V - E + F = 2(1-g) + H, genus g, for V vertices, E edges, F faces, and H holes in the faces.
A face with a point hole is considered a monogonal hole, adding one vertex, and one edge, and can attached to a degenerate monogonal hosohedron hole, like a cylinder hole with zero radius. A face with a degenerate digon hole adds 2 vertices and 2 coinciding edges, where the two edges attach to two coplanar faces, as a dihedron hole.
In geometry, a polyhedron is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices. The word polyhedron comes from the Classical Greek πολύεδρον, as poly- + -hedron.
In solid geometry, a face is a flat surface that forms part of the boundary of a solid object; a three-dimensional solid bounded exclusively by faces is a polyhedron.
In geometry, stellation is the process of extending a polygon in two dimensions, polyhedron in three dimensions, or, in general, a polytope in n dimensions to form a new figure. Starting with an original figure, the process extends specific elements such as its edges or face planes, usually in a symmetrical way, until they meet each other again to form the closed boundary of a new figure. The new figure is a stellation of the original. The word stellation comes from the Latin stellātus, "starred", which in turn comes from Latin stella, "star". Stellation is the reciprocal or dual process to faceting.
In geometry, the truncated cube, or truncated hexahedron, is an Archimedean solid. It has 14 regular faces, 36 edges, and 24 vertices.
In geometry, a prism is a polyhedron comprising an n-sided polygon base, a second base which is a translated copy of the first, and n other faces, necessarily all parallelograms, joining corresponding sides of the two bases. All cross-sections parallel to the bases are translations of the bases. Prisms are named after their bases; example: a prism with a pentagonal base is called a pentagonal prism. Prisms are a subclass of prismatoids.
In geometry, the truncated cuboctahedron is an Archimedean solid, named by Kepler as a truncation of a cuboctahedron. It has 12 square faces, 8 regular hexagonal faces, 6 regular octagonal faces, 48 vertices, and 72 edges. Since each of its faces has point symmetry, the truncated cuboctahedron is a zonohedron. The truncated cuboctahedron can tessellate with the octagonal prism.
In geometry, a star polygon is a type of non-convex polygon, and most commonly, a type of decagon. Regular star polygons have been studied in depth; while star polygons in general appear not to have been formally defined, however certain notable ones can arise through truncation operations on regular simple and star polygons.
A regular polyhedron is a polyhedron whose symmetry group acts transitively on its flags. A regular polyhedron is highly symmetrical, being all of edge-transitive, vertex-transitive and face-transitive. In classical contexts, many different equivalent definitions are used; a common one is that the faces are congruent regular polygons which are assembled in the same way around each vertex.
In geometry, a pentahedron is a polyhedron with five faces or sides. There are no face-transitive polyhedra with five sides and there are two distinct topological types.
A uniform polyhedron has regular polygons as faces and is vertex-transitive. It follows that all vertices are congruent.
In geometry, an alternation or partial truncation, is an operation on a polygon, polyhedron, tiling, or higher dimensional polytope that removes alternate vertices.
In geometry, a digon is a polygon with two sides (edges) and two vertices. Its construction is degenerate in a Euclidean plane because either the two sides would coincide or one or both would have to be curved; however, it can be easily visualised in elliptic space.
In geometry, a monogon, also known as a henagon, is a polygon with one edge and one vertex. It has Schläfli symbol {1}.
A dihedron is a type of polyhedron, made of two polygon faces which share the same set of n edges. In three-dimensional Euclidean space, it is degenerate if its faces are flat, while in three-dimensional spherical space, a dihedron with flat faces can be thought of as a lens, an example of which is the fundamental domain of a lens space L(p,q). Dihedra have also been called bihedra, flat polyhedra, or doubly covered polygons.
In geometry, the Császár polyhedron is a nonconvex toroidal polyhedron with 14 triangular faces.
In geometry, an edge is a particular type of line segment joining two vertices in a polygon, polyhedron, or higher-dimensional polytope. In a polygon, an edge is a line segment on the boundary, and is often called a polygon side. In a polyhedron or more generally a polytope, an edge is a line segment where two faces meet. A segment joining two vertices while passing through the interior or exterior is not an edge but instead is called a diagonal.
In geometry, a toroidal polyhedron is a polyhedron which is also a toroid, having a topological genus of 1 or greater. Notable examples include the Császár and Szilassi polyhedra.
In geometry, the density of a star polyhedron is a generalization of the concept of winding number from two dimensions to higher dimensions, representing the number of windings of the polyhedron around the center of symmetry of the polyhedron. It can be determined by passing a ray from the center to infinity, passing only through the facets of the polytope and not through any lower dimensional features, and counting how many facets it passes through. For polyhedra for which this count does not depend on the choice of the ray, and for which the central point is not itself on any facet, the density is given by this count of crossed facets.
In graph drawing and geometric graph theory, a Tutte embedding or barycentric embedding of a simple 3-vertex-connected planar graph is a crossing-free straight-line embedding with the properties that the outer face is a convex polygon and that each interior vertex is at the average of its neighbors' positions. If the outer polygon is fixed, this condition on the interior vertices determines their position uniquely as the solution to a system of linear equations. Solving the equations geometrically produces a planar embedding. Tutte's spring theorem, proven by W. T. Tutte (1963), states that this unique solution is always crossing-free, and more strongly that every face of the resulting planar embedding is convex. It is called the spring theorem because such an embedding can be found as the equilibrium position for a system of springs representing the edges of the graph.
The expanded cuboctahedron is a polyhedron, constructed as an expanded cuboctahedron. It has 50 faces: 8 triangles, 30 squares, and 12 rhombs. The 48 vertices exist at two sets of 24, with a slightly different distance from its center.