enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Star-shaped polygon - Wikipedia

    en.wikipedia.org/wiki/Star-shaped_polygon

    If a star-shaped polygon is convex, the link distance between any two of its points (the minimum number of sequential line segments sufficient to connect those points) is 1, and so the polygon's link diameter (the maximum link distance over all pairs of points) is 1. If a star-shaped polygon is not convex, the link distance between a point in ...

  3. Kepler–Poinsot polyhedron - Wikipedia

    en.wikipedia.org/wiki/Kepler–Poinsot_polyhedron

    In 1809, Louis Poinsot rediscovered Kepler's figures, by assembling star pentagons around each vertex. He also assembled convex polygons around star vertices to discover two more regular stars, the great icosahedron and great dodecahedron. Some people call these two the Poinsot polyhedra. Poinsot did not know if he had discovered all the ...

  4. Star domain - Wikipedia

    en.wikipedia.org/wiki/Star_domain

    A star domain (equivalently, a star-convex or star-shaped set) is not necessarily convex in the ordinary sense. An annulus is not a star domain.. In geometry, a set in the Euclidean space is called a star domain (or star-convex set, star-shaped set [1] or radially convex set) if there exists an such that for all , the line segment from to lies in .

  5. Star polygon - Wikipedia

    en.wikipedia.org/wiki/Star_polygon

    Regular convex and star polygons with 3 to 12 vertices, labeled with their Schläfli symbols A regular star polygon is a self-intersecting, equilateral, and equiangular polygon . A regular star polygon is denoted by its Schläfli symbol { p / q }, where p (the number of vertices) and q (the density ) are relatively prime (they share no factors ...

  6. Convex polygon - Wikipedia

    en.wikipedia.org/wiki/Convex_polygon

    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 ...

  7. List of regular polytopes - Wikipedia

    en.wikipedia.org/wiki/List_of_regular_polytopes

    The polytopes of rank 2 (2-polytopes) are called polygons.Regular polygons are equilateral and cyclic.A p-gonal regular polygon is represented by Schläfli symbol {p}.. Many sources only consider convex polygons, but star polygons, like the pentagram, when considered, can also be regular.

  8. Polygon - Wikipedia

    en.wikipedia.org/wiki/Polygon

    All convex polygons are star-shaped. Self-intersecting: the boundary of the polygon crosses itself. The term complex is sometimes used in contrast to simple, but this usage risks confusion with the idea of a complex polygon as one which exists in the complex Hilbert plane consisting of two complex dimensions. Star polygon: a polygon which self ...

  9. List of uniform polyhedra - Wikipedia

    en.wikipedia.org/wiki/List_of_uniform_polyhedra

    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.