Search results
Results from the WOW.Com Content Network
The converse is the Braikenridge–Maclaurin theorem, named for 18th-century British mathematicians William Braikenridge and Colin Maclaurin , which states that if the three intersection points of the three pairs of lines through opposite sides of a hexagon lie on a line, then the six vertices of the hexagon lie on a conic; the conic may be ...
A principal diagonal of a hexagon is a diagonal which divides the hexagon into quadrilaterals. In any convex equilateral hexagon (one with all sides equal) with common side a, there exists [11]: p.184, #286.3 a principal diagonal d 1 such that and a principal diagonal d 2 such that
Euler's quadrilateral theorem or Euler's law on quadrilaterals, named after Leonhard Euler (1707–1783), describes a relation between the sides of a convex quadrilateral and its diagonals. It is a generalisation of the parallelogram law which in turn can be seen as generalisation of the Pythagorean theorem .
The diagonals of a cube with side length 1. AC' (shown in blue) is a space diagonal with length , while AC (shown in red) is a face diagonal and has length .. In geometry, a diagonal is a line segment joining two vertices of a polygon or polyhedron, when those vertices are not on the same edge.
Consider, for example, five tangent lines to a parabola. These may be considered sides of a hexagon whose sixth side is the line at infinity, but there is no line at infinity in the affine plane. In two instances, a line from a (non-existent) vertex to the opposite vertex would be a line parallel to one of the five tangent lines. Brianchon's ...
For a cyclic orthodiagonal quadrilateral (one that can be inscribed in a circle), suppose the intersection of the diagonals divides one diagonal into segments of lengths p 1 and p 2 and divides the other diagonal into segments of lengths q 1 and q 2. Then [10] (the first equality is Proposition 11 in Archimedes' Book of Lemmas)
The visibility graph of a simple polygon connects its vertices by edges representing the sides and diagonals of the polygon. [3] It always contains a Hamiltonian cycle, formed by the polygon sides. The computational complexity of reconstructing a polygon that has a given graph as its visibility graph, with a specified Hamiltonian cycle as its ...
The cube contains a skew regular hexagon, seen as 6 red edges zig-zagging between two planes perpendicular to the cube's diagonal axis. The zig-zagging side edges of a n - antiprism represent a regular skew 2 n -gon, as shown in this 17-gonal antiprism.