|
Gauss's Area Formula
The shoelace formula, shoelace algorithm, or shoelace method (also known as Gauss's area formula and the surveyor's formula) is a mathematical algorithm to determine the area of a simple polygon whose vertices are described by their Cartesian coordinates in the plane. It is called the shoelace formula because of the constant cross-multiplying for the coordinates making up the polygon, like threading shoelaces. It has applications in surveying and forestry,Hans Pretzsch, Forest Dynamics, Growth and Yield: From Measurement to Model', Springer, 2009, , p. 232. among other areas. The formula was described by Albrecht Ludwig Friedrich Meister (1724–1788) in 1769 and is based on the trapezoid formula which was described by Carl Friedrich Gauss and C.G.J. Jacobi. The triangle form of the area formula can be considered to be a special case of Green's theorem. The area formula can also be applied to self-overlapping polygons since the meaning of area is still clear even though self- ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triangle Area
A triangle is a polygon with three edges and three vertices. It is one of the basic shapes in geometry. A triangle with vertices ''A'', ''B'', and ''C'' is denoted \triangle ABC. In Euclidean geometry, any three points, when non-collinear, determine a unique triangle and simultaneously, a unique plane (i.e. a two-dimensional Euclidean space). In other words, there is only one plane that contains that triangle, and every triangle is contained in some plane. If the entire geometry is only the Euclidean plane, there is only one plane and all triangles are contained in it; however, in higher-dimensional Euclidean spaces, this is no longer true. This article is about triangles in Euclidean geometry, and in particular, the Euclidean plane, except where otherwise noted. Types of triangle The terminology for categorizing triangles is more than two thousand years old, having been defined on the very first page of Euclid's Elements. The names used for modern classification are eit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Divergence Theorem
In vector calculus, the divergence theorem, also known as Gauss's theorem or Ostrogradsky's theorem, reprinted in is a theorem which relates the '' flux'' of a vector field through a closed surface to the ''divergence'' of the field in the volume enclosed. More precisely, the divergence theorem states that the surface integral of a vector field over a closed surface, which is called the "flux" through the surface, is equal to the volume integral of the divergence over the region inside the surface. Intuitively, it states that "the sum of all sources of the field in a region (with sinks regarded as negative sources) gives the net flux out of the region". The divergence theorem is an important result for the mathematics of physics and engineering, particularly in electrostatics and fluid dynamics. In these fields, it is usually applied in three dimensions. However, it generalizes to any number of dimensions. In one dimension, it is equivalent to integration by parts. In t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tetrahedron
In geometry, a tetrahedron (plural: tetrahedra or tetrahedrons), also known as a triangular pyramid, is a polyhedron composed of four triangular faces, six straight edges, and four vertex corners. The tetrahedron is the simplest of all the ordinary convex polyhedra and the only one that has fewer than 5 faces. The tetrahedron is the three-dimensional case of the more general concept of a Euclidean simplex, and may thus also be called a 3-simplex. The tetrahedron is one kind of pyramid, which is a polyhedron with a flat polygon base and triangular faces connecting the base to a common point. In the case of a tetrahedron the base is a triangle (any of the four faces can be considered the base), so a tetrahedron is also known as a "triangular pyramid". Like all convex polyhedra, a tetrahedron can be folded from a single sheet of paper. It has two such nets. For any tetrahedron there exists a sphere (called the circumsphere) on which all four vertices lie, and anot ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Signed Volume
In geometry and algebra, the triple product is a product of three 3- dimensional vectors, usually Euclidean vectors. The name "triple product" is used for two different products, the scalar-valued scalar triple product and, less often, the vector-valued vector triple product. Scalar triple product The scalar triple product (also called the mixed product, box product, or triple scalar product) is defined as the dot product of one of the vectors with the cross product of the other two. Geometric interpretation Geometrically, the scalar triple product : \mathbf\cdot(\mathbf\times \mathbf) is the (signed) volume of the parallelepiped defined by the three vectors given. Here, the parentheses may be omitted without causing ambiguity, since the dot product cannot be evaluated first. If it were, it would leave the cross product of a scalar and a vector, which is not defined. Properties * The scalar triple product is unchanged under a circular shift of its three operands (a, b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polygon Mesh
In 3D computer graphics and solid modeling, a polygon mesh is a collection of , s and s that defines the shape of a polyhedral object. The faces usually consist of triangles ( triangle mesh), quadrilaterals (quads), or other simple convex polygons (n-gons), since this simplifies rendering, but may also be more generally composed of concave polygons, or even polygons with holes. The study of polygon meshes is a large sub-field of computer graphics (specifically 3D computer graphics) and geometric modeling. Different representations of polygon meshes are used for different applications and goals. The variety of operations performed on meshes may include: Boolean logic (Constructive solid geometry), smoothing, simplification, and many others. Algorithms also exist for ray tracing, collision detection, and rigid-body dynamics with polygon meshes. If the mesh's edges are rendered instead of the faces, then the model becomes a wireframe model. Volumetric meshes are dis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triangulation (geometry)
In geometry, a triangulation is a subdivision of a planar object into triangles, and by extension the subdivision of a higher-dimension geometric object into simplices. Triangulations of a three-dimensional volume would involve subdividing it into tetrahedra packed together. In most instances, the triangles of a triangulation are required to meet edge-to-edge and vertex-to-vertex. Types Different types of triangulations may be defined, depending both on what geometric object is to be subdivided and on how the subdivision is determined. * A triangulation T of \mathbb^d is a subdivision of \mathbb^d into d-dimensional simplices such that any two simplices in T intersect in a common face (a simplex of any lower dimension) or not at all, and any bounded set in \mathbb^d intersects only finitely many simplices in T. That is, it is a locally finite simplicial complex that covers the entire space. * A point-set triangulation, i.e., a triangulation of a discrete set of points \mathcal ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polyhedron
In geometry, a polyhedron (plural polyhedra or polyhedrons; ) is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices. A convex polyhedron is the convex hull of finitely many points, not all on the same plane. Cubes and pyramids are examples of convex polyhedra. A polyhedron is a 3-dimensional example of a polytope, a more general concept in any number of dimensions. Definition Convex polyhedra are well-defined, with several equivalent standard definitions. However, the formal mathematical definition of polyhedra that are not required to be convex has been problematic. Many definitions of "polyhedron" have been given within particular contexts,. some more rigorous than others, and there is not universal agreement over which of these to choose. Some of these definitions exclude shapes that have often been counted as polyhedra (such as the self-crossing polyhedra) or include shapes that are often not considered as valid po ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hypersurface
In geometry, a hypersurface is a generalization of the concepts of hyperplane, plane curve, and surface. A hypersurface is a manifold or an algebraic variety of dimension , which is embedded in an ambient space of dimension , generally a Euclidean space, an affine space or a projective space. Hypersurfaces share, with surfaces in a three-dimensional space, the property of being defined by a single implicit equation, at least locally (near every point), and sometimes globally. A hypersurface in a (Euclidean, affine, or projective) space of dimension two is a plane curve. In a space of dimension three, it is a surface. For example, the equation :x_1^2+x_2^2+\cdots+x_n^2-1=0 defines an algebraic hypersurface of dimension in the Euclidean space of dimension . This hypersurface is also a smooth manifold, and is called a hypersphere or an -sphere. Smooth hypersurface A hypersurface that is a smooth manifold is called a ''smooth hypersurface''. In , a smooth hypersurface is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polytope
In elementary geometry, a polytope is a geometric object with flat sides ('' faces''). Polytopes are the generalization of three-dimensional polyhedra to any number of dimensions. Polytopes may exist in any general number of dimensions as an -dimensional polytope or -polytope. For example, a two-dimensional polygon is a 2-polytope and a three-dimensional polyhedron is a 3-polytope. In this context, "flat sides" means that the sides of a -polytope consist of -polytopes that may have -polytopes in common. Some theories further generalize the idea to include such objects as unbounded apeirotopes and tessellations, decompositions or tilings of curved manifolds including spherical polyhedra, and set-theoretic abstract polytopes. Polytopes of more than three dimensions were first discovered by Ludwig Schläfli before 1853, who called such a figure a polyschem. The German term ''polytop'' was coined by the mathematician Reinhold Hoppe, and was introduced to English mathematician ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Projected Area
Projected area is the two dimensional area measurement of a three-dimensional object by projecting its shape on to an arbitrary plane. This is often used in mechanical engineering and architectural engineering related fields, specifically hardness testing, axial stress, wind pressures, and terminal velocity. The geometrical definition of a projected area is: "the rectilinear parallel projection In three-dimensional geometry, a parallel projection (or axonometric projection) is a projection of an object in three-dimensional space onto a fixed plane, known as the '' projection plane'' or ''image plane'', where the '' rays'', known as ' ... of a surface of any shape onto a plane". This translates into the equation: A_\text = \int_ \cos \, dA where A is the original area, and \beta is the angle between the normal to the local plane and the line of sight to the surface A. For basic shapes the results are listed in the table below. [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vector Area
In 3-dimensional geometry and vector calculus, an area vector is a vector combining an area quantity with a direction, thus representing an ''oriented area'' in three dimensions. Every bounded surface in three dimensions can be associated with a unique area vector called its vector area. It is equal to the surface integral of the surface normal, and distinct from the usual ( scalar) surface area. Vector area can be seen as the three dimensional generalization of signed area in two dimensions. Definition For a finite planar surface of scalar area and unit normal , the vector area is defined as the unit normal scaled by the area: \mathbf = \mathbfS For an orientable surface composed of a set of flat facet areas, the vector area of the surface is given by \mathbf = \sum_i \mathbf_i S_i where is the unit normal vector to the area . For bounded, oriented curved surfaces that are sufficiently well-behaved, we can still define vector area. First, we split the surface into ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Tetrahedron")
