Not signed in (Sign In)

Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

  • Sign in using OpenID

Site Tag Cloud

2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry book bundles calculus categorical categories category category-theory chern-weil-theory cohesion cohesive-homotopy-type-theory cohomology colimits combinatorics complex complex-geometry computable-mathematics computer-science constructive cosmology deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry digraphs duality elliptic-cohomology enriched fibration foundation foundations functional-analysis functor gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck group group-theory harmonic-analysis higher higher-algebra higher-category-theory higher-differential-geometry higher-geometry higher-lie-theory higher-topos-theory homological homological-algebra homotopy homotopy-theory homotopy-type-theory index-theory integration integration-theory k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure-theory modal modal-logic model model-category-theory monad monads monoidal monoidal-category-theory morphism motives motivic-cohomology nforum nlab noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pages pasting philosophy physics pro-object probability probability-theory quantization quantum quantum-field quantum-field-theory quantum-mechanics quantum-physics quantum-theory question representation representation-theory riemannian-geometry scheme schemes set set-theory sheaf sheaves simplicial space spin-geometry stable-homotopy-theory stack string string-theory superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory tqft type type-theory universal variational-calculus

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Welcome to nForum
If you want to take part in these discussions either sign in now (if you have an account), apply for one now (if you don't).
    • CommentRowNumber1.
    • CommentAuthorzskoda
    • CommentTimeMay 5th 2021
    • (edited May 5th 2021)

    A polygonal line is the union of segments A 0A 1¯\overline{A_0 A_1}, A 1A 2¯,,A n1,A n¯\overline{A_1 A_2}, \ldots, \overline{A_{n-1},A_n} where nNn\in\mathbf{N} and (A 0,A 1,,A n)(A_0,A_1,\ldots, A_n) is an (n+1)(n+1)-tuple of consecutively distinct points in an affine plane or in a kk-dimensional affine space. A polygonal line is called closed if A 0=A nA_0 = A_n (regarding that consecutive points are distinct that implies that n2n\geq 2). A closed polygonal line is non-self-intersecting if for any k<lk \lt l, 0k<ln10\leq k\lt l \leq n-1, A kA k+1¯A lA l+1¯=\overline{A_k A_{k+1}}\cap \overline{A_l A_{l+1}}= \emptyset except in the case (k,l)=(0,n1)(k,l) = (0,n-1) when the intersection is {A 0}\{A_0\}. A simple (planar) polygonal line is a closed non-self-intersecting line which is in its entirety contained in some affine 2-plane. By Jordan’s curve theorem, a complement of any simple polygonal line within its 2-plane has two components, one bounded and one unbounded. A polygon is a set in an affine kk-space (k2k\geq 2) which can be represented as a simple closed planar polygonal line union the bounded component of its complement within its 2-plane. The bounded and unbounded components of the complement of the corresponding polygonal line in its 2-plane are called the interior and the exterior of the polygon. For fixed nn we also say nn-gon, and the points A 1,,A nA_1,\ldots, A_n are called the vertices of the polygon, the segments A nA 1¯\overline{A_n A_1}, A 1A 2¯,,A n1,A n¯\overline{A_1 A_2}, \ldots, \overline{A_{n-1},A_n} are called the edges or the sides of the polygon. A 3-gon is also called a triangle and it may be also defined as the smallest convex set containing 3 non-colinear points called the vertices of the triangle. nn-gons for n4n\geq 4 may be convex or nonconvex.

    In other geometries instead of segments we may consider segments on geodesical lines, so we can talk about nn-gones in spherical and non-Euclidean geometries. For some related ideas see polyhedron.

    diff, v7, current

    • CommentRowNumber2.
    • CommentAuthorzskoda
    • CommentTimeMay 5th 2021
    • (edited May 5th 2021)

    I added some discussion pointing out that it is not trivial to avoid the (polygonal case of) Jordan’s curve theorem to discuss the interior.

    diff, v7, current

    P.S. An interesting reference on the polygonal case of the Jordan’s curve theorem is

    • CommentRowNumber3.
    • CommentAuthorUrs
    • CommentTimeMay 6th 2021

    added the link to Jordan’s curve theorem

    diff, v8, current