| /external/ImageMagick/www/source/ |
| thresholds.xml | 178 <description>Halftone 4x4 (orthogonal)</description>
188 <description>Halftone 6x6 (orthogonal)</description>
200 <description>Halftone 8x8 (orthogonal)</description>
219 <description>Halftone 16x16 (orthogonal)</description>
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| BiDiagonalTransformer.java | 26 * A = U × B × V<sup>T</sup> with U an m × m orthogonal matrix,
28 * otherwise), and V an n × n orthogonal matrix.</p>
85 * <p>U is an orthogonal matrix, i.e. its transpose is also its inverse.</p>
166 * <p>V is an orthogonal matrix, i.e. its transpose is also its inverse.</p>
|
| FieldVector.java | 225 /** Find the orthogonal projection of this vector onto another vector.
233 /** Find the orthogonal projection of this vector onto another vector.
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| HessenbergDecomposition.h | 32 * \brief Reduces a square matrix to Hessenberg form by an orthogonal similarity transformation
37 * the real case, the Hessenberg decomposition consists of an orthogonal
39 * Q^T \f$. An orthogonal matrix is a matrix whose inverse equals its
218 /** \brief Reconstructs the orthogonal matrix Q in the decomposition
|
| RealSchur.h | 30 * decomposition: \f$ A = U T U^T \f$ where U is a real orthogonal matrix and
31 * T is a real quasi-triangular matrix. An orthogonal matrix is a matrix whose
115 /** \brief Returns the orthogonal matrix in the Schur decomposition.
172 * \param[in] matrixQ orthogonal matrix Q that transform a matrix A to H : A = Q H Q^T
182 * NOTE Q is referenced if computeU is true; so, if the initial orthogonal matrix
|
| /external/jsr330/src/javax/inject/ |
| Scope.java | 53 * <li>is typically not {@code @Inherited}, so scoping is orthogonal to
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/ |
| btConvexConvexAlgorithm.h | 38 ///Multiple contact points are calculated by perturbing the orientation of the smallest object orthogonal to the separating normal.
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletDynamics/ConstraintSolver/ |
| btHinge2Constraint.cpp | 26 // axis1 must be orthogonal to axis2
|
| btPoint2PointConstraint.h | 59 btJacobianEntry m_jac[3]; //3 orthogonal linear constraints
|
| btUniversalConstraint.cpp | 29 // axis1 must be orthogonal to axis2
|
| btHingeConstraint.h | 56 btJacobianEntry m_jac[3]; //3 orthogonal linear constraints
57 btJacobianEntry m_jacAng[3]; //2 orthogonal angular constraints+ 1 for limit/motor
|
| /external/libgdx/gdx/src/com/badlogic/gdx/graphics/g3d/decals/ |
| SimpleOrthoGroupStrategy.java | 26 * Minimalistic grouping strategy useful for orthogonal scenes where the camera faces the negative z axis. Handles enabling and
|
| /external/llvm/lib/Transforms/Utils/ |
| Mem2Reg.cpp | 45 // This is a cluster of orthogonal Transforms
|
| UnifyFunctionExitNodes.cpp | 37 // This is a cluster of orthogonal Transforms
|
| /external/mesa3d/src/gallium/drivers/softpipe/ |
| sp_tex_sample.h | 137 /* Create a sampler variant for a given set of non-orthogonal state. Currently the
|
| /external/skia/samplecode/ |
| SampleTextureDomain.cpp | 92 // orthogonal rects. It also tests the nullptr src rect handling
|
| /external/opencv3/3rdparty/openexr/Imath/ |
| ImathVecAlgo.h | 68 template <class Vec> Vec orthogonal (const Vec &s, const Vec &t);
103 orthogonal (const Vec &s, const Vec &t) function in namespace:Imath
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/geometry/ |
| Vector3D.java | 293 /** Get a vector orthogonal to the instance.
294 * <p>There are an infinite number of normalized vectors orthogonal
302 * Vector3D i = k.orthogonal();
305 * @return a new normalized vector orthogonal to the instance
308 public Vector3D orthogonal() { method in class:Vector3D
|
| Rotation.java | 192 * <p>Rotation matrices are orthogonal matrices, i.e. unit matrices
195 * 1, among the orthogonal 3X3 matrices, only the ones having a
201 * orthogonal anymore. This constructor handles this case
215 * matrix, or if it cannot be transformed into an orthogonal matrix
217 * orthogonal matrix is negative
231 // compute a "close" orthogonal matrix
441 * is orthogonal to the (u, v) plane). If u and v are colinear, an
459 // an arbitrary vector orthogonal to u
460 Vector3D w = u.orthogonal();
467 // the shortest possible rotation: axis orthogonal to this plan
[all...] |
| /external/eigen/Eigen/src/Core/ |
| Dot.h | 219 /** \returns true if *this is approximately orthogonal to \a other,
237 * type is real numbers, a unitary matrix is an orthogonal matrix, whence the name.
|
| /development/tools/mkstubs/ |
| README.txt | 76 This is not orthogonal to the fact that private fields and methods are automatically
|
| /external/chromium-trace/catapult/telemetry/docs/pydoc/ |
| telemetry.internal.image_processing.cv_util.html | 30 <td width="100%"><dl><dt><a name="-AreLinesOrthogonal"><strong>AreLinesOrthogonal</strong></a>(line1, line2, tolerance)</dt><dd><tt>Returns true if lines are within tolerance radians of being orthogonal.</tt></dd></dl>
|
| /external/llvm/lib/Target/AArch64/MCTargetDesc/ |
| AArch64ELFStreamer.cpp | 85 /// As a result this system is orthogonal to the DataRegion infrastructure used
|
| /external/llvm/lib/Target/X86/Disassembler/ |
| X86Disassembler.h | 48 // the main opcode. This is orthogonal from its meaning (an GPR or an XMM
|
| /external/mesa3d/src/mesa/math/ |
| m_matrix.h | 65 MATRIX_3D_NO_ROT, /**< orthogonal projection and others... */
|
