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

/external/chromium_org/third_party/skia/src/pathops/
H A DSkPathOpsCurve.h153 static void line_intersect_ray(const SkPoint a[2], const SkDLine& ray, SkIntersections* i) { argument
156 i->intersectRay(line, ray);
159 static void quad_intersect_ray(const SkPoint a[3], const SkDLine& ray, SkIntersections* i) { argument
162 i->intersectRay(quad, ray);
165 static void cubic_intersect_ray(const SkPoint a[4], const SkDLine& ray, SkIntersections* i) { argument
168 i->intersectRay(cubic, ray);
H A DSkOpSegment.cpp1791 // intersect ray starting at basePt with edge
1793 // OPTIMIZE: use specialty function that intersects ray with curve,
1794 // returning t values only for curve (we don't care about t on ray)
2692 // draw ray from endSpan.fPt perpendicular to end tangent and measure distance
2695 SkDLine ray;
2698 ray.fPts[0].set(startSpan.fPt);
2701 ray.fPts[0].set(endSpan.fPt);
2704 ray.fPts[1].fX = ray.fPts[0].fX + dxdy.fY;
2705 ray
[all...]
/external/skia/src/pathops/
H A DSkPathOpsCurve.h153 static void line_intersect_ray(const SkPoint a[2], const SkDLine& ray, SkIntersections* i) { argument
156 i->intersectRay(line, ray);
159 static void quad_intersect_ray(const SkPoint a[3], const SkDLine& ray, SkIntersections* i) { argument
162 i->intersectRay(quad, ray);
165 static void cubic_intersect_ray(const SkPoint a[4], const SkDLine& ray, SkIntersections* i) { argument
168 i->intersectRay(cubic, ray);
H A DSkOpSegment.cpp1721 // intersect ray starting at basePt with edge
1723 // OPTIMIZE: use specialty function that intersects ray with curve,
1724 // returning t values only for curve (we don't care about t on ray)
2615 // draw ray from endSpan.fPt perpendicular to end tangent and measure distance
2618 SkDLine ray;
2621 ray.fPts[0].set(startSpan.fPt);
2624 ray.fPts[0].set(endSpan.fPt);
2627 ray.fPts[1].fX = ray.fPts[0].fX + dxdy.fY;
2628 ray
[all...]
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/
H A Dv8-raytrace.js1 // The ray tracer code in this file is written by Adam Burmister. It
9 // JavaScript framework which is used by the ray tracer.
12 // the scene was ray traced correctly.
48 // The rest of this file is the actual ray tracer written by Adam
54 // flog/ray.js
452 intersect: function(ray){
456 var dst = Flog.RayTracer.Vector.prototype.subtract(ray.position, this.position);
458 var B = dst.dot(ray.direction);
466 ray.position,
468 ray
[all...]
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/
H A Dv8-raytrace.js1 // The ray tracer code in this file is written by Adam Burmister. It
9 // JavaScript framework which is used by the ray tracer.
12 // the scene was ray traced correctly.
48 // The rest of this file is the actual ray tracer written by Adam
54 // flog/ray.js
452 intersect: function(ray){
456 var dst = Flog.RayTracer.Vector.prototype.subtract(ray.position, this.position);
458 var B = dst.dot(ray.direction);
466 ray.position,
468 ray
[all...]
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/
H A Dv8-raytrace.js1 // The ray tracer code in this file is written by Adam Burmister. It
9 // JavaScript framework which is used by the ray tracer.
12 // the scene was ray traced correctly.
48 // The rest of this file is the actual ray tracer written by Adam
54 // flog/ray.js
421 intersect: function(ray){
425 var dst = Flog.RayTracer.Vector.prototype.subtract(ray.position, this.position);
427 var B = dst.dot(ray.direction);
435 ray.position,
437 ray
[all...]
/external/chromium_org/v8/benchmarks/
H A Draytrace.js1 // The ray tracer code in this file is written by Adam Burmister. It
9 // JavaScript framework which is used by the ray tracer.
17 // the scene was ray traced correctly.
53 // The rest of this file is the actual ray tracer written by Adam
59 // flog/ray.js
426 intersect: function(ray){
430 var dst = Flog.RayTracer.Vector.prototype.subtract(ray.position, this.position);
432 var B = dst.dot(ray.direction);
440 ray.position,
442 ray
[all...]
/external/chromium_org/third_party/skia/tests/
H A DPathOpsAngleIdeas.cpp509 SkDVector ray = q.ptAtT(smallT) - origin;
511 if (ray.fX * end.fX < 0 || ray.fY * end.fY < 0) {
514 double rayDist = ray.length();
528 SkDVector ray = q.ptAtT(t) - origin;
530 double rayDist = ray.length();
533 double midXray = mid.crossCheck(ray);
658 If the hulls overlap, and have the same general direction, then intersect the shorter end point ray
/external/skia/tests/
H A DPathOpsAngleIdeas.cpp509 SkDVector ray = q.ptAtT(smallT) - origin;
511 if (ray.fX * end.fX < 0 || ray.fY * end.fY < 0) {
514 double rayDist = ray.length();
528 SkDVector ray = q.ptAtT(t) - origin;
530 double rayDist = ray.length();
533 double midXray = mid.crossCheck(ray);
658 If the hulls overlap, and have the same general direction, then intersect the shorter end point ray
/external/chromium_org/native_client_sdk/src/gonacl_appengine/static/bullet/
H A Dscene.js245 var ray = new THREE.Ray( camera.position, vector.subSelf( camera.position ).normalize() );
246 var intersects = ray.intersectObjects( objects );
/external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/src/
H A Dcmssm.c478 cmsLine ray; local
500 // Create a ray line from centre to this point
502 LineOf2Points(&ray, &Lab, &Centre);
522 ClosestLineToLine(&temp, &ray, &edge);
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DthingsToDo.txt128 (or straight up from any point on the segment). This ray is not intersected
146 send a ray from a disjoint point through all other contours
H A DSimplify.cpp759 // FIXME: until I can think of something better, project a ray from the
765 _Line ray; local
773 ray[0] = partVerb == SkPath::kCubic_Verb && part[0].approximatelyEqual(part[1]) ?
775 ray[1].x = (part[0].x + part[partVerb].x) / 2;
776 ray[1].y = (part[0].y + part[partVerb].y) / 2;
777 SkASSERT(ray[0] != ray[1]);
778 roots = (*SegmentRayIntersect[fVerb])(fPts, ray, i);
779 rroots = (*SegmentRayIntersect[rh.fVerb])(rh.fPts, ray, ri);
795 dx = loc.x - ray[
[all...]
/external/skia/experimental/Intersection/
H A DthingsToDo.txt128 (or straight up from any point on the segment). This ray is not intersected
146 send a ray from a disjoint point through all other contours
H A DSimplify.cpp759 // FIXME: until I can think of something better, project a ray from the
765 _Line ray; local
773 ray[0] = partVerb == SkPath::kCubic_Verb && part[0].approximatelyEqual(part[1]) ?
775 ray[1].x = (part[0].x + part[partVerb].x) / 2;
776 ray[1].y = (part[0].y + part[partVerb].y) / 2;
777 SkASSERT(ray[0] != ray[1]);
778 roots = (*SegmentRayIntersect[fVerb])(fPts, ray, i);
779 rroots = (*SegmentRayIntersect[rh.fVerb])(rh.fPts, ray, ri);
795 dx = loc.x - ray[
[all...]

Completed in 1557 milliseconds