Searched refs:angles (Results 1 - 16 of 16) sorted by relevance

/external/chromium-trace/catapult/telemetry/telemetry/internal/image_processing/
H A Dcv_util.py23 # If the difference between the angles is more than pi/2 - tolerance, the
57 angles = np.arctan2(lines[:, 1] - lines[:, 3], lines[:, 0] - lines[:, 2])
58 xoffsets = half_length * np.cos(angles)
59 yoffsets = half_length * np.sin(angles)
H A Dscreen_finder.py60 _anglesp5, _anglesm5: The angles for each point we look at in the grid
450 # The angles for each point we look at in the grid when computing
456 angles = np.arctan2(vectors[:, 1], vectors[:, 0]) + np.pi
457 self._anglesp5 = angles + self.SMALL_ANGLE
458 self._anglesm5 = angles - self.SMALL_ANGLE
/external/vulkan-validation-layers/libs/glm/gtx/
H A Deuler_angles.hpp34 /// @brief Build matrices from Euler angles.
72 /// Creates a 3D 4 * 4 homogeneous rotation matrix from euler angles (X * Y).
79 /// Creates a 3D 4 * 4 homogeneous rotation matrix from euler angles (Y * X).
86 /// Creates a 3D 4 * 4 homogeneous rotation matrix from euler angles (X * Z).
93 /// Creates a 3D 4 * 4 homogeneous rotation matrix from euler angles (Z * X).
100 /// Creates a 3D 4 * 4 homogeneous rotation matrix from euler angles (Y * Z).
107 /// Creates a 3D 4 * 4 homogeneous rotation matrix from euler angles (Z * Y).
114 /// Creates a 3D 4 * 4 homogeneous rotation matrix from euler angles (Y * X * Z).
122 /// Creates a 3D 4 * 4 homogeneous rotation matrix from euler angles (Y * X * Z).
140 /// Creates a 3D 3 * 3 rotation matrix from euler angles (
[all...]
/external/eigen/unsupported/Eigen/src/EulerAngles/
H A DEulerAngles.h24 * \brief Represents a rotation in a 3 dimensional space as three Euler angles.
26 * Euler rotation is a set of three rotation of three angles over three fixed axes, defined by the EulerSystem given as a template parameter.
28 * Here is how intrinsic Euler angles works:
33 * \note This class support only intrinsic Euler angles for simplicity,
39 * by Euler angles, but there is no singular representation (e.g. unlike rotation matrices).
43 * Euler angles usually used for:
48 * However, Euler angles are slow comparing to quaternion or matrices,
57 * #### Euler angles ranges in conversions ####
59 * When converting some rotation to Euler angles, there are some ways you can guarantee
60 * the Euler angles range
212 const Vector3& angles() const { return m_angles; } function in class:Eigen::EulerAngles
214 Vector3& angles() { return m_angles; } function in class:Eigen::EulerAngles
[all...]
H A DEulerSystem.h83 * - both tait bryan and proper/classic Euler angles (i.e. the opposite).
101 * just use the equal intrinsic opposite order for axes and angles.
102 * I.e axes (A,B,C) becomes (C,B,A), and angles (a,b,c) becomes (c,b,a).
111 * More information about Euler angles: https://en.wikipedia.org/wiki/Euler_angles
235 // With a=(0,1,0), we have i=0; j=1; k=2, and after computing the first two angles,
279 res.angles(), mat,
/external/mesa3d/src/gallium/state_trackers/vega/
H A Dbezier.c447 float angles[2]; local
480 angles[i] = acos(cos_a)/M_PI;
483 if (angles[0] + angles[1] > 1.) {
487 angles[0] = 1. - angles[0];
488 angles[1] = 1. - angles[1];
502 float kappa = 2.*KAPPA * sign * offset * angles[i];
/external/eigen/unsupported/test/
H A DEulerAngles.cpp79 Vector3 eabis = EulerAnglesType(m, positiveRangeAlpha, positiveRangeBeta, positiveRangeGamma).angles();
93 // Saturate the angles to the correct range
120 eabis = EulerAnglesType(q, positiveRangeAlpha, positiveRangeBeta, positiveRangeGamma).angles();
121 VERIFY_IS_APPROX(eabis, eabis2);// Verify that the euler angles are still the same
182 // Check with random angles in range [0:pi]x[-pi:pi]x[-pi:pi].
/external/eigen/bench/btl/data/
H A Dgnuplot_common_settings.hh18 set angles radians
/external/eigen/demos/opengl/
H A Dquaternion_demo.cpp59 static const float angles [10] = { local
83 Vector3f newC = c + ( (AngleAxisf(angles[j*2+1], ax0)
84 * AngleAxisf(angles[j*2+0] * (l==1 ? 0.35 : 0.5), ax1)) * ax0)
188 // Euler angles slerp
610 but = new QRadioButton("euler angles");
613 but->setToolTip("use Euler angles to interpolate orientations");
/external/ImageMagick/www/api/
H A Dshear.php141 <p>ShearRotateImage() creates a new image that is a rotated copy of an existing one. Positive angles rotate counter-clockwise (right-hand rule), while negative angles rotate clockwise. Rotated images are usually larger than the originals and have 'empty' triangular corners. X axis. Empty triangles left over from shearing the image are filled with the background color defined by member 'background_color' of the image. ShearRotateImage allocates the memory necessary for the new Image structure and returns a pointer to the new image.</p>
H A Ddistort.php158 <p>RotateImage() creates a new image that is a rotated copy of an existing one. Positive angles rotate counter-clockwise (right-hand rule), while negative angles rotate clockwise. Rotated images are usually larger than the originals and have 'empty' triangular corners. X axis. Empty triangles left over from shearing the image are filled with the background color defined by member 'background_color' of the image. RotateImage allocates the memory necessary for the new Image structure and returns a pointer to the new image.</p>
H A Dfeature.php141 <p>Use HoughLineImage() in conjunction with any binary edge extracted image (we recommand Canny) to identify lines in the image. The algorithm accumulates counts for every white pixel for every possible orientation (for angles from 0 to 179 in 1 degree increments) and distance from the center of the image to the corner (in 1 px increments) and stores the counts in an accumulator matrix of angle vs distance. The size of the accumulator is 180x(diagonal/2). Next it searches this space for peaks in counts and converts the locations of the peaks to slope and intercept in the normal x,y input image space. Use the slope/intercepts to find the endpoints clipped to the bounds of the image. The lines are then drawn. The counts are a measure of the length of the lines</p>
H A Dmorphology.php148 <dd> Blur:{radius},{sigma}[,{angle}] Generates a 1 dimensional or linear gaussian blur, at the angle given (current restricted to orthogonal angles). If a 'radius' is given the kernel is clipped to a width of 2*radius+1. Kernel can be rotated by a 90 degree angle. </dd>
/external/skia/src/pathops/
H A DSkPathOpsDebug.cpp1392 SkTDArray<const SkOpAngle*>(angles);
1395 angles.push(next);
1400 SkASSERT_RELEASE(!angles.contains(next));
/external/robolectric/v3/runtime/
H A Dandroid-all-5.0.0_r2-robolectric-1.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/android/ com/google/android/collect/ ...
H A Dandroid-all-5.1.1_r9-robolectric-1.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/android/ com/google/android/collect/ ...

Completed in 530 milliseconds