# .

The term complex polygon can mean two different things:

In computer graphics, a polygon which is neither convex nor concave.
In geometry, a polygon in the unitary plane, which has two complex dimensions.

Computer graphics
A complex (self-intersecting) pentagon

In the world of computer graphics, a complex polygon is a polygon which is neither convex nor concave. This includes any polygon which:

intersects itself. These include star polygons such as the pentagram:A star polygon

has a boundary comprising discrete circuits, such as a polygon with a hole in it.

Therefore, unlike simple polygons, a complex polygon may not always be interpreted as a simple polygonal region. Vertices are only counted at the ends of edges, not where edges intersect in space.

A formula relating an integral over a bounded region to a closed line integral may still apply when the "inside-out" parts of the region are counted negatively.

Moving around the polygon, the total amount one "turns" at the vertices can be any integer times 360°, e.g. 720° for a pentagram and 0° for an angular "eight".

Geometry

In geometry, a complex polygon is a polygon in the complex Hilbert plane, which has two complex dimensions.

A complex number may be represented in the form (a + ib), where a and b are real numbers, and i is the square root of -1. A complex number lies in a complex plane having one real and one imaginary dimension, which may be represented as an Argand diagram. So a single complex dimension is really two dimensions, but of different kinds.

The unitary plane comprises two such complex planes, which are orthogonal to each other. Thus it has two real dimensions x and y, and two imaginary dimensions ix and iy.

A complex polygon is a two-dimensional example of the more general complex polytope in higher dimensions.

In a real plane, a visible figure can be constructed as the real conjugate of some complex polygon.
References

Coxeter, H. S. M., Regular Complex Polytopes, Cambridge University Press, 1974.

Simple polygon
Star polygon
Convex hull
Nonconvex uniform polyhedron
Nonzero-rule

Introduction to Polygons
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://www.scientificlib.com/en/Mathematics/LX/ComplexPolygon.html", "fetch_time": 1708909841000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2024-10/segments/1707947474649.44/warc/CC-MAIN-20240225234904-20240226024904-00612.warc.gz", "warc_record_offset": 987875427, "warc_record_length": 3388, "token_count": 459, "char_count": 2128, "score": 3.96875, "int_score": 4, "crawl": "CC-MAIN-2024-10", "snapshot_type": "latest", "language": "en", "language_score": 0.9287571310997009, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00061-of-00064.parquet"}