OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:minT1
(Results
1 - 4
of
4
) sorted by null
/external/chromium_org/third_party/skia/experimental/Intersection/
CubicConvexHull.cpp
28
double
minT1
, minT2, maxT1, maxT2;
29
if (!bezier_clip(cubic2, cubic1,
minT1
, maxT1)) {
36
if (maxT1 -
minT1
< maxT2 - minT2) {
40
split = maxT1 -
minT1
> tClipLimit;
42
minT1
= 0;
46
return chop(
minT1
, maxT1, minT2, maxT2, split);
51
bool intersect(double
minT1
, double maxT1, double minT2, double maxT2) {
54
sub_divide(cubic1,
minT1
, maxT1, intersections.swapped() ? larger : smaller);
71
lineTs.fT[1][0] = interp(
minT1
, maxT1, lineTs.fT[1][0]);
73
lineTs.fT[0][0] = interp(
minT1
, maxT1, lineTs.fT[0][0])
[
all
...]
QuadraticIntersection.cpp
31
double
minT1
, minT2, maxT1, maxT2;
32
if (!bezier_clip(quad2, quad1,
minT1
, maxT1)) {
41
if (maxT1 -
minT1
< maxT2 - minT2) {
45
split = maxT1 -
minT1
> tClipLimit;
47
minT1
= 0;
51
return chop(
minT1
, maxT1, minT2, maxT2, split);
56
bool intersect(double
minT1
, double maxT1, double minT2, double maxT2) {
57
bool t1IsLine = maxT1 -
minT1
<= quad1Divisions;
60
return intersectAsLine(
minT1
, maxT1, minT2, maxT2, t1IsLine, t2IsLine);
64
sub_divide(quad1,
minT1
, maxT1, intersections.swapped() ? larger : smaller)
[
all
...]
/external/skia/experimental/Intersection/
CubicConvexHull.cpp
28
double
minT1
, minT2, maxT1, maxT2;
29
if (!bezier_clip(cubic2, cubic1,
minT1
, maxT1)) {
36
if (maxT1 -
minT1
< maxT2 - minT2) {
40
split = maxT1 -
minT1
> tClipLimit;
42
minT1
= 0;
46
return chop(
minT1
, maxT1, minT2, maxT2, split);
51
bool intersect(double
minT1
, double maxT1, double minT2, double maxT2) {
54
sub_divide(cubic1,
minT1
, maxT1, intersections.swapped() ? larger : smaller);
71
lineTs.fT[1][0] = interp(
minT1
, maxT1, lineTs.fT[1][0]);
73
lineTs.fT[0][0] = interp(
minT1
, maxT1, lineTs.fT[0][0])
[
all
...]
QuadraticIntersection.cpp
31
double
minT1
, minT2, maxT1, maxT2;
32
if (!bezier_clip(quad2, quad1,
minT1
, maxT1)) {
41
if (maxT1 -
minT1
< maxT2 - minT2) {
45
split = maxT1 -
minT1
> tClipLimit;
47
minT1
= 0;
51
return chop(
minT1
, maxT1, minT2, maxT2, split);
56
bool intersect(double
minT1
, double maxT1, double minT2, double maxT2) {
57
bool t1IsLine = maxT1 -
minT1
<= quad1Divisions;
60
return intersectAsLine(
minT1
, maxT1, minT2, maxT2, t1IsLine, t2IsLine);
64
sub_divide(quad1,
minT1
, maxT1, intersections.swapped() ? larger : smaller)
[
all
...]
Completed in 158 milliseconds