DIRECTORY GGBasicTypes; GGCircles: CEDAR DEFINITIONS = BEGIN Arc: TYPE = GGBasicTypes.Arc; Circle: TYPE = GGBasicTypes.Circle; Point: TYPE = GGBasicTypes.Point; Edge: TYPE = GGBasicTypes.Edge; Line: TYPE = GGBasicTypes.Line; Vector: TYPE = GGBasicTypes.Vector; CreateEmptyCircle: PROC [] RETURNS [circle: Circle]; CopyCircle: PROC [from: Circle, to: Circle]; FillCircleFromPointAndRadius: PROC [pt: Point, radius: REAL, circle: Circle]; CircleFromPointAndRadius: PROC [pt: Point, radius: REAL] RETURNS [circle: Circle]; FillCircleFrom3Points: PROC [p0, p1, p2: Point, circle: Circle] RETURNS [linear: BOOL]; CircleFrom3Points: PROC [p0, p1, p2: Point] RETURNS [circle: Circle, linear: BOOL]; CircleMeetsLine: PROC [circle: Circle, line: Line] RETURNS [points: ARRAY [1..2] OF Point, hitCount: [0..2], tangent: BOOL]; CircleMeetsEdge: PROC [circle: Circle, edge: Edge] RETURNS [points: ARRAY [1..2] OF Point, hitCount: [0..2], tangent: BOOL]; CircleMeetsCircle: PROC [circle1, circle2: Circle] RETURNS [points: ARRAY [1..2] OF Point, hitCount: [0..2], tangent: BOOL]; CircleMeetsArc: PROC [circle: Circle, arc: Arc] RETURNS [points: ARRAY [1..2] OF Point, hitCount: [0..2], tangent: BOOL]; ArcMeetsLine: PROC [arc: Arc, line: Line] RETURNS [points: ARRAY [1..2] OF Point, hitCount: [0..2], tangent: BOOL]; ArcMeetsEdge: PROC [arc: Arc, edge: Edge] RETURNS [points: ARRAY [1..2] OF Point, hitCount: [0..2], tangent: BOOL]; ArcMeetsArc: PROC [arc1, arc2: Arc] RETURNS [points: ARRAY [1..2] OF Point, hitCount: [0..2], tangent: BOOL]; SignedCircleDistance: PROC [pt: Point, circle: Circle] RETURNS [d: REAL]; CircleDistance: PROC [pt: Point, circle: Circle] RETURNS [d: REAL]; PointProjectedOntoCircle: PROC [pt: Point, circle: Circle] RETURNS [projectedPt: Point]; CreateEmptyArc: PROC RETURNS [arc: Arc]; CopyArc: PROC [from: Arc, to: Arc]; FillArc: PROC [v0, v1, v2: Point, arc: Arc]; CreateArc: PROC [v0, v1, v2: Point] RETURNS [arc: Arc]; CirclePointOnArc: PROC [pt: Point, arc: Arc] RETURNS [BOOL]; NearestEndpoint: PROC [pt: Point, arc: Arc] RETURNS [endpoint: Point]; DistanceSquaredToNearestEndpoint: PROC [pt: Point, arc: Arc] RETURNS [distanceSquared: REAL]; NearestPointOnArc: PROC [pt: Point, arc: Arc] RETURNS [onArc: Point]; DistancePointToArc: PROC [pt: Point, arc: Arc] RETURNS [distance: REAL]; DistanceSquaredPointToArc: PROC [pt: Point, arc: Arc] RETURNS [distanceSquared: REAL]; OnArc: PROC [pt: Point, arc: Arc] RETURNS [BOOL]; END. 8GGCircles.mesa Author: Eric Bier on June 4, 1985 4:58:33 pm PDT Last edited by Bier on January 26, 1987 2:10:38 pm PST Contents: Routines for finding the intersections of various types of circles, lines, and points. Pier, December 6, 1985 10:01:18 am PST Circles Since circles are fairly large data structures, you may prefer to allocate one with CreateEmptyCircle and repeatedly fill it with new data instead of allocating a new one each time. "circle" now has center at "pt" and radius of "radius". Returns a circle with center at "pt" and radius of "radius". "circle" now passes through the three points. If the points are roughly collinear, creates a large circle passing through p0 and p2. Returns a circle which passes through the three points. If the points are roughly collinear, creates a large circle passing through p0 and p2. If there is a single point of intersection, then tangent will be TRUE. If there is a single point of intersection, then tangent will be TRUE iff that point of intersection is a point of tangency. If there is a single point of intersection, then tangent will be TRUE iff that point of intersection is a point of tangency. If there is a single point of intersection, then tangent will be TRUE iff that point of intersection is a point of tangency. If there is a single point of intersection, then tangent will be TRUE iff that point of intersection is a point of tangency. If there is a single point of intersection, then tangent will be TRUE iff that point of intersection is a point of tangency. If there is a single point of intersection, then tangent will be TRUE iff that point of intersection is a point of tangency. 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 as in FillLineAsNormal above. Finds any old point on line and returns it. Returns the direction vector of line. Arcs Assumes pt is on arc.circle. Is it on arc? The nearest point on arc.circle to pt, if the nearest point is on arc. Otherwise, the nearest endpoint. Distance[pt, NearestPointOnArc[pt, arc]]. Ê¼˜Icode™Kšœ0™0Kšœ6™6šœa™aK™&—K˜šÏk ˜ Kšœ ˜ —K˜Kšœœœ˜Kš˜˜Kšœœ˜Kšœœ˜#Kšœœ˜!Kšœœ˜Kšœœ˜Kšœœ˜#K˜K˜—K™K™K˜KšÏnœœœ˜4Kšž œœ˜-˜Kšœµ™µK™—šžœœœ˜NKšœ7™7—šžœœœœ˜SKšœ<™<—K˜šžœœ&œ œ˜XK™…—šžœœœœ˜SKšœ™—K˜K˜šžœœœ œœ#œ˜}KšœF™F—šžœœœ œœ#œ˜}Kšœ|™|—šžœœœ œœ#œ˜}Kšœ|™|—šžœœœ œœ#œ˜yKšœ|™|—šžœœœ œœ#œ˜sKšœ|™|—šžœœœ œœ#œ˜sKšœ|™|—šžœœœ œœ#œ˜mKšœ|™|—K˜Kšžœœœœ˜JKšžœœœœ˜Dšžœœœ˜YšœD™DKšœR™R—K™+K™%K˜—K™K™K˜Kšžœœœ˜)Kšžœœ˜$K˜Kšžœœ ˜-Kšž œœœ˜8K˜šžœœœœ˜=Kšœ+™+—Kšžœœœ˜GKšž œœœœ˜]šžœœœ˜EKšœh™hK™—šžœœœœ˜IKšœ)™)—Kšžœœœœ˜WKšžœœœœ˜1K™Kšœ˜K˜—…— ¶ª