In geometry, a weakly simple polygon is a generalization of a simple polygon, allowing the polygon sides to touch each other in limited ways. Different authors have defined weakly simple polygons in different ways:
The polygonal boundary of a topological disk
One definition is that, when a simply connected open set in the plane is bounded by finitely many line segments, then its boundary forms a weakly simple polygon.[1] In the image, ABCDEFGHJKLM is a weakly simple polygon according to this definition, with the color blue marking the region for which it is the boundary. This type of weakly simple polygon can arise in computer graphics and CAD as a computer representation of polygonal regions with holes: for each hole a "cut" is created to connect it to an external boundary. Referring to the image above, ABCM is an external boundary of a planar region with a hole FGHJ. The cut ED connects the hole with the exterior and is traversed twice in the resulting weakly simple polygonal representation.
In an alternative and more general definition of weakly simple polygons, they are the limits of sequences of simple polygons. The polygons in the sequence should all have the same combinatorial type as each other, with convergence under the Fréchet distance.[2] This formalizes the notion that such a polygon allows segments to touch but not to cross. This generalizes the notion of the polygonal boundary of a topological disk: this boundary is the limit of a sequence of polygons, offset from it within the disk. However, this type of weakly simple polygon does not need to form the boundary of a region, as its "interior" can be empty. For example, referring to the same image, the polygonal chain ABCBA is a weakly simple polygon according to this definition: it may be viewed as the limit of "squeezing" of the polygon ABCFGHA.
^Dumitrescu, Adrian; Tóth, Csaba D. (2007). "Light orthogonal networks with constant geometric dilation". In Thomas, Wolfgang; Weil, Pascal (eds.). STACS 2007: 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings (illustrated ed.). Springer. p. 177. ISBN 978-3540709176.
^Chang, Hsien-Chih; Erickson, Jeff; Xu, Chao (2015). "Detecting weakly simple polygons". In Indyk, Piotr (ed.). Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015. {SIAM}. pp. 1655–1670. arXiv:1407.3340. doi:10.1137/1.9781611973730.110.
and 23 Related for: Weakly simple polygon information
In geometry, a simplepolygon is a polygon that does not intersect itself and has no holes. That is, it is a piecewise-linear Jordan curve consisting...
three-dimensional polyhedron is called weakly monotonic in direction L if all cross-sections orthogonal to L are simplepolygons. If the cross-sections are convex...
lies inside or outside a simplepolygon. From a given point, trace a ray that does not pass through any vertex of the polygon (all rays but a finite number...
Euclidean plane is a simplepolygon with the given points as its vertices. A polygonalization may also be called a polygonization, simple polygonalization...
states that every simplepolygon with more than three vertices has at least two ears, vertices that can be removed from the polygon without introducing...
and x = 1 {\displaystyle x=1} (see Sobolev spaces). Such functions are (weakly) once differentiable, and it turns out that the symmetric bilinear map ϕ...
include the self-crossing star polyhedra, whose faces may not form simplepolygons, and some of whose edges may belong to more than two faces. Definitions...
into polygons within which one site is closer than any other. The sites on the convex hull of the input give rise to unbounded Voronoi polygons, two of...
be replaced by techniques from algebraic geometry, where the relatively weak Zariski topology causes many technical complications. Non-compact topological...
abstract polygon is regular, since angles, edge-lengths, edge curvature, skewness etc. do not exist for abstract polytopes. There are several other weaker concepts...
role in early progress towards the classification of finite simple groups, especially for simple groups whose characterization was not amenable to purely...
referred to it as "simple and satisfying", commenting positively on the way Kiryu can easily perform intense fighting techniques. Polygon criticized how Dragon...
efficient use of material or space Point in polygon algorithms: tests whether a given point lies within a given polygon Point set registration algorithms: finds...
in optimization, one differentiates between strongly polynomial time and weakly polynomial time algorithms. These two concepts are only relevant if the...
“Shrine” putting him on equal footing with the king himself. Writing for Polygon, Chingy Nea initially stated to finding Yuji to be "a typical shōnen hero...
bipartite graph. Also, all dual polar spaces are near polygons. Many near polygons are related to finite simple groups like the Mathieu groups and the Janko group...
Polygon. November 2019. Archived from the original on November 4, 2019. Retrieved November 4, 2019. "The biggest changes coming to Diablo 4". Polygon...
graph is the visibility graph of a simplepolygon. Maximal outerplanar graphs are also formed as the graphs of polygon triangulations. They are examples...
the polygon count expanded to the point that the team feared they could not maintain a steady frame rate. In response, they devises a type of polygon culling...
Global Information