TOPICS
Search

Search Results for ""


2621 - 2630 of 13135 for Computational GeometrySearch Results
In Euclidean space R^3, the curve that minimizes the distance between two points is clearly a straight line segment. This can be shown mathematically as follows using ...
In elliptic n-space, the flat pole of an (n-1)-flat is a point located an arc length of pi/2 radians distant from each point of the (n-1)-flat. For an n-dimensional spherical ...
A polar zonohedron is a convex zonohedron derived from the star which joins opposite vertices of any right n-gonal prism (for n even) or antiprism (for n odd). The faces of ...
A class of map projections in which the parallels are represented by a system of non-concentric circular arcs with centers lying on the straight line representing the central ...
A polygonal diagonal is a line segment connecting two nonadjacent polygon vertices of a polygon. The number of ways a fixed convex n-gon can be divided into triangles by ...
The geometric centroid of a polyhedron composed of N triangular faces with vertices (a_i,b_i,c_i) can be computed using the curl theorem as x^_ = ...
The diagonal of a polyhedron is any line segment connecting two nonadjacent vertices of the polyhedron. Any polyhedron having no diagonals must have a skeleton which is a ...
The volume of a polyhedron composed of N triangular faces with vertices (a_i,b_i,c_i) can be computed using the curl theorem as V=1/6sum_(i=1)^Na_i·n_i, where the normal n_i ...
There are no tilings of the equilateral triangle of side length 7 by all the polyhexes of order n=4. There are nine distinct solutions of all the polyhexes of order n=4 which ...
Triangle centers with triangle center functions of the form alpha=a^n are called nth power points. These points lie along the trilinear curve a^n:b^n:c^n that passes through ...
1 ... 260|261|262|263|264|265|266 ... 1314 Previous Next

...