Search results
Results From The WOW.Com Content Network
In geometry, a star-shaped polygon is a polygonal region in the plane that is a star domain, that is, a polygon that contains a point from which the entire polygon boundary is visible. Formally, a polygon P is star-shaped if there exists a point z such that for each point p of P the segment ¯ lies entirely within P. [1]
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) and where q ≥ 2.
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 .
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 ...
Another important class of simple polygons are the star-shaped polygons, the polygons that have a point (interior or on their boundary) from which every point is visible. [ 2 ] A monotone polygon , with respect to a straight line L {\displaystyle L} , is a polygon for which every line perpendicular to L {\displaystyle L} intersects the interior ...
In geometry, a star polyhedron is a polyhedron which has some repetitive quality of nonconvexity giving it a star-like visual quality. There are two general kinds of star polyhedron: Polyhedra which self-intersect in a repetitive way. Concave polyhedra of a particular kind which alternate convex and concave or saddle vertices in a repetitive way.
This page was last edited on 3 November 2020, at 11:21 (UTC).; Text is available under the Creative Commons Attribution-ShareAlike 4.0 License; additional terms may apply.
For the same choice of a pivot point for the sorting algorithm, connecting all of the other points in their sorted order around this point rather than performing the remaining steps of the Graham scan produces a star-shaped polygon, a polygonalization of the input. [4]