Search results
Results from the WOW.Com Content Network
An example of a concave polygon. A simple polygon that is not convex is called concave, [1] non-convex [2] or reentrant. [3] A concave polygon will always have at least one reflex interior angle—that is, an angle with a measure that is between 180 degrees and 360 degrees exclusive. [4]
Non-convex: a line may be found which meets its boundary more than twice. Equivalently, there exists a line segment between two boundary points that passes outside the polygon. Simple: the boundary of the polygon does not cross itself. All convex polygons are simple. Concave: Non-convex and simple. There is at least one interior angle greater ...
An example of a convex polygon: a regular pentagon.. In geometry, a convex polygon is a polygon that is the boundary of a convex set.This means that the line segment between two points of the polygon is contained in the union of the interior and the boundary of the polygon.
X marks convex corners; O marks concave corners. Blue lines are knobs; red lines are anti-knobs; yellow lines are neither. A rectilinear polygon has corners of two types: corners in which the smaller angle (90°) is interior to the polygon are called convex and corners in which the larger angle (270°) is interior are called concave. [1]
A set that is not convex is called a non-convex set. A polygon that is not a convex polygon is sometimes called a concave polygon, [4] and some sources more generally use the term concave set to mean a non-convex set, [5] but most authorities prohibit this usage. [6] [7]
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. They use the same vertices as the convex forms, but connect in an alternate connectivity which passes around the circle more than once to be completed.
A point-set triangulation is a polygon triangulation of the convex hull of a set of points. A Delaunay triangulation is another way to create a triangulation based on a set of points. The associahedron is a polytope whose vertices correspond to the triangulations of a convex polygon. Polygon triangle covering, in which the triangles may overlap.
Fan triangulation of a convex polygon Fan triangulation of a concave polygon with a unique concave vertex. In computational geometry, a fan triangulation is a simple way to triangulate a polygon by choosing a vertex and drawing edges to all of the other vertices of the polygon. Not every polygon can be triangulated this way, so this method is ...