Isothetic (from Greek roots: "" for "equal, same, similar" and "thetos" for position, placement) may refer to one of the following.
*In
*In
*In
Wikimedia Foundation. 2010.
Isothetic polygon — An isothetic polygon is a polygon whose alternate sides belong to two parametric families of straight lines which are pencils of lines with centers at two points (possibly in the infinity). The most well known example of isothetic polygons are… … Wikipedia
Largest empty rectangle — In computational geometry, the largest empty rectangle problem,[1] maximal empty rectangle problem[2] or maximum empty rectangle problem,[3] is the problem of finding a rectangle of maximal size to be placed among obstacles in the plane. There… … Wikipedia
List of combinatorial computational geometry topics — enumerates the topics of computational geometry that states problems in terms of geometric objects as discrete entities and hence the methods of their solution are mostly theories and algorithms of combinatorial character.See List of numerical… … Wikipedia
List of mathematics articles (I) — NOTOC Ia IA automorphism ICER Icosagon Icosahedral 120 cell Icosahedral prism Icosahedral symmetry Icosahedron Icosian Calculus Icosian game Icosidodecadodecahedron Icosidodecahedron Icositetrachoric honeycomb Icositruncated dodecadodecahedron… … Wikipedia
List of books in computational geometry — This is a list of books in computational geometry. There are two major, largely nonoverlapping categories: *Combinatorial computational geometry, which deals with collections of discrete objects or defined in discrete terms: points, lines,… … Wikipedia
Rectilinear polygon — Some examples of rectilinear polygons A rectilinear polygon is a polygon all of whose edges meet at right angles. Thus the interior angle at each vertex is either 90° or 270°. Rectilinear polygons are a special case of isothetic polygons. In many … Wikipedia
Constraint graph (layout) — In some tasks of integrated circuit layout design a necessity arises to optimize placement of non overlapping objects in the plane. In general this problem is extremely hard, and to tackle it with computer algorithms, certain assumptions are made … Wikipedia
