Search Results for ""
1301 - 1310 of 13135 for Computational GeometrySearch Results
A concave polygon is a polygon that is not convex. A simple polygon is concave iff at least one of its internal angles is greater than 180 degrees. An example of a non-simple ...
A concho-spiral, also known as a conchospiral, is a space curve with parametric equations r = mu^ua (1) theta = u (2) z = mu^uc, (3) where mu, a, and c are fixed parameters. ...
Two or more lines which intersect in a point are said to concur.
Two or more lines are said to be concurrent if they intersect in a single point. Two lines concur if their trilinear coordinates satisfy |l_1 m_1 n_1; l_2 m_2 n_2; l_3 m_3 ...
Confocal conics are conic sections sharing a common focus. Any two confocal central conics are orthogonal (Ogilvy 1990, p. 77).
A map projection with transformation equations x = rhosintheta (1) y = rho_0-rhocostheta, (2) where rho = (G-phi) (3) theta = n(lambda-lambda_0) (4) rho_0 = (G-phi_0) (5) G = ...
The conical spiral with angular frequency a on a cone of height h and radius r is a space curve given by the parametric equations x = (h-z)/hrcos(az) (1) y = (h-z)/hrsin(az) ...
Construct a 5×5×5 cube from thirteen 1×2×4 blocks, one 2×2×2 block, one 1×2×2, and three 1×1×3 blocks.
The first corona of a tile is the set of all tiles that have a common boundary point with that tile (including the original tile itself). The second corona is the set of ...
The closed cyclic self-intersecting hexagon formed by joining the adjacent antiparallels in the construction of the cosine circle. The sides of this hexagon have the property ...
...