Log in | Register
User Group Management

The AIM@SHAPE Glossary

List of all terms

acquisition device
A system of sensors connected to a storage device (usually a PC), designed for acquiring data (e.g. Laser Scanner, Haptic Device).
acquisition planning
The design of the strategy for the data acquisition. For instance, it decides object/sensor position(s), number of acquisitions.
A part of an image segment.
algebraic curve/surface
A curve or surface which can, in addition, be described as the zero locus of a polynomial system.
See Registration.
alpha shape
It formalizes the instinctive concept of "shape" for a set of spatial points. The alpha shape is uniquely defined for a specify point set. When given a finite set of points S, and a real parameter alpha, the alpha shape of S is a polytope. This polytope neither have to be convex nor connected. When varying the number alpha over the real numbers, a family of shapes is generated displaying the intuitive concept of "rough versus "fine' shape. When alpha is sufficiently large, the alpha shape is identical to the convex hull. When decreasing alpha, the shape shrinks and progressively shows cavities. Such cavities may join to form holes. When alpha gets sufficiently small, the alpha shape is empty.
animation controller
Algorithms used to produce animations. The class specifies the inputs required for the algorithm to work and the outputs (usually animation sequences or specific joint values) it is capable to produce.
animation sequence
Pre-recorded animation sequences (key-frame animation, etc.). In general it contains the joint angle values and/or vertex displacements corresponding to the key animation frames. Different interpolation and codification methods can be used. Such sequences can be applied to one or many VH depending on the codification and technique being used.
The process of generating a function, a curve, or surface, that is close to given spatial constraints (typically point samples).
articulated character
3D animation object made of a geometric skin attached to an articulated skeleton. An articulated character animation is driven by skeleton animation and performed with Skeleton driven deformation.
articulated skeleton
See Control skeleton.
See skeleton joint.
asymptotic curve
The asymptotic curve on a surface is that along which the normal curvature vanishes.
behavioural animation
Methods for animating characters by specifying their behaviour. For Virtual Humans behavioural animation is expected to exhibit an autonomous believable anthropomorphic behaviour, where Virtual Humans perform specific actions under pre-specified conditions.
Surface connecting smoothly two 3D curves, with prescribed tangent planes along these curves.
blending graph
It is used for skeleton-based (or structural) implicit modelling. The vertices of this graph are the skeleton primitives. Two primitives are connected by an edge if they can blend their field contributions. The field at a space point P is then computed as the sum of the field from the primitive that contributes the most at P and the contributions from all its neighbouring primitives in the graph. The use of such a graph prevents unwanted blending.
body animation
Methods for animating the body of a Virtual Human. Body animation is usually performed with Skeleton Driven Deformations.
body pose
See Body posture.
body posture
Specification of joint values describing a virtual human body posture. A body posture can be defined using forward/inverse kinematics, forward/inverse dynamics or even motion capture.
boundary conditions
In a physical model simulation, they describe the physical conditions at the boundaries of the simulation region (e.g. force distribution, displacement, temperature, flows).
boundary representation (brep)
Geometric representation of objects defined in terms of the faces, edges and vertices which make up its boundary. The boundary of a three dimensional solid is a two dimensional surface, that is usually represented as a collection of faces. Usually, the segmentation of the surface into faces is performed so that the shape of each face has a compact mathematical representation, e.g. that the face lies on a single geometric surface. Faces, again, are often represented in terms of their boundary being a one-dimensional curve. Hence boundary models may be viewed as a hierarchy of models.
bounding box
A parallelepiped that completely contains the object. It is usually considered the minimal, i.e. the parallelepiped tangent to the object.
brand identity
The set of features, attributes, benefits, performance, quality, service support, and the values that a brand possesses. The brand can be viewed as a product, a personality, a set of values, and a position it occupies in people`s (customers) minds. Brand identity is everything the company wants the brand to be seen as.
See Boundary Representation.
See Boundary Representation.
b-spline curve/surface
General form of piecewise rational or polynomial parametric curve/surface, which is represented by control points, basis functions, and possibly, weighs.
butterfly scheme
An interpolating subdivision scheme for triangle meshes.
See Computer Aided Design.
Measuring the parameters appearing in the equations ruling the acquisition process of an acquisition device.
A lightproof box fitted with a lens though which the image of an object is recorded on a material sensitive to light.
See Computer Aided Styling.
case based reasoning (cbr)
The process of solving new problems based on the solutions of similar past problems. CBR starts with a set of cases or training examples; it forms generalizations of these examples, albeit implicit ones, by identifying commonalities between a retrieved case and the target problem.
catchment basin
The catchment basin of a minimum m on a surface described by a C2-differentiable function defined over a domain D in R2 is the locus of the points in D which are closer to m than to any other minimum according to the topographic distance.
catmull-clark scheme
A subdivision scheme for quad meshes generalizing the bivariate cubic spline.
See Case Based Reasoning.
See center-line skeleton.
center-line skeleton
The concept of center-line is strictly related to that of skeleton. Complex objects can be seen as the arrangement of tubular-like components, and abstracted to a collection of center-lines which split and join, following the object topology, and which form, actually, a skeleton. A center-line should satisfy the following requirements: centricity, connectivity and singularity.
See Computational Fluid Dynamics.
characteristic map
An 1-1 local map between the subdivision surface around an extraordinary vertex and the tangent plane at that vertex. The existence of the characteristic map guarantees C1 continuity of the subdivision surface at that vertex.
character line
Basic drawing lines needed to define or characterize an object in the styling phase. They are used to give specific impression/feeling when looking at the object (e.g. the object appears sweet/aggressive), or to define a common peculiar aspect among set of products, as a signature of the designer (e.g. Pininfarina vs. Giugiaro) or the construction company (e.g. Alfa Romeo vs. Peugeot). Most of the character lines are virtual (i.e. only perceived) lines, such as light or curvature lines.
clay modelling
Modelling with clay to produce (scaled or full size) physical models of a product for evaluation purposes. Different material can be used to create the physical prototypes, but clay is especially used in the automotive industry.
A process of dividing elements in a dataset into subgroups, by determining which of these elements are similar.
colour mapping
A colour-coded map is an application which associates to a scalar function value a specific colour by using a colour table.
Compression aims at storing a data set in a more compact way than the original data file. Two main approaches for data compression exist:
  • Reversible compression, where different packing and re-indexing techniques are use to represent the data with the fewest possible number of bytes without loosing information.
  • Non-reversible compression, techniques where information is lost and tolerances and other parameters describe which information is allowed to be lost.
    Which compression techniques to use depend to a large extent of the later use of the information. Information that is only to be used for visual purposes often allow for high compression rates as the human eye most often do not detect small errors without a detailed scrutiny of the image. Information to be used in downstream computations can be degraded by compression, as compression algorithms tends to insert false structure in a data set, e.g., thinning a polyline description of a circle, will make the circle resemble a rough polygon.
  • computational fluid dynamics
    The numerical simulation of fluid flows, such as the flow of air around a moving car or plane.
    computational mechanics
    Field of mechanics solving specific problems by simulation through numerical methods implemented on digital computers.
    computer aided design (cad)
    2D or 3D design software package or visualisation able to assist the product development process.
    computer aided styling (cas)
    3D surface design and evaluation software suitable for an accurate definition of the shape and aesthetics of a product.
    computer tomography scan device
    From the Greek words "to cut or section" (tomos) and "to write" (graphein), it is a method of separating interference from the area of interest by imaging cut sections of the object. Its main application is medicine (see DICOM as standard output shape).
    conceptual design
    Starting phase of the product development in which designers clarify the requirements for a product and define its functions, structure, shape, materials, interfaces, behaviour and appearance.
    concurrent engineering
    Management/operational approach which aims at improving product design, production, operation, and maintenance by developing environments in which personnel from all disciplines (design, marketing, production engineering, process planning, and support) work together and share data throughout all phases of the product life cycle.
    conforming simplicial mesh
    A conforming simplicial mesh is a simplical mesh such that the intersection of any two simplices is either empty or is a simplex belonging to both simplices. A simplicial complex such that any k-simplex with k
    conformity set up
    Set of operators generating a conform model through healing treatments.
    connected component
    Part of an object such that the path between any two point in that part lies within the same part.
    In geometric modelling, geometric condition that the model has to respect; for example, it can be a point, tangency or curvature constraint. More generally, any condition that a model has to respect according to some specific application purposes (from geometry, aesthetics, manufacturing, and so on).
    constructive solid geometry
    Geometric representation in which the model is defined as combinations of primitive sets by Boolean operators (union, intersection, subtraction).
    continuous levels-of-detail (lod) model
    Both progressive and variable-resolution LOD model are continuous models. Often, in the literature, the term continuous LOD models is used to indicate only variable- resolution LOD models.
    continuum mechanics
    Branch of computational mechanics studying bodies at the macroscopic level, using continuum models in which the microstructure is homogenized by phenomenological averages.
    One or a set of curves originated through intersection of a plane with the object.
    contour set
    Intersection curves between the surface and a family of parallel planes.
    contour tree
    The contour tree of a scalar field is the graph obtained by continuous contraction of each contour of (D, h) to a single point. It represents the relations between the connected components of the level sets of a scalar fields. Contour trees are special cases of the Reeb graphs.
    control point
    A point on a curve or surface that influence the shape in a region of the curve or surface. Control points are most frequently used for modelling of Bezier, B-spline and NURBS curves and surfaces, but the concept is not restricted to these. Sometimes control points are on the curve or surface they belong to, often control points are close to the curve or surface, but not close to the surface and influence the shape close to the point.
    control skeleton
    A connected set of segments, corresponding to limbs, and joints, corresponding to articulations.
    convolution surface
    It calculates the field value at P as the integral of the field contributions from each point of the skeleton. This results into smooth, bulge-free, surfaces for skeletons defined as graphs of branching curve and surfaces pieces.
    critical point
    A point p in R2 is a critical point of a C2-differentiable function defined over a domain D in R2 if and only if the gradient of f vanishes at p.
    critical point configuration graph (cpcg)
    It is defined for a Morse function f defined on the closure of a simply-connected open set in R2. It is a graph G in which the nodes represent the critical points of f and two nodes in G are connected by an arc in G if there exists an integral line that emanates from one critical point (node) and reaches the other.
    See Constructive Solid Geometry.
    ct scan device
    See Computer Tomography Scan Device.
    A concept from computer graphics used for the methods employed to sort not visible geometry sent to the graphics pipeline to avoid using computational resources on invisible parts of the objects displayed. Culling can both be performed on the CPU and by the graphics card.
    Let C be a curve and let P be a point on C. Let N be the normal at P and let O be the point on N which is the limit of where the normal to C at P` intersects N as P` tends to P. O is the centre of curvature at P and PO is the radius of curvature at that point.
    curve-curve intersection
    Points of coincidence of two curves. The points lie on both curves, and thus, it is a way to compute points on a curve.
    curve-surface intersection
    Points of coincidence of a space curve and a surface. The points lie on both, the surface and the space curve, and thus, it is a way to compute points on a surface.
    Reduction of the number of triangles in a triangle mesh, maintaining the original topology of the mesh and preserving a good approximation to the original geometry.
    decision trees
    A family of classification algorithms. The algorithm classifies data by hierarchical decomposition of conditions, which can be learned from a labeled set of training data.
    defocus/focus (shape from)
    Estimating the 3D surface of a scene from a set of two or more images of that scene. The images are obtained by changing the camera parameters (typically the focal setting or the image plane axial position), and taken from the same point of view.
    degrees of freedom
    (1) The variables one can employ in manipulating geometry. Typically, these are the vertices of polygonal meshes and the control points and knots, in case of B-splines.
    (2) A particular axis of rotation within a skeleton joint.
    description logic
    Logic that focuses on descriptions as its principal means for expressing logical expressions. A description logic system emphasizes the use of classification and subsumption reasoning as its primary mode of inference. Description Logics are a family of knowledge representation languages which can be used to represent the terminological knowledge of an application domain in a structured and formally well-understood way. The name description logic refers, on the one hand, to concept descriptions used to describe a domain and, on the other hand to the logic-based semantics which can be given by a translation into first-order predicate logic.
    design for x
    Philosophy suggesting that a design can be continually reviewed from the start to the end to find ways to guide the design process and improve production and other non-functional aspects. ?Design for manufacture? and ?design for assembly? methodologies remain the most important as they have a direct and recognisable impact on product costs.
    detail feature
    Aesthetic features of the shape. In accordance with the stylists? activity, they are created in the second modelling phase and applied on a surface for adding aesthetic and functional details and for enforcing the visual effects of important shape elements. Detail features can be classified according to the type of action performed on the surface, i.e. an area deformation or elimination (modelling classification), to the position of the influence area (topological classification), and to the morphological aspects of the resulting shape, i.e. the image of the deformed part (morphological sub-classification).
    Digital Imaging and Communications in Medicine. A comprehensive set of standards for handling, storing and transmitting information in medical imaging. It includes a file format definition and a network communication protocol.
    digital terrain model
    A discrete model of a topographic surface built on the basis of a finite set of points sampled on the surface itself.
    direct kinematics
    See Forward kinematics.
    direct manipulation
    A method that offers direct manipulation of geometry, typically in the context of multiresolution editing of freeform curves and surfaces, and possibly with constraints.
    discrete levels-of-detail (lod) model
    A collection of independent shape representations, each at a different level of detail.
    In FE problems, conversion of a geometric model into a suitable discrete model with a finite number of degrees of freedom.
    distance surface
    It calculates the field value at a point P as a decreasing function of the distance between P and the closest point on the skeleton.
    distributed design
    Product design performed by actors but located in different places (even in the same company), working on different aspect of a product, but sharing its data.
    See Description Logic
    doo-sabin scheme
    A subdivision scheme for quadrilateral meshes generalizing the bivariate quadratic spline.
    See Digital Terrain Modeling.
    edge collapse
    It consists of contracting an edge e in a simplicial mesh to a vertex v, which can either be a new vertex (full-edge collapse) or one of its extreme vertices (half-edge collapse). In a triangle mesh, the simplices incident at e become simplices of one dimension lower. All simplices incident in one of the two extreme vertices of e become incident at v.
    The free extremity of an end segment in a control skeleton.
    equi-brightness curve
    The equi-brightness curve of a surface is the locus of points where the brightness of an illuminated surface is constant.
    equi-gradient curve
    The equi-gradient curve of a surface is formed by the points where the angle between the surface normal and a given vector is constant.
    euclidean cell complex
    Let G be a connected finite set of cells of heterogeneous dimensions embedded in the Euclidean space Rn and d the ith maximum of the dimensions of the cells of G, such that the boundary of each cell in G is a collection of cells of lower dimensions belonging to G. Then, G is a d-dimensional cell complex if and only if the interiors of any pair of d-dimensional cells of G are disjoint.
    extraordinary vertex
    A non-regular vertex.
    facial animation
    Methods for animating the face of a Virtual Human. Facial animation is usually performed with Skin Interpolation.
    Before computers the smooth curves describing the hulls of ships were faired by using an elastic thin wood ruler, the spline. Today the word fairing relates to designing and editing smooth curves and surface within CAD-type systems.
    See Finite Element Analysis.
    Very general term indicating any characteristic of a phenomenon or of an object, for example a surface patch of certain curvature characteristics. In CAD, it refers to a set of geometric elements with a special meaning and controllable by means of a limited number of significant parameters. The meaning depends on the context: for example, it can be related to functionality, geometry, assembly and manufacturing.
    fe element
    Each parts in which the geometry is subdivided by a finite element mesh. For 2D analysis, or a 3D thin shell analysis, the elements are essentially 2D. For a 3D solid analysis, the elements have physical thickness in all three dimensions. (examples: solid linear brick , solid parabolic tetrahedral elements?).
    See Finite Element Method.
    Surface joining and smoothing two other surfaces, defined as the envelop of spheres rolling along the intersection curve of these two surfaces.
    finite element analysis
    Analysis performed with FE methods.
    finite element method
    Numerical method able to solve a wide variety of mechanical problems (e.g. structural, mechanical, heat transfer, fluid dynamics) through the discretization of the model in the 3D space.
    Rotation of the limb which is influenced by the joint and causes the motion of all limbs linked to this joint. This flexion is carried out relative to the joint point and a flexion axis has to be defined.
    focal surface
    The focal surface is formed by the centres of curvature of a given smooth surface. Thus, the focal surface consists of two sheets corresponding to the maximal and minimal principal curvatures.
    form feature
    In CAD, it is a geometric feature composed by parts of analytic surfaces (planes, cylinders and spheres).
    forward dynamics
    In forward dynamics, a skeletal motion is determined from input torques and forces.
    forward kinematics
    In forward kinematics, a skeletal posture is determined by assigning input joint angles individually for all the joints of a chain.
    An object that exhibits self-similarity: the same form on all scales. A typical example is a snowflake. The boundary of the fractal object has a fractal (non-integer) dimension.
    free-form feature
    In CAD, it is a geometric feature composed by free-form surfaces.
    free-form surface
    Any 2 or 3 dimension shape that is not easily decomposable in regular, or analytic shapes.
    The combination of data from different sources.
    gaussian curvature
    An intrinsic property of a space independent of the coordinate system used to describe it. The Gaussian curvature equals the product of the principal curvatures.
    generalised focal surface
    The locus of all points of a normal congruence proportional to a curvature function value at these points. It is quite related to hedgehog diagram. Instead of drawing surface normals proportional to a function value, all the points on the surface normals proportional to the function value are drawn.
    A topologically invariant property of a surface defined as the largest number of non-intersecting simple closed curves that can be drawn on the surface without separating it. Roughly speaking, it is the number of holes in a surface.?
    geodesic path
    It is a line which connect two points on a curved surface with minimum path length.
    geometric continuity
    Two Ck curves or surfaces join at a boundary with geometric continuity Gk if it is possible to a reparametrise both the curves or surfaces with a unique map such that the derivatives of the component functions agree. For k=0, it coincides with C0, for k=1, it is a continuity of the tangent plane, for k=2, it is a continuity of curvature.
    gridded elevation model
    A gridded elevation model is a DTM defined by a domain partition into a cell complex in which the 2-cells are squares.
    half-edge data structure
    A data structure for encoding a mesh. For each edge of the mesh, the data structure stores two half-edges, and information about the edge is split between such two halves. Each half-edge stores the index of its origin, the index of the face on its left, two indices of its previous and next edges along the boundary of that face, and the index of its twin half-edge, which is oriented in the opposite direction. Information attached to vertices and faces are the same as in the winged-edge and in the DCEL data structures.
    hand posture
    Specification of joint values describing the hand posture required to grab or manipulate a Smart Object.
    h-anim skeleton
    The H-Anim skeleton is an animation-oriented structural descriptor. It is an efficient representation of an articulated skeleton for Virtual Humans. It was initially proposed by the Humanoid Animation Working Group (http://www.h-anim.org). Now it has been adopted by the MPEG-4 specification as one of the standard structural descriptors for animatable Humanoid Virtual Characters.
    haptic device
    A device which allows a user to interact with a computer by receiving tactile feed back. This feedback is achieved by applying a degree of opposing force to the user along the x, y, and z axes. There are two main types of haptic devices: glove or pen-type devices that allow the user to "touch" and manipulate 3-dimensional virtual objects and devices that allow users to "feel" textures of 2-dimensional objects with a pen or mouse-type interface.
    Technology to detect and repair connectivity problems (e.g. gaps) in order to have a conform geometric model.
    hedgehog diagram
    A hedgehog diagram (curvature profile) for planar curves visualizes the curve normals proportional to the curvature value at some curve points.
    hierarchical b-spline (h-spline)
    A scheme of defining surfaces using overlays of B-spline surfaces. A complex surface is defined as a single tensor product square patch with other tensor product patches laid on top of it at different orientations and sizes.
    hierarchical model
    Organisation of data records as a collection of trees, rather than arbitrary graphs. With respect to geometry a rough description of the geometry is located at the highest level, and more and more details are added descending the tree.
    highlight line
    A highlight line is defined as the locus of all points on a surface where the orthogonal distance between the surface normal and the light line is zero.
    homotopy type
    A class formed by sets in the Euclidean space which have essentially the same structure, regardless of size, shape and dimension. The essential structure is what a set keeps when it is transformed by compressing or dilating its parts, but without cutting or gluing.
    human joint
    Joint node, basic building block of a Virtual Human skeleton, representing the actual joints on a human being: shoulders, wrists, vertebrae, etc. A joint can have different kinds of children: they can be segments (typically used to store the actual geometry of each limb), or other joints. Under certain cases (not H-Anim 1.0 compliant) a joint could directly store a geometry node.
    human segment
    Node specialisation for H-Anim Segments, typically used as the container of a 3D shape representing a given human body part.
    A 2- or larger dimensional array of measurements. In common usage, images refer to digital recordings of intensities obtained with a camera.
    image segmentation
    A division of an image into a collection of (usually non-overlapping) segments.
    implicit curve/surface
    The set of points P in space verifying an implicit equation (f(P) - constant = 0). f is called the "field function" (and sometimes the "implicit function", which is improper since this function is explicitly given by its parametric equation).
    A process which consists in the conversion of a parameterised representation of an algebraic curve or surface into an implicit representation.
    implicit lod representation
    It refers to any implicit representation that provides different levels of detail for the implicit surface.
    An impostor is an image that represents a part of a complex object, and it is usually generated by capturing a rendered image of this object from the predefined camera position. It is mapped on the polygon that is best suited for the specific camera position.
    indexed data structure
    A data structure for triangle and tetrahedral meshes. For each triangle (tetrahedron) in the mesh, the indices to its three (four) vertices are encoded.
    indexed data structure with adjacencies
    Extension of the indexed data structure for both triangle and tetrahedral meshes. It encodes, for each triangle (tetrahedron) t, also the indices to the three triangles (four tetrahedra) edge-adjacent (face-adjacent) to t.
    index of a critical point
    Number of negative eigenvalues of the Hessian matrix of a C2-differentiable function defined over a domain D in R2.
    individual descriptor
    Human like traits that can be used to describe virtual human characters; these traits can be personality models, emotion, mood, etc. These descriptors are considered to create behavioural animations.
    See Individual Descriptor.
    industrial design
    The professional service of creating and developing concepts and specifications that optimise the function, value, and appearance of products and systems for the mutual benefit of both user and manufacturer.
    inflection point
    A point on a curve at which the curvature changes sign, passing from concave to convex or vice versa.
    influence area
    It usually refers to the area affected by applying a geometric operation to a surface (e.g. performing a modification).
    integral line
    An integral line of a function f is a maximal path which is everywhere tangent to the gradient vector field of f. An integral line is emanating from a critical point or from the boundary of D, and it reaches another critical point or the boundary of the domain D.
    inverse dynamics
    It consists in determining the forces and torques required to produce a prescribed motion.
    inverse kinematics
    In inverse kinematics, a skeletal posture is defined by specifying target location to end-effectors. The joint angles of the control skeleton are defined so that the end-effectors reach their targets as close as possible.
    irregular mesh
    A mesh which is not regular.
    irregular vertex
    See extraordinary vertex.
    It is a surface curve along which some function defined over the surface has a constant value.
    iterative closest point (icp)
    Class of algorithms for alignment of meshes or point clouds. They are based on the assumption that closest points correspond to each other. Iteratively, for closest points the best transformation is computed and applied to the data set.
    A point of articulation between two or more bones, especially such a connection that allows motion.
    joint limits
    Maximum and minimum values that restrict the angle range of a joint.
    k-dimensional euclidean cell
    A k-dimensional cell, or k-cell is a subset of the n-dimensional Euclidean space Rn homeomorphic to a closed k-dimensional ball, where k<=n.
    key-frame animation
    Type of animation that is defined by a set of frames, where each frame contains a set of key frames which indicate the position and orientation of defined objects in the animation. Each key frame includes a key time which orders the set of key frames.
    A place holder to store information associated to a particular location on a 3D geometry. Landmarks can be anatomical structures used as a point of origin to locating other anatomical structures, or points from which measurements can be taken.
    laser scanner
    Device that emits highly amplified and coherent radiation of one or more discrete frequencies (e.g. a Linear Camera).
    level of articulation
    Term used in the H-Anim standard related to the degrees of freedom of a skeleton chain. LOA is also used relatively to LOD, with respect to multi-resolution for bone-based animation.
    level set (of a real function f)
    The level set of a real function f is the pre-image through f of a constant value t in the domain of f. The level sets are also called contours or iso-levels. Level sets may be non-connected.
    levels-of-detail (lod)
    Compact description of several representations of a shape, from which representations of a shape at different levels of resolution can be obtained.
    linear axis
    It is based on a linear wave-front propagation like the straight skeleton, but the discrepancy in the speed of the points in the propagating wave-front, though never zero, can decrease as much as wanted.
    linear static problem
    Linear static analysis deals with continuum static problems in which the response is linear in the cause-and-effect sense.
    line of curvature
    A surface curve whose tangent directions coincide with those of the principle directions. The lines of curvature form an orthogonal net everywhere on the surface except the umbilical points where the principal directions are not defined.
    line of sight
    The straight line between the observer and the target.
    See Level of Articulation.
    See Levels of Detail.
    loop scheme
    A subdivision scheme for triangle meshes generalizing the three directional box spline.
    Lindenmayer system. A string rewriting system which can be used to generate fractals with dimension between 1 and 2.
    l-system surface
    A surface built within a L-system.
    magnetic resonance imaging
    Three-dimensional images produced by a non-invasive diagnostic procedure that uses magnetic field resonance. MRI is commonly used to obtain 3D pictures of internal body structures. In the case of dynamic MRI it is the the acquisition of a sequence of MRI images to monitor temporal changes in tissue structure.
    A (separable Hausdoff) k-dimensional topological space M in which each point has a neighbourhood which is homeomorphic either to the k-dimensional open ball, or to the half-ball.
    marching cubes
    An algorithm that extracts an implicit surface represented by a 3D regular grid of data values. This grid is often referred to as a grid of voxels. The eight corners of a voxel give a total of alternative 256 different configurations for the corner status. By standard operations these can be group into 15 alternative configurations. Triangulations representing these 15 can be pre-computed, and thus efficiently used when tracing the implicit surface described by the grid of voxels.
    The subdivision rule for calculating a new vertex on the refined mesh, usually described by diagrams. Several masks are required to describe a subdivision scheme, e.g. mask for new vertices corresponding to old vertices, edges, faces, or boundary vertices.
    Finding the correspondence between two shapes, or finding the transformation that yields a good alignment between two shapes.
    mean curvature
    Given the principal curvatures k1 and k2, H = (k1 + k2)/2 is called the mean curvature.
    medial axis
    The medial axis of a bounded open subset X is the set of points that have at least two closest points in the complement of X.
    A grid-like polygonal subdivision of the surface of a geometric model. More formally, it is an Euclidean d-dimensional cell complex G (actually gamma) such that any k-cell of G , with k
    See Tessellation.
    mesh merging
    The combination of meshes resulting from different viewing directions into a single mesh.
    From the Greek “meta”=beyond/after. Structured data about data. Metadata has become increasingly important in XML-based Web applications.
    minkowski sum
    Set of point with integer coefficients that can be obtained as sum of two vectors with integer coefficients taken from two other sets of vectors with integer.
    See motion capture
    model composition
    A process by which a new 3D model (e.g. a mesh) is constructed by the seamless composition of two or more existing models.
    The process of making a smooth transition between two shapes.
    morphological descriptor
    Describes the morphology of a human like: age, weight, height, gender, etc.
    See Morphological Descriptor
    morph target
    It defines a different version of an object over time. A morph target is built by deforming/morphing a base shape of an object into a different shape that represents the same object in a different configuration. Morph targets can be used to animate 3D objects with skin interpolation.
    morse function
    A C2-differentiable function defined over a domain D in R2 such all the critical points are non-degenerate.
    morse-smale complex
    The stable (unstable) manifolds are pair-wise disjoint and decompose the domain D of a Morse-Smale function f into open cells, whose closure form a complex, called a Morse-Smale complex.
    morse-smale function
    A Morse function f is called a Morse-Smale function if and only if the stable and unstable manifolds intersect only transversally.
    morse theory
    A generalisation of calculus of variations which draws the relationship between the stationary points of a smooth real-valued function on a manifold and the global topology of the manifold.
    motion capture
    Methods for capturing movement data from a live source. The data are filtered and processed in order to replicate the same motion as the one performed by the live source on a control skeleton.
    See Magnetic Resonance Imaging.
    multigrid algorithms
    Algorithms designed to accelerate the convergence speed of basic relaxation iteration schemes (e.g. a Jacoby or Gauss-Seidel iteration) by computing corrections to the solution on coarser grids.
    An analysis and/or synthesis technique that allows manipulation of geometry at different resolutions, enabling both local and global modification, modulation of details at different frequencies.
    multi-sensor data fusion
    Study of the techniques for the integration of data from multiple sensors.
    An abstract class used to describe a family of "graph-like" nodes that can constitute diverse structural descriptors such as articulated skeletons.
    non-photorealistic rendering
    It helps making comprehensible but simple pictures of complicated objects by employing different simplification techniques.
    NonUniform Rational B-splines is a standard way in CAD for describing piecewise rational univariate and tensor product functions. NURBS use the numerically very stable B-spline basis for representing both the numerator and denominator of the rational function. NURBS is a very central geometry representation format in the STEP Standard (ISO 10303).
    object joint
    Analogous to the joint node (Human joint), but adapted to describe smart objects.
    object segment
    Node specialization for Smart Objects structural descriptors. It contains information about each object part, including the geometry and a pointer to additional smart object attributes.
    A portion of a surface is occluded to a sensor when there is a closer object hiding it to the sensor.
    offset surface
    Coefficient set of points at a given distance of a given shape following the oriented normal to the input shape. It is a frequently used method for surface creation in CAD; if self-intersections occur, the offset has to be trimmed.
    The specification of a conceptualisation of a knowledge domain. In philosophy (from the Greek “on” = being/to be and “logos” = word/speech) it is the science or study of being or existence as well as the basic categories thereof -- trying to find out what entities and what types of entities exist. In computer science, an ontology is the product of an attempt to formulate an exhaustive and rigorous conceptual schema about a domain. An ontology is typically a hierarchical data structure containing all the relevant entities and their relationships and rules within that domain (e.g. a domain ontology).. On the Web, the term applies to the many ongoing efforts to develop topic-specific sets of XML-friendly language, rules and definitions. Essentially, IT ontologies are logical supersets that combine metadata, taxonomies and semantics into formal systems that can be encoded in software, enabling diverse Web applications to truly understand one another.
    orientable surface
    A two-dimensional manifold surface is orientable if a consistent concept of clockwise rotation can be defined on the surface in a continuous manner. This turns out be equivalent to the question of whether the surface contains no subset that is homeomorphic to the M?bius band. In an equivalent definition, a surface is called orientable if there exists an atlas on it such that the Jacobian of all the transition functions (that is the homeomorphisms defined on the intersections of each pair of charts) from a chart to another are positive for all the intersecting pairs of regions.
    oriented surface
    A manifold surface throughout which left and right-directions are globally defined. From a mathematical point of view, this means that a differential form of degree 2 which is nonzero at every point on the surface is given.
    orthogonal projection
    Projection P applied to x such that P(x)-x is in normal direction of P(x).
    The orthotomic of a given curve/surface is the set of reflections of a given point around the tangents of a the curve/surface.
    When a problem is too large to fit into the primary memory (both physical and virtual) of the computer, it has to be processed using out of core techniques.
    parabolic line
    A parabolic line on a surface consists of points where one of the principal curvature vanishes.
    parametric continuity
    Two Ck function pieces join smoothly at a boundary to form a joint Ck function if, at all common points, their kth derivatives agree for k = 0,1,2, ,k. For k=0, it is a point continuity, for k=1, it is a continuity of first derivative, for k=2, it is a continuity of second derivative. It cannot be inferred that curve or surface pieces join smoothly if the derivatives of the component functions agree.
    parametric curve/surface
    Any curve/surface defined on a parametric domain. In case of surfaces, such domain can be usually tensor-based or triangular. Bezier, B-Splines, NURBS curves/surfaces belong to this category.
    parametric modelling
    Method of supporting the generation of model variations in CAD systems, storing an object as a main shape description and parameters for the dimensions and/or topology. After the assignment of specific values to the parameters, the modelling system generates a model variant accordingly.
    parametric surface
    A function with domain R2 and range R3.
    See Principal Component Analysis.
    The pivot makes the flexion axis rotate around the limb which is influenced by the joint.
    A picture element, one or more measurements at a particular integer coordinate of a 2-D image.
    point cloud
    A set of uncorrelated points, usually in 3D, which have to be further elaborated to obtain a 3D model.
    point set
    See Point Cloud.
    polyhedral terrain
    A polyhedral terrain is the image of a piecewise-linear function f. The most commonly used polyhedral terrain models are triangulated irregular networks (TINs), in which the domain partition forms a triangle mesh.
    In a FE context, phase of the finite element analysis in which the analyst checks the validity of the solution, examines the values of primary quantities (such as displacements and stresses), and derives and examines additional quantities (such as specialized stresses and error indicators).
    In a FE context, phase of the finite element analysis where the analyst develops a finite element mesh to divide the subject geometry into sub domains for mathematical analysis, and applies material properties and boundary conditions.
    principal component analysis
    A technique that can be used to simplify a dataset; more formally it is a linear transformation that chooses a new coordinate system for the data set such that the greatest variance by any projection of the data set comes to lie on the first axis (then called the first principal component), the second greatest variance on the second axis, and so on. ...
    principal curvatures
    The maximum and minimum of the normal curvature k1 and k2 at a given point on a surface are called the principal curvatures. The principal curvatures measure the maximum and minimum bending of a regular surface at each point.
    product development process
    A disciplined and defined set of tasks and steps which describe the normal means by which a company repetitively converts embryonic ideas into saleable products or services.
    product modelling
    The entire product information modelling which describes the product completely and unambiguously. It deals with two general types of information: physical product design information represented by the design model and process information, represented by the process and data model.
    progressive levels-of-detail (lod) models
    They consist of a coarse shape representation and of a sequence of small modifications, that, when applied to the coarse representation, produce shape representations at successively finer levels of detail.
    progressive transmission
    An incremental transfer of geometry between two different sites to alleviate transmission delays due to the fact that geometry tends to be very large. This incremental transfer typically tries to capture most of the geometry, in as early as possible stages of the transmission.
    projection operator
    An operator that performs a projection. A projection P applied to x has the property that P(x) = P(P(x)), i.e. that projected points are stationary points of the projection operator. Commonly, the stationary points of a projection operator are a sub-manifold of the space they act on.
    range image
    A grid of distances (range points) that describe a surface in Cartesian (height field) or cylindrical coordinates. A range scanner senses 3D positions on an objects surface and returns an array of distance values.
    range scan
    See Range image.
    rapid prototyping
    The speedy fabrication of sample parts of a product for demonstration, evaluation, or testing. It typically utilizes advanced layer manufacturing technologies that can quickly generate complex 3D objects directly from digital models. This computer representation is sliced into two-dimensional layers, whose descriptions are sent to the fabrication equipment to build the part layer by layer. Rapid prototyping includes many different fabrication technologies: stereolithography (STL), selective laser sintering (SLS), laminated object manufacturing (LOM), and fused deposition modelling (FDM) are a few examples.
    raster data
    One method of storing, representing or displaying spatial data in digital form. It consists of using cell data arranged in a regular grid pattern in which each unit (pixel or cell) within the grid is assigned an identifying value based on its characteristics.
    ray casting
    A central method for making photorealistic rendering.
    ray-surface intersection
    A specialization of Curve-surface intersection, where the space curve is an infinite straight line.
    The process of making a surface geometry or volume type description of a 3D object based on measured points coordinates on the outer and inner surfaces of the 3D object. Automatic reconstruction is a very challenging process, as the point sets can have wrong points, can miss points or do not contain a sufficient amount of point to describe critical surface regions accurately. If a point set is produced by combining measurement from different camera positions, there is often drifting of the data between the measurements, Such drifting will often result in false surface features.
    The process of rebuilding a valid 3D model that existed at an earlier stage in the design process after a crash of the modelling system, erroneous use of modelling functionality, rejection of the used design approach, or other mishaps.
    reeb graph
    A topological structure encoding the evolution and the arrangement of the level sets. It is defined as the quotient space of a compact manifold M with respect to a real valued, continuous map f defined on it defined by the equivalence relation that collapses two point on M if and only if they have same image of f and belong to the same connected component of f-1(f()).
    refinement operator
    Operator to add primitives to a surface description. This typically increases the geometric fidelity of the representation.
    The proportion of light aimed at an object that is reflected by it. An object’s reflectance determines whether the object is perceived as light or dark.
    reflection line
    A line consisting of all points p whose connection with some fixed point e, the eye, is reflected into a ray that meets a given fixed line L. Reflection lines, such as contour lines and isophotes, are very helpful to detect surface imperfections visually. They are very commonly in the automotive industry.
    A rigid transformation that brings points of one range image into alignment with portions of a surface it shares with another range image.
    regular mesh
    It is composed of simplices that are all similar (or belong to just few classes of congruent simplices) and have all vertices of the same degree (i.e. with the same number of incident simplices).
    regular square grid
    regular vertex
    A vertex of valence six for triangle meshes, valence four for quad meshes and valence three for hexagonal meshes. These valences correspond to the regular tessellations of the Euclidean plane. All major subdivision schemes refine the control mesh by inserting regular vertices, thus isolated the vertices with other valences.
    There is no precise definition, since it often varies according to the targeted goal or application. Nonetheless, it is possible to say that, given a 3D mesh, remeshing consists in computing another mesh, whose elements satisfy some quality requirements, while approximating well the input. Quality has several meanings. It can be related to the sampling, grading, regularity, size and shape of elements. Often a combination of these criteria is desired in real applications. Some remeshing techniques proceed by altering the input, and some generate a new mesh from scratch.
    The process of creating an image on the screen from a mathematical model of a three-dimensional object or scene, including texture, lights and other graphical information.
    The process of removing (if possible) or reducing the gaps the between the delimiting curves of different surface elements. When repairing the surfaces to ensure that the bounding curves fit better, the interior of the surfaces also have to be modified. Such modification can, if care is not taken, easily destroy important properties imposed on the interior of the surface. Automatic repair of CAD-models is thus an extremely challenging task.
    A projection operator which is used to eliminate a set of variables in an over-constraint polynomial system.
    reverse engineering
    The process of recreating a design by analysing a final product, speeding up the design and the evaluation process. A point cloud typically acquired using scanning techniques is used as a basis for constructing 3D CAD surface data from a physical model.
    An additive encoding of colors using the three primaries, red, green and blue. RGB is the common color model used in computer monitors and color images.
    A ridge consists of the surface points where one of the principal curvatures attains an extremal value along its corresponding line of curvature.
    The process of obtaining a sequence of point coordinates from a 3D model.
    The use of one or more Acquisition Devices in order to digitalize the shape of a real object.
    scattered data
    Point data not lying in a regular grid structure. Scattered data can have line structures, be clustered, be fairly evenly dispersed or have many other structures.
    (1) Portion of an H-Anim figure (Virtual Human) or Smart Object that represents its geometry and appearance.
    (2) A collection of pixels that have similar properties (e.g., similar intensity values or texture) which differ from their surrounding pixels. (3) A subset of a data set classified according to similar characteristics of the basic entities or to given criteria.
    To split a data set into smaller subsets based on given classifications or criteria. Frequently used in image processing to analyse pictures and for detection. When reconstructing geometry objects from sampled points, segmentation techniques can be used to detect subsets of points belonging to the same mathematical surface.
    selective refinement
    The extraction of shape representations from a LOD model in which the resolution varies continuously in different parts of the shape.
    It occurs when a curve, surface or higher dimensional manifold intersects itself. For surfaces used in CAD self-intersections represents a situation that cannot be reproduced physically in production, and thus should be avoided.
    A surface is self-occluding when:
  • Light cast from behind the surface does not illuminate it;
  • The light source is in front of the surface but some closer portion of the surface blocks the incoming light;
  • The light source is in front of the surface and the surface is illuminated, but some closer portion of the surface blocks the light coming from the surface.
  • semantic
    Pertaining to meaning (from the Greek “semainein” = to signify/mean). Recently there has been much talk about the emergence of the "Semantic Web".
    semantic web
    Framework in which applications and information are organized in such a way that applications are intelligent systems where computers can effectively “understand” the meaning of the information, unlike HTML-based systems that are mostly concerned with how information is displayed.
    semi-algebraic curve/surface
    A curve or surface which can, in addition, be described as the solution set of polynomial equalities and inequalities (e.g. B-Spline curves and surfaces).
    (1) An electronic device used to measure a physical quantity such as temperature, pressure or loudness and convert it into an electronic signal of some kind (e. g. a voltage). Sensors can be classified in passive (not interacting with the scene) and active (interacting with the scene). Sensors are normally components of some larger electronic system such as a computer control and/or measurement system.
    (2) Virtual entities that give to Virtual Humans the possibility to acquire information (stimuli) coming from their surrounding virtual environment. Virtual sensors let a VH see, hear and touch its virtual environment and react in consequence. The information acquired is then analyzed with different algorithms and/or Behavior Controllers that produce animation as output (the VH reacts to stimuli).
    separatrix line
    An integral line which connects a minimum to a saddle, or a saddle to a maximum.
    shape classification
    Given a database D containing n shapes, which are grouped into m classes, classification aims at determining the class a query shape, not necessarily belonging to D, most reasonably belongs to.
    shape deformation
    Each operation or technique aiming at modifying a shape.
    shape descriptor
    shape from shading
    A method for determining the shape of a surface from the pattern of lights and shades in an image.
    shape grammar
    A shape grammar defines a language of design, i.e. it is a set of precise generating rules, which in turn, can be used to produce a language of shapes, to generate infinitely many instances of shape arrangements starting from an initial basic set of shapes. For example, shape grammars are widely used in architecture to model houses starting from pre-defined primitives (e.g. walls, windows, doors) and rules (e.g. each room must have at least one door).
    shape indexing
    Methodology relying on a lookup table approach for fast object labelling.
    shape interrogation
    The process of extraction of information from a geometric model. Shape interrogation methods are used to analyse shapes with respect to different aspects like visual pleasantness, technical smoothness, geometric constraints, intrinsic surface properties or to highlight shape imperfections.
    shape signature
    Compact representation of the essence of the shape commonly used as a fast indexing and matching mechanism for shape retrieval. Effective shape signatures capture some global (e.g. scale, translation and rotation invariant) and partial geometric properties.
    shock graph
    A directed, planar graph in which the shock sets are grouped and classified according to the number of contact points and the flow direction.
    shock set
    Dynamic view of the medial axis, which associates a direction and a speed of flow to the fire front propagation.
    The outline of an object when seen from a given position. Silhouette curves are frequently used to enhance the 3D display of a CAD-model and when making 2D drawings from 3D objects.
    simplex (k-dimensional)
    A k-dimensional simplex, or k-simplex, in the Euclidean space Rn is the locus of the points in Rn that can be expressed as the convex combination of k+1 affinely independent points.
    simplicial complex
    A d-dimensional simplicial complex is a collection of simplices of dimension at most d in Rn such that all simplices spanned by vertices of the complex belong to the complex and the intersection of any two simplices is either empty or is a simplex belonging to both simplices.
    simplicial mesh
    A simplicial mesh is a mesh in which all cells are simplices. A d-dimensional simplicial mesh is a simplicial mesh which contains simplices of dimension d or lower.
    Simplification can relate to a number of shape processing operations in CAD:
  • Replace a boundary structure CAD model consisting of many surface elements by a CAD-model with significantly fewer surface elements, without changing the shape or design intent behind the model. Such simplification can be important to ensure simple meshing and remeshing of CAD-models when preparing for simulation of the CAD-model, or just to clean up the CAD-model.
  • Remove unnecessary details before a CAD-model is meshed. Details not important for the simulation are removed, and regions where the actual geometry does not play any role for the outcome the simulation are given a simpler description.
  • simplified incidence graph
    For a tetrahedral mesh, it encodes the following information: for each vertex v, a pointer to one edge incident at t v; for each edge e, the indices of the two extreme vertices of e and of one of the triangles sharing e; for each triangle t, the indices of the three edges bounding t, and the indices of the two tetrahedra sharing it; for each tetrahedron s the indices of the four triangles bounding s.
    For a triangle mesh, it encodes the following information: for each vertex v, a pointer to one edge incident at v; for each edge e, the indices of the two extreme vertices of e, and of the two triangles sharing e; for each triangle t, the indices of the three edges bounding t.
    simulation post-processing
    Interpretation of the simulation results, which are typically scalar or vector values on finite element nodes applied on the input shape.
    simulation process
    Stage of the product development process which evaluates the physical behavior of any engineering component constituting the whole product subject to various kinds of loads and conditions. Finite Element (FE) approaches are techniques widespread in industry to analyze the mechanical behavior of a component. FE packages are able to solve sophisticated problems, ranging from structural analysis evaluating the performance of the product structure to thermal and electrical analysis, crash simulation, fluid flow and manufacturing processes, such as injection molding and metal forming.
    A place holder to store information associated to a particular location on a 3D geometry. Landmarks can be anatomical structures used as a point of origin to locating other anatomical structures, or points from which measurements can be taken.
    skeletal linear structure
    One-dimensional representation which encodes the decomposition of a shape into its relevant parts, or features, which may have either a geometric or an application dependent meaning.
    (1) In algebraic topology, a p-skeleton is a simplicial sub-complex of a simplicial complex K that is the collection of all simplices of K of dimension at most p.
    (2) Related with the notion of medial axis, the skeleton of a bounded open subset X is the set of centres of maximal balls, where an open ball B is maximal if every ball that contains B and is contained in X equals B.
    (3) The skeleton of a shape is the reduced object representation that conforms to human visual perception and preserve the salient shape features.
    (4) Implicit skeleton: in the field of implicit modelling, it is used for a set of geometric primitives to which a distance can be computed. These primitives are used for generating the field function that defines the surface. Skeleton-based implicit modelling can also be referred to as "Structural Implicit Modelling", since the skeleton defines an internal structure for the model.
    skeleton animation
    Methods to animate an articulated skeleton by changing the values of the skeleton joints angles over time. The main methods are inverse and forward kinematics and Motion Capture. The result of a skeleton animation is stored as an animation sequence.
    skeleton articulation
    An articulation is the intersection of two limbs, which means it is a skeleton point where the limb which is linked to the point may move.
    skeleton-based implicit surface
    An implicit surface whose field function is generated by a set of geometric primitives called skeleton.
    skeleton-driven deformation
    It consists of deforming the skin to match the current posture of the control skeleton for articulated object animation or deformation. The basic approach consists in assigning a set of joints with weights to each vertex in the skin. The location of a vertex is then calculated by a weighted combination of the transformation of the influencing joints. Various extensions and enhanced complex methods have been proposed.
    The operation of extracting a skeleton.
    skeleton joint
    A joint is the intersection of two segments, which means it is a skeleton point where the limb which is linked to the point may move. Skeleton joints are usually 3D Degrees of Freedom (DoF) rotational joints: flexion, pivot and twist.
    skeleton joint angle
    The angle between two segments (limbs) connected by a joint is called the joint angle.
    skeleton pose
    Specification of joint values describing a posture for an articulated character. A skeleton posture can be defined using forward/inverse kinematics, forward/inverse dynamics or even motion capture.
    skeleton posing
    It consists in specifying all joints angles values to define a skeleton pose or posture.
    skeleton posture
    Specification of joint values describing a posture for an articulated character. A skeleton posture can be defined using forward/inverse kinematics, forward/inverse dynamics or even motion capture.
    skeleton skin
    A geometric shape that represents the outer shape of an articulated object. This shape is attached to the articulated skeleton and animated with skeleton driven deformations according to the skeleton animation.
    skeleton skinning
    (1) Applying skeleton driven deformation to the skeleton skin of an articulated character in order to adjust it to the current skeleton pose.
    (2) Attaching geometric primitives or volumes to the joints and limbs of a control skeleton in order to define and control the shape of the skin. This information is further used in animation to control the skin deformation with respect to the control skeleton motion.
    Drawing or other composition that is not intended as a finished work, but captures the basic elements and structure.
    skin interpolation
    It consists in deforming a geometric surface (the skin) according to the animation of an underlying associated animation structure (skeleton, muscles) or to morph targets.
    skin mapping
    It consists of mapping a geometric surface called skin to a control skeleton in order to establish a direct correspondence between the control skeleton and the skin. This information is further used in animation to control the skin deformation with respect to the control skeleton motion.
    Refer to the surface representation used to draw a character in skeletal animation.
    skinning file
    It describes a particular type of data used for animating deformable VH. A skinning file contains weights assigned to each vertex of the VH geometry. Such weights indicate the amount of deformation to apply when changing the posture. Deformations can be considered as vertex displacements driven by a function of rotation angles belonging to one or more joints. This allows for more aesthetical visual results when animating VH. Skinning algorithms can be used to obtain anatomically correct skin deformation by simulating the interaction between bones, muscles and skin.
    skin rigging
    See Skin mapping.
    smart object
    Virtual object with which virtual humans are capable of manipulations. To implement this, the environment should be extended with some form of knowledge on how interactions between virtual humans and objects are to be carried out. Typical interactions are grasping and manipulation operations. A Smart Object is constituted by a hierarchical collection of nodes. The hierarchical organization specifies the relations between different Geometry and Attribute Sets composing an object.
    smart object skeleton
    Hierarchical structure of object joints and/or object segments used to describe a smart object which usually including mobile parts.
    solid mechanics
    Area of application of the continuum mechanics. It includes structures which are fabricated with solids. The computational structural mechanics emphasises technological applications to the analysis and design of structures.
    In a FE context, phase of the finite element analysis in which the program derives the governing matrix equations from the model and solves for the primary quantities.
    space-time constraints dynamics
    It consists in attempting to meet specified constraints while minimising energy functions in order to add more control over the motion produced by dynamics.
    spline space
    A Spline space is solely defined by the knot sequences describing the continuity between polynomial segments and and the polynomial degrees. Both uniform and non-uniform knot sequences are considered. The use of uniform knot sequences allows the removal of every second knot, preserving the uniformity of the knot sequences and hence the pre-computation of the wavelet analysis.
    stable/unstable manifold of a critical point
    Integral lines that converge to (originate from) a critical point of index i form an i-dimensional cell ((2-i)-dimensional cell).
    static problem
    Continuum mechanics problem where the time dependence is not considered.
    stereo vision
    Vision is the act of perceiving and interpreting visual information. The word "stereo" comes from the Greek word "stereos" which means firm or solid. With stereo vision the objects are perceived as solid in 3D. In human beings the stereo vision is achieved by the presence of two eyes and the elaboration of the brain; in the digital world it is achieved by the presence of two sensors and the techniques to combine the measurements coming from them.
    straight-line skeleton
    It is a type of skeleton for polygons which is defined as the union of pieces of angular bisectors traced out by the wave-front vertices during the propagation process from the polygon boundary.
    Change per unit of length in a linear dimension of a part or specimen, usually expressed in %. Strain, as used with most mechanical tests, is based on original length of the specimen. True or natural strain is based on instantaneous length.
    strain energy
    Measure of energy absorption characteristics of a material under load up to fracture. It is equal to the area under the stress-strain curve, and is a measure of the toughness of a material.
    Load on a specimen divided by the area through which it acts. As used with most mechanical tests, stress is based on original cross-sectional area without taking into account changes in area due to applied load. This is sometimes called conventional or engineering stress. True stress is equal to the load divided by the instantaneous cross-sectional area through which it acts.
    structural descriptor
    Decomposition of a shape into their relevant sub-parts, together with the adjacency relationships among the parts.
    structural feature
    Aesthetic features of the shape. In accordance with the stylists? activity, they represent the basic entities created in the preliminary phase of design, which are used for defining the surfaces constituting the product, thus having an important aesthetic impact. Structural features consist of the so called contours and character lines.
    structured light
    Structured light is the projection of a light pattern (plane, grid, or more complex shape) at a known angle onto an object. This technique can be very useful for imaging and acquiring dimensional information. The most often used light pattern is generated by fanning out a light beam into a sheet-of-light. When a sheet-of-light intersects with an object, a bright line of light can be seen on the surface of the object. By viewing this line of light from an angle, the observed distortions in the line can be translated into height variations.
    styling process
    Process of specifying the shape of a product in consideration of aesthetical and visual aspects.
    The strategy often used in CAGD is to divide the geometric elements describing the problem into pieces. The idea behind subdivision is that the problem gets simpler when addressing sub pieces of the original geometry. In many cases this is true. However, if care is not taken and the subdivision is not performed in the proper location, the sub-problems can get more complicated than the original problem. Subdivision algorithms play a central role in a number of algorithms in CAD:
  • Visualization algorithms to produce an accurate triangulation of surfaces for display;
  • Intersection algorithms for potentially simplifying the intersection problem.
  • subdivision curve
    A curve described by an initial control polygon and a refinement rule. The subdivision curve is the limit of the progressively refined control polygon.
    subdivision matrix
    A matrix describing the transformation of a part of the control mesh under one subdivision step. The spectral analysis of subdivision matrices is the main tool for studying a subdivision scheme.
    subdivision surface
    A surface described by an initial control mesh and a mesh refinement rule. The subdivision surface is the limit of the progressively refined control mesh.
    sub-parabolic line
    It is formed by the surface points where one of the principal curvatures takes an extremal value along the opposite line of curvature.
    The part of the subdivision surface affected by the change in position of a single point of the initial control mesh.
    support plane
    Frame used to compute surface properties in a parametric setting. The support plane is used as the parameter domain for a piece of surface, where the mapping between surface and support plane is established by orthogonal projection.
    support vector machines (svms)
    A family of algorithms that seek to divide a dataset using hyperplanes by margin maximisation. SVMs are often used as a supervised learning methods, applicable to both classification and regression.
    surface network
    Being f a Morse function defined over a domain D in R2, it is a graph in which the nodes represent the critical points of f and the arcs the integral lines connecting the critical points.
    surface patch
    A selected part of a larger surface. In B-Spline modelling, any of the sub-surfaces which the global shape is decomposed in.
    surface-surface intersection
    Points and curves of coincidence of two surfaces. The points and curves lie in both surfaces, and thus, it is a way to compute curves points on a surface.
    From Greek “taxinomia” from the words “taxis” = arrangement/order and “nomos” = law, it refers to a hierarchical classification of things i.e. a classification system. Historically, the term has mostly been used in the life sciences to describe the rigorous classification of species. Whereas each biological species has a unique classification, information taxonomies are used to organize documents or content. Within the IT community, taxonomy is a hierarchical data structure or a type of classification schema.
    See Topographic surface.
    Process forming or arranging continuous curves or surfaces in a piecewise, checked or mosaic pattern. In case of surfaces it is usually a triangulation.
    tetrahedral mesh
    A 3-dimensional simplicial mesh.
    tetrahedron bisection
    The action of replacing a tetrahedron ƒ? in a tetrahedral mesh with the two tetrahedra obtained by splitting ƒ? at the middle point of its longest edge through the plane passing through such point and the opposite edge of ƒ?. This rule is applied recursively to an initial decomposition of the cubic domain obtained by splitting it into six tetrahedra all sharing one diagonal.
    In computer graphics, the digital representation of the characteristic appearance of a surface having a tactile quality.
    Process of removing pixels or voxels from a discretised pixel-based or voxel-based representation of an object for generating a representation consisting of connected, unit-wide paths of pixels or voxels.
    Scanning technology referring to devices that calculate distances (3D positions in space) by measuring the time of flight of very short pulses of light.
    See Triangulated Irregular Network.
    topograghic distance
    The topographic distance between two points p and q on a surface described by a C2-differentiable function defined over a domain D in R2 is the length of the path of steepest slope joining p and q.
    topographic surface
    The image of a real bivariate function f defined over a subset of points D in the Euclidean plane.
    topological graph
    A simple unlabeled graph whose connectivity is considered purely on the basis of topological equivalence, so that two edges (v1, v2) and (v2, v3) joined by a node v2 of degree two are considered equivalent to the single edge (v1, v3). This entity acts as a placeholder for a variety of structural descriptors. Topological graphs are different from the H-Anim or Smart Object skeletons, which are animation-oriented structures not suitable for other applications.
    triangle bisection
    The action of replacing a triangle t in a triangle mesh with the two triangles obtained by splitting t at the middle point of its longest edge through the segment passing through such point and the opposite vertex of t. This rule is applied recursively to an initial decomposition of a square obtained by splitting it into two triangles by one of its diagonals.
    triangle mesh
    A 2-dimensional simplicial mesh.
    triangulated irregular network (tin)
    A DTM based on the decomposition of the domain of a two-dimensional scalar field into a triangle mesh.
    Denoting |S| the topological space underlying a simplicial complex S, (|S| = ?y????S ??), then a triangulation of the topological space M is a case of simplicial complex S such that |S| = M. Improperly, the term triangulation is also used to denote the geometric realisation of a bi-dimensional simplicial complex (also known as triangle mesh); while tetrahedralisations are a subclass of three-dimensional simplicial complexes.
    trimmed patches
    A subset of an existing patch defined by a restriction by a trimming line of the parametric space of the parametric surface describing the existing patch.
    trimming an offset
    The operation of removing self-intersecting parts of offset surfaces. In fact, when the offset distance is larger than the minimal radius of curvature of the existing surface in some points and smaller in some others, some corresponding normals of the two surfaces will point in opposite directions causing self-intersections in the offset.
    trimming line
    Line creating a restriction of the parametric space, i.e. of the definition domain of a parametric surface (Bezier, B-Spline, NURBS...).
    A torsion of the limb which is influenced by the joint.
    two-dimensional scalar field
    A real bivariate function f defined over a subset of points D in the Euclidean plane.
    umbilical point
    Surface point where the principal curvatures are equal. All the points in planar and spherical surface regions are umbilical.
    uniform knot sequence
    A knot sequence where all knots are equally spaced. One clear advantage of using uniform knot sequences can be found in the fact that the wavelet decomposition could be performed a-priori as the decomposition depends solely on the subspaces of the splines and is completely independent of the control points of the shapes.
    variable-resolution levels-of-detail (lod) model
    It consists of a coarse shape representation and of a set of small modifications, organised into a partial order that allow performing selective refinement in such a way that the resolution be changed on a virtually continuous scale.
    variational modelling
    A paradigm used to find the ?best? curve or surface among all solutions that meet a set of prescribed constraints. The constraints may result from the particular modelling technique used, for example, sample point approximation, or direct curve manipulation. It is typically formulated by minimising some energy functional.
    vertex insertion
    Vertex insertion in a simplicial mesh ?? consists of deleting a connected set of d-simplices from ??, called the region of influence of the vertex insertion, and replacing them with a set of new d-simplices all incident at v . The region of influence is defined by the specific triangulation criterion used.
    vertex removal
    Removal of a vertex v from a simplicial together with all the d-simplices incident at v from a d-dimensional simplicial mesh and re-triangulating the resulting star-shaped region formed by the union of the removed simplices. It is the inverse operation with respect to vertex insertion.
    vertex split
    Expansion of a vertex v in a simplicial mesh into an edge e. A vertex split is the inverse operation with respect to an edge collapse. There are two cases: vertex v is an extreme vertex of e (inverse of half-edge collapse) or not (inverse of a full-edge collapse). In the latter case, any simplex incident in v either expands of one dimension and becomes incident in e, or becomes incident in one of the extreme vertices of e. In the former case, only a subset of simplices incident at v are affected by the vertex split, forming the so-called region of influence (specified in the split operation).
    In a 3D modeller, a view indicates a projection of an object according to some planes, typically the main planes of the coordinate reference system. In the product development process, a view is the product information required by a development phase. Since the various phases of the development process have different goals, they require proper digital model and information of the product itself together with proper tools to treat them. It is therefore necessary to transform the model from one point of view to another one.
    virtual human
    Specialized instance of an articulated character. The model can be synthesised in a variety of ways and can represent a real or a virtual person. VHs are characterized by a set of general attributes (sex, nationality, race, ...), and structural descriptors (skeleton, geometry, landmarks, etc..).
    The investigation of how the human visual perception works, and how simulating it artificially.
    An abbreviation for "volume element" or "volume cell." It is the 3D conceptual counterpart of the 2D pixel. Each voxel is a quantum unit of volume and has a numeric value (or values) associated with it that represents some measurable properties or independent variables of the real objects or phenomena.
    Adding a hidden pattern in an image, surface, or sound, that can be checked algorithmically, but is not perceived by the human observer.
    The watershed of a C2-differentiable function f defined over a domain D is the set of points of D which do not belong to any catchment basin.
    water tightness
    In general there are small gaps between the surface elements describing the shells (inner and outer) in a CAD-model. In a simulation model such small gaps are not allowed, the elements constituting the simulation model has to have an exact match, or in other words be water tight.
    Multiresolution representation based on wavelets have been developed for parametric curves and surfaces, meshes and surfaces of arbitrary topology and even for volume data.Wavelets provide a framework to decompose a complex function into a ?coarser? low resolution part, together with a collection of detail coefficients and different resolution levels, all necessary in order to recover the original function
    winged-edge data structure
    It explicitly encodes all entities forming a mesh. For each edge e, the data structure maintains the indices of the two extreme vertices of e of the two faces bounded by e, and of the four edges that are both adjacent to e and are on the boundary of the two faces bounded by e. Vertices and faces are also encoded: for each vertex v, a pointer to any edge incident in v, and for each face f, a pointer to an edge bounding f is maintained.
    The process of merging polygonal meshes generated from different 3D scans of an object into one mesh. Multiple scans are often necessary because the objects measured are self-occluding.



    Browse alphabetically
    A | B | C | D | E | F | G | H | I
    J | K | L | M | N | O | P | Q | R
    S | T | U | V | W | X | Y | Z

    Display all Glossary terms

    Keyword Glossary Search

    Glossary Administration

    373 terms in the Glossary