scientific article; zbMATH DE number 1234822
The author discusses the possible numbers of selfintersection points of an \(n\)-gon in the plane. As he points out, these results are old and several times rediscovered; it is his aim to trace the history of this problem, the published proofs, and the errors in these proofs to `(\(\ldots\)) serve as a warning about the frequency with which writers practice sloppy thinking -- and so sometimes establish fallacies as facts'. The correct answer is that the maximum number of selfintersection points of an \(n\)-gon in the plane is \({1\over 2}n(n-3)\) for odd \(n\), and \({1\over 2}n(n-4) +1\) for even \(n\), and all numbers up to the maximum are realizable, with the only exception of \({1\over 2} n (n-3) -1\) for odd \(n\).
- scientific article; zbMATH DE number 1290180
- scientific article; zbMATH DE number 124790
- Self-affine convex polygons
- Selfintersection of composite curves and surfaces
- Self-dual polygons and self-dual curves
- scientific article; zbMATH DE number 124531
- Self-intersections of curves on surfaces
- Self-intersecting filling curves on surfaces
- Combinatorial Properties of Self-Overlapping Curves and Interior Boundaries
- Combinatorial properties of self-overlapping curves and interior boundaries
- An almost optimal bound on the number of intersections of two simple polygons
- scientific article; zbMATH DE number 1290180 (Why is no real title available?)
- scientific article; zbMATH DE number 2111129 (Why is no real title available?)
- Selfintersections of a bézier bicubic surface
- scientific article; zbMATH DE number 5264882 (Why is no real title available?)
- On the number of intersections of two polygons.
- An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons.
- Combinatorial Properties of Self-Overlapping Curves and Interior Boundaries
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221561)
