Search results
Results from the WOW.Com Content Network
The intersection of two convex polygons is a convex polygon. A convex polygon may be triangulated in linear time through a fan triangulation, consisting in adding diagonals from one vertex to all other vertices. Helly's theorem: For every collection of at least three convex polygons: if all intersections of all but one polygon are nonempty ...
Individual polygons are named (and sometimes classified) according to the number of sides, combining a Greek-derived numerical prefix with the suffix -gon, e.g. pentagon, dodecagon. The triangle , quadrilateral and nonagon are exceptions, although the regular forms trigon , tetragon , and enneagon are sometimes encountered as well.
All convex polygons are simple. Concave: Non-convex and simple. There is at least one interior angle greater than 180°. Star-shaped: the whole interior is visible from at least one point, without crossing any edge. The polygon must be simple, and may be convex or concave. All convex polygons are star-shaped.
The convex forms are listed in order of degree of vertex configurations from 3 faces/vertex and up, and in increasing sides per face. This ordering allows topological similarities to be shown. There are infinitely many prisms and antiprisms, one for each regular polygon; the ones up to the 12-gonal cases are listed.
Convex regular polygons can also form plane tilings that are not edge-to-edge. Such tilings can be considered edge-to-edge as nonregular polygons with adjacent colinear edges. There are seven families of isogonal figures , each family having a real-valued parameter determining the overlap between sides of adjacent tiles or the ratio between the ...
A polytope is a geometric object with flat sides, which exists in any general number of dimensions. The following list of polygons, polyhedra and polytopes gives the names of various classes of polytopes and lists some specific examples.
Three regular polygons, eight planigons, four demiregular planigons, and six not usable planigon triangles which cannot take part in dual uniform tilings; all to scale.. In geometry, a planigon is a convex polygon that can fill the plane with only copies of itself (isotopic to the fundamental units of monohedral tessellations).
In geometry, a convex curve is a plane curve that has a supporting line through each of its points. There are many other equivalent definitions of these curves, going back to Archimedes. Examples of convex curves include the convex polygons, the boundaries of convex sets, and the graphs of convex functions.