Signed Distance
   HOME
*



picture info

Signed Distance
In mathematics and its applications, the signed distance function (or oriented distance function) is the orthogonal distance of a given point ''x'' to the boundary of a set Ω in a metric space, with the sign determined by whether or not ''x'' is in the interior of Ω. The function has positive values at points ''x'' inside Ω, it decreases in value as ''x'' approaches the boundary of Ω where the signed distance function is zero, and it takes negative values outside of Ω. However, the alternative convention is also sometimes taken instead (i.e., negative inside Ω and positive outside). Definition If Ω is a subset of a metric space ''X'' with metric ''d'', then the ''signed distance function'' ''f'' is defined by :f(x) = \begin d(x, \partial \Omega) & \mbox\, x \in \Omega \\ -d(x, \partial \Omega) & \mbox\, x \in \Omega^c \end where \partial \Omega denotes the boundary of For any : d(x, \partial \Omega) := \inf_d(x, y) where denotes the infimum. Properties in Eu ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Signed Distance1
Signing may refer to: * Using sign language * Signature, placing one's name on a document * Signature (other) A signature is a hand-written, possibly stylized, version of someone's name, which may be used to confirm the person's identity. The writer of a signature is a signatory or signer. Signature or signatory may also refer to: Businesses and organ ... * Manual communication, signing as a form of communication using the hands in place of the voice * Digital signature, signing as a method of authenticating digital information See also * Wikipedia:Sign your posts on talk pages, the Wikipedia policy of signing Talk pages {{disambig ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Gradient
In vector calculus, the gradient of a scalar-valued differentiable function of several variables is the vector field (or vector-valued function) \nabla f whose value at a point p is the "direction and rate of fastest increase". If the gradient of a function is non-zero at a point , the direction of the gradient is the direction in which the function increases most quickly from , and the magnitude of the gradient is the rate of increase in that direction, the greatest absolute directional derivative. Further, a point where the gradient is the zero vector is known as a stationary point. The gradient thus plays a fundamental role in optimization theory, where it is used to maximize a function by gradient ascent. In coordinate-free terms, the gradient of a function f(\bf) may be defined by: :df=\nabla f \cdot d\bf where ''df'' is the total infinitesimal change in ''f'' for an infinitesimal displacement d\bf, and is seen to be maximal when d\bf is in the direction of the gradi ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Level-set Method
Level-set methods (LSM) are a conceptual framework for using level sets as a tool for numerical analysis of surfaces and shapes. The advantage of the level-set model is that one can perform numerical computations involving curves and surfaces on a fixed Cartesian grid without having to parameterize these objects (this is called the ''Eulerian approach''). Also, the level-set method makes it very easy to follow shapes that change topology, for example, when a shape splits in two, develops holes, or the reverse of these operations. All these make the level-set method a great tool for modeling time-varying objects, like inflation of an airbag, or a drop of oil floating in water. The figure on the right illustrates several important ideas about the level-set method. In the upper-left corner we see a shape; that is, a bounded region with a well-behaved boundary. Below it, the red surface is the graph of a level set function \varphi determining this shape, and the flat blue region r ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Zhao Hongkai
Hongkai Zhao is a Chinese mathematician and Ruth F. DeVarney Distinguished Professor of Mathematics at Duke University. He was formerly the Chancellor's Professor in the Department of Mathematics at the University of California, Irvine. He is known for his work in scientific computing, imaging and numerical analysis, such as the fast sweeping method for Hamilton-Jacobi equation and numerical methods for moving interface problems. Zhao had obtained his Bachelor of Science degree in the applied mathematics from the Peking University in 1990 and two years later got his Master's in the same field from the University of Southern California. From 1992 to 1996 he attended University of California, Los Angeles where he got his Ph.D. in mathematics. From 1996 to 1998 Zhao was a Gábor Szegő Assistant Professor at the Department of Mathematics of Stanford University and then got promoted to Research Associate which he kept till 1999. He has been at the University of California, Irvine si ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Fast Sweeping Method
In applied mathematics, the fast sweeping method is a numerical method for solving boundary value problems of the Eikonal equation. : , \nabla u(\mathbf), = \frac 1 \text \mathbf \in \Omega : u(\mathbf) = 0 \text \mathbf \in \partial \Omega where \Omega is an open set in \mathbb^n, f(\mathbf) is a function with positive values, \partial \Omega is a well-behaved boundary of the open set and , \cdot, is the Euclidean norm. The fast sweeping method is an iterative method which uses upwind difference for discretization and uses Gauss–Seidel iterations with alternating sweeping ordering to solve the discretized Eikonal equation on a rectangular grid. The origins of this approach lie in control theory. Although fast sweeping methods have existed in control theory, it was first proposed for Eikonal equations by Hongkai Zhao, an applied mathematician at the University of California, Irvine The University of California, Irvine (UCI or UC Irvine) is a public land-grant ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Fast Marching Method
The fast marching methodJ.A. Sethian. A Fast Marching Level Set Method for Monotonically Advancing Fronts, Proc. Natl. Acad. Sci., 93, 4, pp.1591--1595, 1996/ref> is a numerical method created by James Sethian for solving boundary value problems of the Eikonal equation: : , \nabla u(x), =1/f(x) \text x \in \Omega : u(x) = 0 \text x \in \partial\Omega Typically, such a problem describes the evolution of a closed surface as a function of time u with speed f in the normal direction at a point x on the propagating surface. The speed function is specified, and the time at which the contour crosses a point x is obtained by solving the equation. Alternatively, u(x) can be thought of as the minimum amount of time it would take to reach \partial\Omega starting from the point x. The fast marching method takes advantage of this optimal control interpretation of the problem in order to build a solution outwards starting from the "known information", i.e. the boundary values. The algorithm ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Algorithm
In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific Computational problem, problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can perform automated deductions (referred to as automated reasoning) and use mathematical and logical tests to divert the code execution through various routes (referred to as automated decision-making). Using human characteristics as descriptors of machines in metaphorical ways was already practiced by Alan Turing with terms such as "memory", "search" and "stimulus". In contrast, a Heuristic (computer science), heuristic is an approach to problem solving that may not be fully specified or may not guarantee correct or optimal results, especially in problem domains where there is no well-defined correct or optimal result. As an effective method, an algorithm ca ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Surface Integral
In mathematics, particularly multivariable calculus, a surface integral is a generalization of multiple integrals to integration over surfaces. It can be thought of as the double integral analogue of the line integral. Given a surface, one may integrate a scalar field (that is, a function of position which returns a scalar as a value) over the surface, or a vector field (that is, a function which returns a vector as value). If a region R is not flat, then it is called a ''surface'' as shown in the illustration. Surface integrals have applications in physics, particularly with the theories of classical electromagnetism. Surface integrals of scalar fields Assume that ''f'' is a scalar, vector, or tensor field defined on a surface ''S''. To find an explicit formula for the surface integral of ''f'' over ''S'', we need to parameterize ''S'' by defining a system of curvilinear coordinates on ''S'', like the latitude and longitude on a sphere. Let such a parameterization be ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Determinant
In mathematics, the determinant is a scalar value that is a function of the entries of a square matrix. It characterizes some properties of the matrix and the linear map represented by the matrix. In particular, the determinant is nonzero if and only if the matrix is invertible and the linear map represented by the matrix is an isomorphism. The determinant of a product of matrices is the product of their determinants (the preceding property is a corollary of this one). The determinant of a matrix is denoted , , or . The determinant of a matrix is :\begin a & b\\c & d \end=ad-bc, and the determinant of a matrix is : \begin a & b & c \\ d & e & f \\ g & h & i \end= aei + bfg + cdh - ceg - bdi - afh. The determinant of a matrix can be defined in several equivalent ways. Leibniz formula expresses the determinant as a sum of signed products of matrix entries such that each summand is the product of different entries, and the number of these summands is n!, the factorial of (t ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Absolutely Integrable Function
In mathematics, an absolutely integrable function is a function whose absolute value is integrable, meaning that the integral of the absolute value over the whole domain is finite. For a real-valued function, since \int , f(x), \, dx = \int f^+(x) \, dx + \int f^-(x) \, dx where f^+(x) = \max (f(x),0), \ \ \ f^-(x) = \max(-f(x),0), both \int f^+(x) \, dx and \int f^-(x) \, dx must be finite. In Lebesgue integration, this is exactly the requirement for any measurable function ''f'' to be considered integrable, with the integral then equaling \int f^+(x) \, dx - \int f^-(x) \, dx, so that in fact "absolutely integrable" means the same thing as "Lebesgue integrable" for measurable functions. The same thing goes for a complex-valued function. Let us define f^+(x) = \max(\Re f(x),0) f^-(x) = \max(-\Re f(x),0) f^(x) = \max(\Im f(x),0) f^(x) = \max(-\Im f(x),0) where \Re f(x) and \Im f(x) are the real and imaginary parts In mathematics, a complex number is an element of a number s ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Tubular Neighbourhood
In mathematics, a tubular neighborhood of a submanifold of a smooth manifold is an open set around it resembling the normal bundle. The idea behind a tubular neighborhood can be explained in a simple example. Consider a smooth curve in the plane without self-intersections. On each point on the curve draw a line perpendicular to the curve. Unless the curve is straight, these lines will intersect among themselves in a rather complicated fashion. However, if one looks only in a narrow band around the curve, the portions of the lines in that band will not intersect, and will cover the entire band without gaps. This band is a tubular neighborhood. In general, let ''S'' be a submanifold of a manifold ''M'', and let ''N'' be the normal bundle of ''S'' in ''M''. Here ''S'' plays the role of the curve and ''M'' the role of the plane containing the curve. Consider the natural map :i : N_0 \to S which establishes a bijective correspondence between the zero section N_0 of ''N'' and the ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Differential Geometry Of Surfaces
In mathematics, the differential geometry of surfaces deals with the differential geometry of smooth surfaces with various additional structures, most often, a Riemannian metric. Surfaces have been extensively studied from various perspectives: ''extrinsically'', relating to their embedding in Euclidean space and ''intrinsically'', reflecting their properties determined solely by the distance within the surface as measured along curves on the surface. One of the fundamental concepts investigated is the Gaussian curvature, first studied in depth by Carl Friedrich Gauss, who showed that curvature was an intrinsic property of a surface, independent of its isometric embedding in Euclidean space. Surfaces naturally arise as graphs of functions of a pair of variables, and sometimes appear in parametric form or as loci associated to space curves. An important role in their study has been played by Lie groups (in the spirit of the Erlangen program), namely the symmetry groups of ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]