Ads
related to: geometry problems rectangle
Search results
Results from the WOW.Com Content Network
Packing different rectangles in a rectangle: The problem of packing multiple rectangles of varying widths and heights in an enclosing rectangle of minimum area (but with no boundaries on the enclosing rectangle's width or height) has an important application in combining images into a single larger image. A web page that loads a single larger ...
In mathematics, the moving sofa problem or sofa problem is a two-dimensional idealization of real-life furniture-moving problems and asks for the rigid two-dimensional shape of the largest area that can be maneuvered through an L-shaped planar region with legs of unit width. [1] The area thus obtained is referred to as the sofa constant.
The missing square puzzle is an optical illusion used in mathematics classes to help students reason about geometrical figures; or rather to teach them not to reason using figures, but to use only textual descriptions and the axioms of geometry. It depicts two arrangements made of similar shapes in slightly different configurations.
In computational geometry, the largest empty rectangle problem, [2] maximal empty rectangle problem [3] or maximum empty rectangle problem, [4] is the problem of finding a rectangle of maximal size to be placed among obstacles in the plane. There are a number of variants of the problem, depending on the particularities of this generic ...
In Euclidean plane geometry, a rectangle is a rectilinear convex polygon or a quadrilateral with four right angles. It can also be defined as: an equiangular quadrilateral, since equiangular means that all of its angles are equal (360°/4 = 90°); or a parallelogram containing a right angle. A rectangle with four sides of equal length is a square.
In computational geometry, Klee's measure problem is the problem of determining how efficiently the measure of a union of (multidimensional) rectangular ranges can be computed. Here, a d -dimensional rectangular range is defined to be a Cartesian product of d intervals of real numbers , which is a subset of R d .
The inscribed square problem, also known as the square peg problem or the Toeplitz' conjecture, is an unsolved question in geometry: Does every plane simple closed curve contain all four vertices of some square? This is true if the curve is convex or piecewise smooth and in other special cases. The problem was proposed by Otto Toeplitz in 1911. [1]
IM 67118, also known as Db 2-146, is an Old Babylonian clay tablet in the collection of the Iraq Museum that contains the solution to a problem in plane geometry concerning a rectangle with given area and diagonal.
Ads
related to: geometry problems rectangle