Arc length is the distance between two points along a section of a curve.
Determining the length of an irregular arc segment by approximating the arc segment as connected (straight) line segments is also called curve rectification. A rectifiable curve has a finite number of segments in its rectification (so the curve has a finite length).
If a curve can be parameterized as an injective and continuously differentiable function (i.e., the derivative is a continuous function) , then the curve is rectifiable (i.e., it has a finite length).
The advent of infinitesimal calculus led to a general formula that provides closed-form solutions in some cases.
A curve in the plane can be approximated by connecting a finite number of points on the curve using (straight) line segments to create a polygonal path. Since it is straightforward to calculate the length of each linear segment (using the Pythagorean theorem in Euclidean space, for example), the total length of the approximation can be found by summation of the lengths of each linear segment; that approximation is known as the (cumulative) chordal distance.
If the curve is not already a polygonal path, then using a progressively larger number of line segments of smaller lengths will result in better curve length approximations. Such a curve length determination by approximating the curve as connected (straight) line segments is called rectification of a curve. The lengths of the successive approximations will not decrease and may keep increasing indefinitely, but for smooth curves they will tend to a finite limit as the lengths of the segments get arbitrarily small.
For some curves, there is a smallest number that is an upper bound on the length of all polygonal approximations (rectification). These curves are called and the is defined as the number .
A signed arc length can be defined to convey a sense of orientation or "direction" with respect to a reference point taken as origin in the curve (see also: curve orientation and signed distance).
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
In mathematics, a manifold is a topological space that locally resembles Euclidean space near each point. More precisely, an -dimensional manifold, or -manifold for short, is a topological space with the property that each point has a neighborhood that is homeomorphic to an open subset of -dimensional Euclidean space. One-dimensional manifolds include lines and circles, but not lemniscates. Two-dimensional manifolds are also called surfaces. Examples include the plane, the sphere, and the torus, and also the Klein bottle and real projective plane.
The Archimedean spiral (also known as the arithmetic spiral) is a spiral named after the 3rd-century BC Greek mathematician Archimedes. It is the locus corresponding to the locations over time of a point moving away from a fixed point with a constant speed along a line that rotates with constant angular velocity. Equivalently, in polar coordinates (r, θ) it can be described by the equation with real numbers a and b.
In mathematics, an involute (also known as an evolvent) is a particular type of curve that is dependent on another shape or curve. An involute of a curve is the locus of a point on a piece of taut string as the string is either unwrapped from or wrapped around the curve. The evolute of an involute is the original curve. It is generalized by the roulette family of curves. That is, the involutes of a curve are the roulettes of the curve generated by a straight line.
Given a hyperelliptic hyperbolic surface S of genus g >= 2, we find bounds on the lengths of homologically independent loops on S. As a consequence, we show that for any lambda is an element of (0, 1) there exists a constant N(lambda) such that every such ...
Region extraction is a very common task in both Computer Science and Engineering with several applications in object recognition and motion analysis, among others. Most of the literature focuses on regions delimited by straight lines, often in the special ...
2023
We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...