Definition and Basic Properties(定义和基本属性)(155) 2. Computing the Voronoi Diagram(计算 Voronoi 图)(158) 3. Voronoi Diagrams of Line Segments(线段Voronoi图)(167) 4. Farthest-Point Voronoi Diagrams(最远点 Voronoi 图)(170) 5. Notes and Comments(注释和评论)(174) 8. Arrangements and ...
perform T-duality of vector fields linear in coordinates.We show that gauge fields A_a~Nand A_i~Dare T-dual to A_D~aand A_N~irespectively.We introduce the field strength of T-dual non-geometric theories as derivatives of T-dual gauge fields along both T-dual variable y_渭and its ...
Linear operations Dot product Definition Properties Cross product Definition Properties Exercises Line intersection Planes intersection Finding the equation of a line for a segment Intersection Point of Lines Check if two segments intersect Intersection of Segments Circle-Line Intersection Circle...
The problem of packing of equal disks (or circles) into a rectangle is a fundamental geometric problem. (By a packing here we mean an arrangement of disks
AffineTransformation3D—The 3D version of AffineTransformation2D is a 4x4 matrix and supports definition of general affine transformations from control points. It will not determine conformal affine transformations. Using an affine transformation The following code example uses an affine transformation to tr...
Definition of Affine Geometry by a Group of Transformations point of view, about an affine plane, in order to be able to describe its points by pairs of elements of a field, and its lines by linear ... J Lipman - 《Canadian Mathematical Bulletin》 被引量: 8发表: 1961年 ...
TermDefinition Overlay A data structure representing a type of vertex data applied to a mesh.These types include: vertex color, normal, tangent, and UV. Multiple values of the specified type can be stored at a single vertex. In such cases, depending on the type, one of the following occurs...
One method for doing that is to obtain a skeletal representation of the region using some linear skeletonization algorithm and find the shapes of the sections at several points along this skeleton. However, with this method, it is difficult to generate completely a representation like Figure 4.20(...
(1996)] are generalized from the framework of ideal polyhedra in The basic objects studied are the canonical The basic tools, in addition to the results of [Rivin, Ann. of Math. 139 (1994)] and combinatorial geometry are methods of combinatorial optimization—linear programming and network flow...
Up to closure, we may assume that this factor is a linear form, so there are \left( {\begin{array}{c}d\\ 2\end{array}}\right) -1+2 degrees of freedom. This shows that the family of nonreduced curves A has codimension 2d-1=\bigl (\left( {\begin{array}{c}d+2\\ 2\end{...