Search results
Results from the WOW.Com Content Network
One diagonal crosses the midpoint of the other diagonal at a right angle, forming its perpendicular bisector. [9] (In the concave case, the line through one of the diagonals bisects the other.) One diagonal is a line of symmetry. It divides the quadrilateral into two congruent triangles that are mirror images of each other. [7]
It is always possible to partition a concave polygon into a set of convex polygons. A polynomial-time algorithm for finding a decomposition into as few convex polygons as possible is described by Chazelle & Dobkin (1985). [5] A triangle can never be concave, but there exist concave polygons with n sides for any n > 3.
A general approach that works for non-simple polygons as well would be to choose a line not parallel to any of the sides of the polygon and draw a line parallel to this one through each of the vertices of the polygon. This will divide the polygon into triangles and trapezoids, which in turn can be converted into triangles.
The edges or panels of the arrangement are one-dimensional regions belonging to a single line. They are the open line segments and open infinite rays into which each line is partitioned by its crossing points with the other lines. That is, if one of the lines is cut by all the other lines, these are the connected components of its uncut points. [1]
A polygon ear. One way to triangulate a simple polygon is based on the two ears theorem, as the fact that any simple polygon with at least 4 vertices without holes has at least two "ears", which are triangles with two sides being the edges of the polygon and the third one completely inside it. [5]
This is a list of two-dimensional geometric shapes in Euclidean and other geometries. For mathematical objects in more dimensions, see list of mathematical shapes. For a broader scope, see list of shapes.
In geometry, a bigon, [1] digon, or a 2-gon, is a polygon with two sides and two vertices.Its construction is degenerate in a Euclidean plane because either the two sides would coincide or one or both would have to be curved; however, it can be easily visualised in elliptic space.
Polygons with only one concave vertex can always be fan triangulated, as long as the diagonals are drawn from the concave vertex. It can be known if a polygon can be fan triangulated by solving the Art gallery problem, in order to determine whether there is at least one vertex that is visible from every point in the polygon.