DIRECTORY
RealFns,
GGAngle,
GGModelTypes,
GGVector,
GGLines;

GGLinesImpl: CEDAR PROGRAM
IMPORTS RealFns, GGAngle, GGVector
EXPORTS GGLines =

BEGIN


Point: TYPE = GGModelTypes.Point;
Edge: TYPE = REF EdgeObj;
EdgeObj: TYPE = GGModelTypes.EdgeObj;
Line: TYPE = REF LineObj;
LineObj: TYPE = GGModelTypes.LineObj;
Ray: TYPE = REF RayObj;
RayObj: TYPE = GGModelTypes.RayObj;
Vector: TYPE = GGModelTypes.Vector;

CreateEmptyLine: PUBLIC PROC RETURNS [line: Line] = {
line _ NEW[LineObj];
};

CopyLine: PUBLIC PROC [from: Line, to: Line] = {
to.c _ from.c;
to.s _ from.s;
to.theta _ from.theta;
to.d _ from.d;
to.slope _ from.slope;
to.yInt _ from.yInt;
};

FillLineFromPoints: PUBLIC PROC [v1, v2: Point, line: Line] = {
epsilon: REAL = 1.0e-5; -- changed from 1.0e-6 on August 13, 1985 6:29:49 pm PDT by Bier
x2Minusx1: REAL _ v2[1] - v1[1];
y2Minusy1: REAL _ v2[2] - v1[2];
IF ABS[x2Minusx1] < epsilon THEN {-- vertical line
IF v2[2] > v1[2] THEN {-- line goes up
line.theta _ 90.0;
line.s _ 1;
line.d _ -v1[1]}
ELSE { -- line goes down
line.theta _ -90;
line.s _ -1;
line.d _ v1[1]};
line.c _ 0;
}
ELSE {
line.slope _ y2Minusy1/x2Minusx1;
line.theta _ RealFns.ArcTanDeg[y2Minusy1, x2Minusx1];
line.c _ RealFns.CosDeg[line.theta];
line.s _ line.slope*line.c;-- gets around inaccuracies in the trig functions to make sure the line has the right slope.  (also saves some time)
line.d _ v1[2]*line.c - v1[1]*line.s;
line.yInt _ line.d/line.c;
};
}; -- end of FillLineFromPoints

FillLineFromPointAndVector: PUBLIC PROC [pt: Point, vec: Vector, line: Line] = {
pt2: Point;
pt2 _ GGVector.Add[pt, vec];
FillLineFromPoints[pt, pt2, line];
};

FillLineFromCoefficients: PUBLIC PROC [sineOfTheta, cosineOfTheta, distance: REAL, line: Line] = {
line.s _ sineOfTheta;
line.c _ cosineOfTheta;
line.d _ distance;
line.theta _ RealFns.ArcTanDeg[sineOfTheta, cosineOfTheta];
IF cosineOfTheta # 0 THEN {
line.slope _ sineOfTheta/cosineOfTheta;
line.yInt _ line.d/line.c};
}; -- end of FillLineFromCoefficients

FillLineFromPointAndAngle: PUBLIC PROC [pt: Point, degrees: REAL, line: Line] = {
direction: Vector;
direction _ GGVector.VectorFromAngle[degrees];
FillLineFromPointAndVector[pt, direction, line];
}; -- end of FillLineFromPointAndAngle

FillLineAsNormal: PUBLIC PROC [line: Line, pt: Point, normalLine: Line] = {
normalLine.s _ line.c;
normalLine.c _ -line.s;
normalLine.d _ -pt[2]*line.s - pt[1]*line.c;
normalLine.theta _ GGAngle.Add[line.theta, 90];
IF normalLine.c #0 THEN {
normalLine.slope _ normalLine.s/normalLine.c;
line.yInt _ normalLine.d/normalLine.c};
}; -- end of FillLineAsNormal

FillLineLeftOfLine: PUBLIC PROC [line: Line, dist: REAL, parallelLine: Line] = {
parallelLine.s _ line.s;
parallelLine.c _ line.c;
parallelLine.d _ line.d + dist;
parallelLine.theta _ line.theta;
parallelLine.slope _ line.slope;
};

FillLineRightOfLine: PUBLIC PROC [line: Line, dist: REAL, parallelLine: Line] = {
parallelLine.s _ line.s;
parallelLine.c _ line.c;
parallelLine.d _ line.d - dist;
parallelLine.theta _ line.theta;
parallelLine.slope _ line.slope;
};

LineFromPoints: PUBLIC PROC [v1, v2: Point] RETURNS [line: Line] = {
line _ CreateEmptyLine[];
FillLineFromPoints[v1, v2, line];
};
LineFromPointAndVector: PUBLIC PROC [pt: Point, vec: Vector] RETURNS [line: Line] = {
pt2: Point;
pt2 _ GGVector.Add[pt, vec];
line _ LineFromPoints[pt, pt2];
};
LineFromCoefficients: PUBLIC PROC [sineOfTheta, cosineOfTheta, distance: REAL] RETURNS [line: Line] = {
line _ CreateEmptyLine[];
FillLineFromCoefficients[sineOfTheta, cosineOfTheta, distance, line];
};
LineFromPointAndAngle: PUBLIC PROC  [pt: Point, degrees: REAL] RETURNS [line: Line] = {
line _ CreateEmptyLine[];
FillLineFromPointAndAngle[pt, degrees, line];
};

LineNormalToLineThruPoint: PUBLIC PROC [line: Line, pt: Point] RETURNS [normalLine: Line] = {
normalLine _ CreateEmptyLine[];
FillLineAsNormal[line, pt, normalLine];
};

LineLeftOfLine: PUBLIC PROC [line: Line, dist: REAL] RETURNS [parallelLine: Line] = {
parallelLine _ CreateEmptyLine[];
FillLineLeftOfLine[line, dist, parallelLine];
};

LineRightOfLine: PUBLIC PROC [line: Line, dist: REAL] RETURNS [parallelLine: Line] = {
parallelLine _ CreateEmptyLine[];
FillLineRightOfLine[line, dist, parallelLine];
};

LineMeetsLine: PUBLIC PROC [line1, line2: Line] RETURNS [intersection: Point, parallel: BOOL] = {
determinant: REAL;
IF line1.theta = line2.theta THEN {parallel _ TRUE; RETURN};
parallel _ FALSE;
determinant _ line2.s*line1.c - line1.s*line2.c;
IF determinant = 0 THEN {parallel _ TRUE; RETURN};
intersection[1] _ (line2.c*line1.d - line1.c*line2.d)/determinant;
intersection[2] _ (line2.s*line1.d - line1.s*line2.d)/determinant;
};
LineMeetsYAxis: PUBLIC PROC [line: Line] RETURNS [yInt: REAL, parallel: BOOL] = {
IF line.theta = 90 OR line.theta = -90 THEN parallel _ TRUE
ELSE {-- we just want the y Intercept which is calculated at line creation time for now.
parallel _ FALSE;
yInt _ line.yInt;}
};
LineMeetsEdge: PUBLIC PROC [line: Line, edge: Edge] RETURNS [intersection: Point, noHit: BOOL] = {
};

SignedLineDistance: PUBLIC PROC [pt: Point, line: Line] RETURNS [d: REAL] = {
d _ pt[2]*line.c - pt[1]*line.s - line.d;
}; -- SignedLineDistance

LineDistance: PUBLIC PROC [pt: Point, line: Line] RETURNS [d: REAL] = {
d _ ABS[pt[2]*line.c - pt[1]*line.s - line.d];
}; -- LineDistance


PointProjectedOntoLine: PUBLIC PROC [pt: Point, line: Line] RETURNS [projectedPt: Point] = {
D: REAL _ pt[2]*line.c - pt[1]*line.s - line.d;
projectedPt[1] _ pt[1] + D*line.s;
projectedPt[2] _ pt[2] - D*line.c;
};

PointOnLine: PUBLIC PROC [line: Line] RETURNS [pt: Point] = {
IF ABS[line.c] > ABS[line.s] THEN {
pt[1] _ 0.0;
pt[2] _ line.d/line.c;
}
ELSE {
pt[2] _ 0.0;
pt[1] _ -line.d/line.s;
};
};
DirectionOfLine: PUBLIC PROC [line: Line] RETURNS [direction: Vector] = {
direction[1] _ line.c;
direction[2] _ line.s;
};



CreateEdge: PUBLIC PROC [v1, v2: Point] RETURNS [edge: Edge] = {
edge _ CreateEmptyEdge[];
FillEdge[v1, v2, edge];
}; -- end of CreateEdge
CreateEmptyEdge: PUBLIC PROC RETURNS [edge: Edge] = {
edge _ NEW[EdgeObj];
edge.line _ CreateEmptyLine[];
};
FillEdge: PUBLIC PROC [v1, v2: Point, edge: Edge] = {
y2Minusy1: REAL;
FillLineFromPoints[v1, v2, edge.line];
y2Minusy1 _ v2[2] - v1[2];
IF y2Minusy1 = 0 THEN 
IF v2[1] > v1[1] THEN {edge.end _ v2; edge.start _ v1; edge.startIsFirst _ TRUE}
ELSE {edge.end _ v1; edge.start _ v2; edge.startIsFirst _ FALSE}
ELSE
IF v2[2] > v1[2] THEN {edge.end _ v2; edge.start _ v1; edge.startIsFirst _ TRUE}
ELSE {edge.end _ v1; edge.start _ v2; edge.startIsFirst _ FALSE};
}; -- end of FillEdge
CopyEdge: PUBLIC PROC [from: Edge, to: Edge] = {
CopyLine[from.line, to.line];
to.start _ from.start;
to.end _ from.end;
to.startIsFirst _ from.startIsFirst;
}; -- end of CopyEdge
LinePointOnEdge: PUBLIC PROC [pt: Point, edge: Edge] RETURNS [BOOL] = {
IF ABS[edge.end[1] - edge.start[1]] >= ABS[edge.end[2] - edge.start[2]] THEN  -- line is more horizontal
RETURN[Between[pt[1], edge.start[1], edge.end[1]]]
ELSE -- line is more vertical
RETURN[Between[pt[2], edge.start[2], edge.end[2]]];
}; -- end of LinePointOnEdge

NearestEndpoint: PUBLIC PROC [pt: Point, edge: Edge] RETURNS [endpoint: Point] = {
BEGIN
IF ABS[pt[1]-edge.start[1]] <= ABS[pt[1]-edge.end[1]] THEN
IF ABS[pt[2]-edge.start[2]] <= ABS[pt[2]-edge.end[2]] THEN RETURN[edge.start]
ELSE GOTO DoMath
ELSE
IF ABS[pt[2]-edge.start[2]] > ABS[pt[2]-edge.end[2]] THEN RETURN[edge.end]
ELSE GOTO DoMath;
EXITS
DoMath => IF DistanceSquaredPointToPoint[pt, edge.start] <
 DistanceSquaredPointToPoint[pt, edge.end]
 THEN endpoint _ edge.start
 ELSE endpoint _ edge.end;
END;
};
DistanceSquaredToNearestEndpoint: PUBLIC PROC [pt: Point, edge: Edge] RETURNS [distanceSquared: REAL] = {
distance2ToPLo, distance2ToPHi: REAL;
distance2ToPLo _ DistanceSquaredPointToPoint[pt, edge.start];
distance2ToPHi _ DistanceSquaredPointToPoint[pt, edge.end];
RETURN[MIN[distance2ToPLo, distance2ToPHi]];
};

NearestPointOnEdge: PUBLIC PROC [pt: Point, edge: Edge] RETURNS [onEdge: Point] = {
projectedPt: Point _ PointProjectedOntoLine[pt, edge.line];
IF LinePointOnEdge[projectedPt, edge] THEN onEdge _ projectedPt
ELSE onEdge _ NearestEndpoint[pt, edge];
};

DistancePointToEdge: PUBLIC PROC [pt: Point, edge: Edge] RETURNS [distance: REAL] = {
projectedPt: Point _ PointProjectedOntoLine[pt, edge.line];
nearEndpoint: Point;
IF LinePointOnEdge[projectedPt, edge] THEN distance _ ABS[LineDistance[pt, edge.line]]
ELSE {
nearEndpoint _ NearestEndpoint[pt, edge];
distance _ DistancePointToPoint[pt, nearEndpoint];
};
};

DistanceSquaredPointToEdge: PUBLIC PROC [pt: Point, edge: Edge] RETURNS [distanceSquared: REAL] = {
projectedPt: Point _ PointProjectedOntoLine[pt, edge.line];
IF LinePointOnEdge[projectedPt, edge]
THEN {distanceSquared _ LineDistance[pt, edge.line];
 distanceSquared _ distanceSquared*distanceSquared}
ELSE distanceSquared _ DistanceSquaredToNearestEndpoint[pt, edge];
};


DistancePointToPoint: PUBLIC PROC [p1, p2: Point] RETURNS [distance: REAL] = {
distance _ RealFns.SqRt[(p2[2]-p1[2])*(p2[2]-p1[2]) + (p2[1]-p1[1])*(p2[1]-p1[1])];
};
DistanceSquaredPointToPoint: PUBLIC PROC [p1, p2: Point] RETURNS [distance: REAL] = {
distance _ (p2[2]-p1[2])*(p2[2]-p1[2]) + (p2[1]-p1[1])*(p2[1]-p1[1]);
};
PointLeftOfLine: PUBLIC PROC [distance: REAL, pOnLine: Point, line: Line] RETURNS [point: Point] = {

lineParallel, linePerp: Line;
parallel: BOOL;
lineParallel _ CreateEmptyLine[];
linePerp _ CreateEmptyLine[];
FillLineFromCoefficients[line.s, line.c, line.d + distance, lineParallel];
FillLineAsNormal[line, pOnLine, linePerp];
[point, parallel] _ LineMeetsLine[lineParallel, linePerp];
IF parallel THEN ERROR; -- perpendicular lines are not parallel
};

CreateRay: PUBLIC PROC [basePoint: Point, direction: Vector] RETURNS [ray: Ray] = {
ray _ NEW[RayObj _ [basePoint, direction]];
};

CreateRayFromPoints: PUBLIC PROC [p1, p2: Point] RETURNS [ray: Ray] = {
ray _ NEW[RayObj _ [p1, GGVector.Sub[p2, p1]]];
};

LineRayMeetsBox: PUBLIC PROC [ray: Ray, xmin, ymin, xmax, ymax: REAL] RETURNS [count: NAT, params: ARRAY[1..2] OF REAL] = {
almostZero: REAL _ 1.0e-12;
x, y, t: REAL;
count _ 0;
IF ABS[ray.d[2]] > almostZero THEN { -- intersection occurs
t _ (ymax-ray.p[2])/ray.d[2];
x _ ray.p[1] + t*ray.d[1];
IF x >=xmin AND x<= xmax THEN { -- hits box
count _ count + 1;
params[count] _ t;
};
t _ (ymin-ray.p[2])/ray.d[2];
x _ ray.p[1] + t*ray.d[1];
IF x >=xmin AND x<= xmax THEN { -- hits box
count _ count + 1;
params[count] _ t;
};
};
IF ABS[ray.d[1]] > almostZero THEN { -- intersection occurs
t _ (xmax-ray.p[1])/ray.d[1];
y _ ray.p[2] + t*ray.d[2];
IF y >=ymin AND y<= ymax THEN { -- hits box
count _ count + 1;
params[count] _ t;
};
t _ (xmin-ray.p[1])/ray.d[1];
y _ ray.p[2] + t*ray.d[2];
IF y >=ymin AND y<= ymax THEN { -- hits box
count _ count + 1;
params[count] _ t;
};
};
IF count = 2 THEN {
IF params[2] <  params[1] THEN {
temp: REAL _ params[1];
params[1] _ params[2];
params[2] _ temp;
};
}; -- make sure hits are sorted
}; -- end of LineRayMeetsBox

EvalRay: PUBLIC PROC [ray: Ray, param: REAL] RETURNS [point: Point] = {
point[1] _ ray.p[1] + param*ray.d[1];
point[2] _ ray.p[2] + param*ray.d[2];
};


Between: PRIVATE PROC [test, a, b: REAL] RETURNS [BOOL] = {
SELECT a FROM
< b => RETURN [a <= test AND test <= b];
= b => RETURN [test = b];
> b => RETURN [b <= test AND test <= a];
ENDCASE => ERROR;
};

END.

tFile: GGLinesImpl.mesa
Author: Eric Bier on June 4, 1985 5:04:38 pm PDT
Last edited by Bier on October 1, 1985 5:39:22 pm PDT
Contents:  Routines for finding the intersections of various types of lines and line segments in Gargoyle.
Recall y*c - x*s - d = 0;
Calculates the different parts of a line given an ordered pair of points (the tail and the head).  Trig lines are directed in sense since 0 <= line.theta <= 180implies that v1 is lower than or to the right of) v2.
we have -x*s = d. where s = 1. Plug in v1.  -v1[1]*s = d
we have -x*s = d. where s = -1. Plug in v1.  -v1[1]*s = d
line.slope and line.yInt are meaningless.  Leave them uninitialized.
s, c, theta, d, slope, yInt
line.s _ RealFns.SinDeg[line.theta];
d _ y1c - x1s.  Subsitute in a point to find d.
recall y*c - x*s - d = 0;
Calculates the different parts of a line given c, s and d.
If line is not vertical we can find its slope and y intercept.
y intercept occurs when x = 0, ie when y*c = d.  y = d/c;
Find a line which is perpendicular to "line" and passes thru "pt".  Useful for dropping perpendiculars.
If line has the form: y*cos(theta) - x*sin(theta) - d = 0, then normalLine will have the form:
y*cos(theta+90) - x*sin(theta+90) - D = 0;
or -y*sin(theta) - (x*cos(theta)) - D = 0;
to find D, we substitute in pt:
D = -pt[2]*sin(theta) - pt[1]*cos(theta);
y intercept occurs when x = 0, ie when y*c = d.  y = d/c;
If line1 is of the form: c1*y - s1*x - d1 = 0;
and line2 of the form: c2*y - s2*x - d2 = 0;
then we solve simultaneously.
c1c2*y - s1c2*x - c2d1 = 0
c1c2*y - c1s2*x - c1d2 = 0
(-s1c2+c1s2)*x - c2d1 + c1d2 = 0;
x = (c2d1 - c1d2)/(s2c1 -s1c2);
s2c1*y - s1s2*x - s2d1 = 0;
s1c2*y - s1s2*x -s1d2 = 0;
(s2c1 - s1c2)*y -s2d1 + s1d2 = 0;
y = (s2d1 - s1d2)/(s2c1 - s1c2);
(I might just implement Kramer's Rule with determinants some day)
Find the intersection of line with the line of seg.  See if this point is within the bounds of seg.
Because of our choice or representation for a Line, plugging the point into the line equation gives us the signed distance.
ie.  distance = y*cos(theta) - x*sin(theta) - d;
Because of our choice or representation for a Line, plugging the point into the line equation gives us the signed distance.
ie.  distance = y*cos(theta) - x*sin(theta) - d;
We drop a normal from the point onto the line and find where it hits.
The line equation of the normal we drop can be found using FillLineAsNormal above.
We will have line equations:
c*y - s*x - d = 0.  The vector v = [c, s] is the unit vector parallel to line.  The vector
l = [-s, c] is the unit vector 90 degrees counter-clockwise of v.  If pt is distance D from line (along l), then the new point we want is pt-D*l.  Componentwise:
projectedPt[1] _ pt[1] + D*s.
projectedPt[2] _ pt[2] - D*c.
Finds any old point on line and returns it.

Returns the direction vector of line.
Edges
Assumes pt is on edge.line.  Is it on edge?
Look for an obvious winner first.  If that fails, do math.
perpendicular distance if possible, else distance to nearest endpoint.
Perpendicular distance if possible, else distance to nearest endpoint.
Points
point is a point to the left of the directed line, on the normal to the line which intersects the line at pOnLine.  If distance is negative, the point will be to the right of the directed line.
Method:  The point we want will be at the intersection these two lines
1) The line parallel to "line" but distance to its left
2) The line perpendicular to "line" at pOnLine.
We can generate both of these easily as follows:
We can take advantage of the horizontal and vertical lines of the box to do an easy intersection test.  Note that we are really testing for line intersections rather than ray intersections.
Top Line
The top line has equation y = ymax.  If ray.d[2] = 0, we don't hit this line.  Otherwise, we use y(t) = ymax = ray.p[2]+t*ray.d[2];  Solve for t:  t = (ymax-ray.p[2])/ray.d[2].
Bottom Line
Right Line
Left Line
UTILITY FUNCTIONS
ΚG˜Iheadš
œ™Iprocš
œ0™0Lš
œ5™5Lš
œj™jL˜š
Οk	˜	Lš
œ˜L˜Lš
œ
˜
L˜	Lš
œ˜—L˜šœ

˜Lšœ˜"Lšœ
˜—L˜Lš
˜L˜˜Lšœœ˜!Lšœœœ	˜Lšœ	œ˜%Lšœœœ	˜Lšœ	œ˜%Lšœœœ˜Lšœœ˜#Lšœœ˜#L˜—šΟnœœ
œ
œ˜5Lšœœ
˜Lš
œ˜L˜—šžœœ
œ˜0Lš
œ˜Lš
œ˜Lš
œ˜Lš
œ˜Lš
œ˜Lš
œ˜Lš
œ˜L˜—šžœœ
œ ˜?Lš
œ™Lš
œΥ
™Υ
Lšœ	œK˜XLšœœ˜ Lšœœ˜ šœ
œœΟc˜2šœœŸ˜&Lš
œ˜Lš
œ˜Lš
œ8™8Lš
œ˜—šœŸ˜Lš
œ˜Lš
œ˜Lš
œ9™9Lš
œ˜—Lš
œ˜Lš
œD™DLš
œ
˜
—Lš
œ™šœ˜Lš
œ!˜!Lš
œ5˜5Lš
œ$˜$Lš
œ$™$LšœŸt˜
Lš
œ/™/Lš
œ%˜%Lš
œ˜Lš
œ˜—LšœŸ˜L˜—šžœœ
œ)˜PLš
œ˜Lš
œ˜Lš
œ"˜"L˜L˜—šžœœ
œ(œ˜bLš
œ™Lš
œ:™:Lš
œ˜Lš
œ˜Lš
œ˜Lš
œ;˜;Lš
œ>™>šœœ˜Lš
œ'˜'Lš
œ9™9Lš
œ˜—LšœŸ"˜%L˜—šžœœ
œœ˜QL˜Lš
œ.˜.Lš
œ0˜0LšœŸ#˜&L˜—šžœœ
œ.˜KL™gLš
œ^™^Lš
œ*™*Lš
œ*™*Lš
œ™Lš
œ)™)Lš
œ˜Lš
œ˜Lš
œ,˜,Lš
œ/˜/Lšœœ˜Lš
œ-˜-Lš
œ9™9Lš
œ'˜'LšœŸ˜—L˜šžœœœ˜PLš
œ˜Lš
œ˜Lš
œ˜Lš
œ ˜ Lš
œ ˜ L˜L˜—šžœœœ˜QLš
œ˜Lš
œ˜Lš
œ˜Lš
œ ˜ Lš
œ ˜ L˜—L˜šžœœ
œœ˜DLš
œ˜Lš
œ!˜!Lš
œ˜—šžœœ
œœ˜ULš
œ˜Lš
œ˜Lš
œ˜L˜—š
žœœ
œ(œœ˜gLš
œ˜Lš
œE˜ELš
œ˜—šžœœœœ˜WLš
œ˜Lš
œ-˜-L˜L˜—šžœœ
œœ˜]Lš
œ˜Lš
œ'˜'Lš
œ˜L˜—š
žœœ
œœœ˜ULš
œ!˜!Lš
œ-˜-Lš
œ˜L˜—šžœœœœ˜VLš
œ!˜!Lš
œ.˜.Lš
œ˜—L˜š
ž
œœ
œœ!œ˜aLšœ
œ
˜Lšœœ
œœ˜<Lšœœ
˜Lš
œ.™.Lš
œ,™,Lš
œ™Lš
œ™Lš
œ™Lš
œ!™!Lš
œ™Lš
œ™Lš
œ™Lš
œ!™!Lš
œ ™ Lš
œA™ALš
œ0˜0Lšœœ
œœ˜2Lš
œB˜BLš
œB˜BLš
œ˜—šžœœ
œœœœ˜QLšœœœ˜;šœŸR˜XLšœœ
˜Lš
œ˜—Lš
œ˜—š
ž
œœ
œœœ˜bLš
œc™cLš
œ˜—L˜š
žœœ
œœœ˜MLš
œ{™{Lš
œ0™0Lš
œ)˜)LšœŸ˜L˜—š
žœœ
œœœ˜GLš
œ{™{Lš
œ0™0Lšœœ'˜.LšœŸ˜L˜L˜—šžœœ
œœ˜\Lš
œE™ELš
œR™RLš
œ™Lš
œό
™ό
Lš
œ™L™Lš
œœ(˜/Lšœ
œ˜"Lšœ
œ˜"Lš
œ˜L˜—šžœœ
œœ˜=L™+šœ
œœ	œ˜#Lš
œ˜Lš
œ˜L˜
—šœ˜L˜Lš
œ˜L˜—L˜L™—šžœœœ˜IL™%Lš
œ˜Lš
œ˜L˜—L˜L˜L™L˜šž
œœ
œœ˜@Lš
œ˜Lš
œ˜LšœŸ˜—šžœœ
œ
œ˜5Lšœœ
˜Lš
œ˜Lš
œ˜—šžœœ
œ ˜5Lšœœ
˜Lš
œ&˜&Lš
œ˜šœœ
˜Lšœœ6œ
˜PLšœ6œ
˜@—š
˜Lšœœ6œ
˜PLšœ6œ˜A—LšœŸ˜—šžœœ
œ˜0Lš
œ˜Lš
œ˜Lš
œ˜Lš
œ$˜$LšœŸ˜—š
žœœ
œœœ˜GLš
œ+™+Lš	œ
œ!œœŸ˜hLšœ,˜2Lšœ
Ÿ˜Lšœ-˜3LšœŸ˜—L˜šžœœ
œœ˜RLš
œ:™:Lš
˜Lšœ
œœ˜:Lš
œ
œœœ
œ˜MLšœ
œ˜Lš
˜Lš
œ
œœœ
œ
˜JLšœ
œ˜Lš
˜Lšœ
œ.˜:Lš
œ*˜*Lšœ
œ˜Lšœ
œ˜Lšœ
˜Lš
œ˜—š
ž œœ
œœœ˜iLšœ œ
˜%Lš
œ=˜=Lš
œ;˜;Lšœ&˜,Lš
œ˜—L˜šžœœ
œœ˜SLš
œ;˜;Lšœ$œ˜?Lšœ$˜(L˜L˜—š
žœœ
œœœ˜ULš
œF™FLš
œ;˜;Lš
œ˜Lšœ$œœ˜Všœ˜Lš
œ)˜)Lš
œ2˜2Lš
œ˜—Lš
œ˜L˜—š
žœœ
œœœ˜cLš
œF™FLš
œ;˜;Lšœ#˜%Lšœ0˜4Lš
œ3˜3Lšœ>˜BLš
œ˜—L˜L™L˜š
žœœ
œœœ˜NLš
œS˜SLš
œ˜—š
žœœ
œœœ˜ULš
œE˜ELš
œ˜—š
žœœ
œœœ˜dLš
œΑ
™Α
Lš
œF™FLš
œ7™7Lš
œ/™/Lš
œ0™0L˜Lš
œ˜Lšœ
œ
˜Lš
œ!˜!Lš
œ˜Lš
œJ˜JLš
œ*˜*Lš
œ:˜:Lšœ
œ
œŸ'˜?Lš
œ˜—L˜šž	œœ
œ'œ˜SLšœœ"˜+L˜—šžœœ
œœ˜GLšœœ&˜/L˜L˜—šžœœ
œ$œœ	œ
œœ
œ˜{L™½
Lšœœ˜Lšœ	œ
˜L˜
™Lš
ϡ
™°
šœœŸ˜;Lš
œ˜Lš
œ˜šœ
œ
œŸ˜+L˜Lš
œ˜L˜——™Lš
œ˜Lš
œ˜šœ
œ
œŸ˜+L˜Lš
œ˜L˜—L˜——™
šœœŸ˜;Lš
œ˜Lš
œ˜šœ
œ
œŸ˜+L˜Lš
œ˜L˜——™	Lš
œ˜Lš
œ˜šœ
œ
œŸ˜+L˜Lš
œ˜L˜—L˜—šœœ˜šœœ˜ Lšœœ
˜Lš
œ˜Lš
œ˜L˜—L˜——LšœŸ˜—š
žœœ
œœœ˜GLš
œ%˜%Lš
œ%˜%L˜—L˜Lš
œ™L˜šžœœ
œœœœ˜;šœ˜
Lšœœœ˜(Lšœœ˜Lšœœœ˜(Lšœœ
˜Lš
œ˜——L˜Lšœ
˜J˜—…—,nK)