In computational geometry, the point-in-polygon (PIP) problem asks whether a given point in the plane lies inside, outside, or on the boundary of a polygon...

simple polygons, polygonalization of point sets, constructive solid geometry formulas for polygons, and visibility graphs of polygons. A simple polygon is...

In geometry, a polygon (/ˈpɒlɪɡɒn/) is a plane figure made up of line segments connected to form a closed polygonal chain. The segments of a closed polygonal...

topological quantum number). A point's winding number with respect to a polygon can be used to solve the point in polygon (PIP) problem – that is, it can...

causes shapes to fill in strange ways. On a simple curve, the even–odd rule reduces to a decision algorithm for the point in polygon problem. The SVG computer...

than general-purpose point location data structures in this application. Another special case is the point in polygon problem, in which one needs to determine...

consider the following problem. Point in polygon: Decide whether a point is inside or outside a given polygon. In many applications this problem is...

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

In geometry, a polygon P in the plane is called monotone with respect to a straight line L, if every line orthogonal to L intersects the boundary of P...

In geometry, an equilateral polygon is a polygon which has all sides of the same length. Except in the triangle case, an equilateral polygon does not need...

called the eight-point circle. More generally, a polygon in which all vertices are concyclic is called a cyclic polygon. A polygon is cyclic if and only...

articles associated with the title The Polygon. If an internal link led you here, you may wish to change the link to point directly to the intended article...

In computational geometry, the visibility polygon or visibility region for a point p in the plane among obstacles is the possibly unbounded polygonal...

odd. The classic point in polygon test from computational geometry applies the above ideas. To determine if a point lies within a polygon, one casts a ray...

In Euclidean geometry, a regular polygon is a polygon that is direct equiangular (all angles are equal in measure) and equilateral (all sides have the...

Point in polygon Point location Hidden line removal Mathematics and fiber arts Van Hiele model - Prevailing theory of how children learn to reason in...

In geometry, a decagram is a 10-point star polygon. There is one regular decagram, containing the vertices of a regular decagon, but connected by every...

DEC and CP/M file transfer utility Point in polygon, a concept in computational geometry Policy Information Point, in eXtensible Access Control Markup Language...

usage of "polygon" Star polygon, a star-like polygon Polygon (computer graphics), a representation of a polygon in computer graphics Polygon (blockchain)...

In geometry, a partition of a polygon is a set of primitive units (e.g., triangles, rectangles, etc.), which do not overlap and whose union equals the...

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

In computational geometry, polygon triangulation is the partition of a polygonal area (simple polygon) P into a set of triangles, i.e., finding a set...

internal angle (or interior angle) if a point within the angle is in the interior of the polygon. A polygon has exactly one internal angle per vertex...

a special case of isothetic polygons. In many cases another definition is preferable: a rectilinear polygon is a polygon with sides parallel to the axes...

meet or intersect. For example, the point where two lines meet to form an angle and the point where edges of polygons and polyhedra meet are vertices. The...

In geometry, the midpoint polygon of a polygon P is the polygon whose vertices are the midpoints of the edges of P. It is sometimes called the Kasner...

class of operations) in a geographic information system (GIS) for integrating two or more vector spatial data sets. Terms such as polygon overlay, map overlay...

In geometry, a polygonal chain is a connected series of line segments. More formally, a polygonal chain ⁠ P {\displaystyle P} ⁠ is a curve specified by...

In geometry, a star polygon is a type of non-convex polygon. Regular star polygons have been studied in depth; while star polygons in general appear not...

algorithm to determine the area of a simple polygon whose vertices are described by their Cartesian coordinates in the plane. It is called the shoelace formula...