DIRECTORY IO, EuclideanGraphs, ConvexEuclideanGraphs; ConvexCombiner: CEDAR DEFINITIONS = BEGIN OPEN EG: EuclideanGraphs, CEG: ConvexEuclideanGraphs; Vertex: TYPE = EG.Vertex; -- A single (outline) vertex is sufficient representation for a combiner database, since ConvexEuclideanGraphs are assumed to be connected, so a single vertex is sufficient entree into the graph. Point: TYPE = EG.Point; Verbosity: TYPE = CEG.Verbosity; ClientDataCombiner: TYPE = PROC[currentClientdata, inputClientdata: REF] RETURNS [resultClientData: REF]; -- note well the order of input parameters. ClientDataEqual: TYPE = PROC [clientData1, clientData2: REF] RETURNS [BOOL]; IsAProc: TYPE = CEG.IsAProc; Combiner: PROC[currentEnd, inputEnd: Vertex, inputClientData: REF, clientDataCombiner: ClientDataCombiner, verbosity: Verbosity _ NIL] RETURNS [combinedEnd: Vertex]; CombineGeometry: PROC[currentEnd, inputEnd: Vertex, setIntersectionPolygonEdges: BOOL _ TRUE, verbosity: Verbosity _ NIL] RETURNS [combinedEnd, intersectionPolyStart, intersectionPolyEnd: Vertex]; CombineClientData: PROC[ intersectionPolyStart, intersectionPolyEnd: Vertex, inputClientData: REF, clientDataCombiner: ClientDataCombiner, verbosity: Verbosity _ NIL]; InputIntersectsCurrent: PROC [inputStart, inputEnd, currentVertex: Vertex, verbosity: Verbosity _ NIL] RETURNS [outlineStart, outlineEnd: Vertex _ NIL, intersectionPolyStart, intersectionPolyEnd: Vertex]; InputExternalToCurrent: PROC[ currentStart, currentEnd, inputStart, inputEnd: Vertex, currentOutlineCOM, inputCOM: Point, verbosity: Verbosity _ NIL] RETURNS [outlineStart, outlineEnd: Vertex]; PolygonEnclosesPolygon: PROC[ innerCOM: Point, innerStart, innerEnd, outerStart, outerEnd: Vertex, verbosity: Verbosity _ NIL]; HandleVertexContact: PROC [firstIntersection, inputStart, inputEnd, currentVertex: Vertex, verbosity: Verbosity _ NIL] RETURNS [returnedToFirstIntersection: BOOL, nextLensInExterior: BOOL _ FALSE, currentCommonVertex, nextCurrentVertex, nextInputVertex: Vertex _ NIL]; LensDecomposition: PROC[firstIntersection, lensStart, innerEnd, outerEnd: Vertex, lensInExterior: BOOL, setIntersectionPolygonEdges: BOOL _ TRUE, verbosity: Verbosity _ NIL] RETURNS [returnedToFirstIntersection: BOOL, innerPrevious, innerCommon, outerPrevious, outerCommon: Vertex]; BoundaryContactOnly: PROC[inputStart, inputEnd, currentVertex: Vertex, verbosity: Verbosity _ NIL]; SimpleCleaner: PROC [currentEnd: Vertex, clientDataEqual: ClientDataEqual, verbosity: Verbosity _ NIL]; END. ”ConvexCombiner.mesa Last Edited by: Arnon, November 26, 1985 10:49:05 am PST Combiner for Convex EuclideanGraphs. Combines two ConvexEuclideanGraphs with client data at edges only (not vertices). Combiner Data Structures Client Data Procedure Types IF currentregiondata=NIL THEN RETURN[ inputregiondata ]; IF inputregiondata=NIL THEN RETURN[ currentregiondata ]; -- all DataCombiner's should contain these lines: our convention is that NIL data combined with any data returns that data. IF data1=NIL OR data2=NIL THEN RETURN[data1 = NIL AND data2 = NIL]; -- all DataEqual's should contain this test Main procedures currentEnd is a vertex on the (convex) outline of the current figure. inputEnd is a vertex on the input polygon. combinedEnd is a vertex on the (convex) outline of the combined figure. currentEnd is a vertex on the (convex) outline of the current figure. inputEnd is a vertex on the input polygon. combinedEnd is a vertex on the (convex) outline of the combined figure. [intersectionPolyStart, intersectionPolyEnd] is a (directed) edge in the new (i.e. combined) geometry which is contained in the intersection polygon (of current figure and input polygon), and such that the interior of the intersection polygon lies to its left. If the intersection polygon is empty, then both intersectionPolyStart and intersectionPolyEnd are set to NIL. If setIntersectionPolygonEdges, then CombineGeometry sets the intersectionPolygonEdge fields of all (directed) edges in the new (i.e. combined) geometry which are contained in the intersection polygon (of current figure and input polygon), and such that the interior of the intersection polygon lies to their left. Although this functionality is provided as an essential preprocessing step for CombineClientData, note that it is a purely geometrical operation. It can be undone with ClearIntersectionPolygonEdges. [intersectionPolyStart, intersectionPolyEnd] is a counterclockwise oriented (directed) edge in the current (i.e. combined) geometry which is contained in the intersection polygon (of current figure and input polygon), and such that the interior of the intersection polygon lies to its left. inputClientData is the state of the input polygon. clientDataCombiner is the rule for state combination. The leftState fields of the edges of all polygons interior to the intersection polygon are set to the result of state combining inputClientData with the states those polygons had in the current figure. The algorithm uses Depth First Search. CombineClientData assumes that the intersectionPolygonEdge fields of all (directed) edges in the new (i.e. combined) geometry which are contained in the intersection polygon (of current figure and input polygon), and such that the interior of the intersection polygon lies to their left, are set. It doesn't clear them. Combiner cases Starting from the first intersection point currentVertex, iterates overlap handling and lens decompositions until we return to first intersection point. Assumes that there is at least one lens (case of complete overlap of input polygon and current outline handled by main loop of CombineGeometry), so that intersectionPolyStart and intersectionPolyEnd get set. If any lenses in exterior, then [outlineStart, outlineEnd] is an edge on the new outline formed; otherwise outlineStart = outlineEnd = NIL. [currentStart, currentEnd] is a counterclockwise oriented edge on the (convex) outline of the current figure. [inputStart, inputEnd] is a counterclockwise oriented edge on the input polygon. [currentStart, currentEnd] defines a sector of the current figure in (the closure of) which inputStart lies. [outlineStart, outlineEnd] is a counterclockwise oriented edge on the outline which results from joining currentStart and currentEnd to inputStart with edges. Advance [inputStart, inputEnd] until it defines sector (in closure of which) currentOutlineCOM lies (this is to insure that inputStart is not on the "backside" of the input polygon with respect to the current outline). Then advance [currentStart, currentEnd] until it defines a sector of the current figure in (the closure of) which inputStart lies. Assert inputStart and currentEnd are mutually visible; join with an edge pair. While inputEnd to right of line [currentEnd, inputStart]: [currentEnd, inputStart].exterior _ FALSE, advance [inputStart, inputEnd], join currentEnd and inputStart. [innerStart, innerEnd] is a counterclockwise oriented edge on the inner polygon. [outerStart, outerEnd] is a counterclockwise oriented edge on the outer polygon. The algorithm is: pick a random vertex on outer polygon (we pick outerStart), pinwheel inner polygon until wedge for that vertex is found. Back up along inner polygon until last vertex "visible" from outerStart is found; then add a "cone" of edges from outerStart to vertices of inner polygon until a convex outline is obtained. This leaves a "lens-like region" (i.e. a region which is a lens by some suitably general definition of lens) to be decomposed into convex polygons; we do so by applying the existing lens decomposition procedure. Convex decomposers and overlap handlers Moves forward until start of next lens found or returnedToFirstIntersection (if latter, then must occur by means of overlap). [inputStart, inputEnd] is outgoing edge of input polygon. It is assumed that inputStart and currentVertex have same coordinates and have not yet been merged. If end of overlap chain is firstIntersection, then returnedToFirstIntersection _ TRUE and other return parms defaulted. If not, then returnedToFirstIntersection _ FALSE, nextLensInExterior set appropriately, currentCommonVertex is start of next lens, and nextCurrentVertex and nextInputVertex are next vertices that start off the lens (which is on inner edge and which on outer depends on nextLensInExterior). Each of the lenses that two polygons give rise to is external to one of them and internal to the other (in fact, a lens of two polynomials p1 and p2 can be defined as a connected component of p1 - p2 or p2 - p1). The polygon for which the lens is external is said to be the inner polygon of the lens; the other is the outer polygon of the lens. firstIntersection is the intersection point which started the first lens. [lensStart, innerEnd] is an edge of the polygon which is coming from outer and going inner. [lensStart, outerEnd] is an edge of the polygon which is coming from inner and going outer. lensInExterior specifies whether the forthcoming lens is in the exterior of the current figure, i.e. whether the input polygon is outer or not. returnedToFirstIntersection tells us whether we have come back to the first lens. innerCommon and outerCommon have same coordinates, namely the point which terminates the lens. They are distinct vertices, however, unless returnedToFirstIntersection, in which case innerCommon = outerCommon. Similar to HandleVertexContact. Handles contact which may be as little as a single vertex, or a string of edges. [inputStart, inputEnd] is outgoing edge of input polygon. It is assumed that inputStart and currentVertex have same coordinates and have not yet been merged. While overlap do: set LRE fields FALSE and states to inputClientData, of outward-facing edges of current outline. Structure Cleaner Êß˜šœ™J™8—šÏc$™$J™—šÏk ˜ Jšžœ˜Jšœ˜Jšœ˜Jšœ˜—Ihead2šœžœž˜!JšœQ™QJ˜Jš œžœžœžœžœ˜=J˜™J™—Jšœžœžœ Å˜àJšœžœžœ˜Jšœžœžœ˜ J™™J™—šœžœžœ%žœžœžœ+˜–Jšžœžœžœžœ™8JšžœžœžœžœIž/™µJ˜—codešœžœžœžœžœžœ˜LJšžœžœžœžœžœžœ žœžœ žœ+™p—J™šœ žœžœ ˜J™—šœ™J˜—š Ïnœžœ0žœAžœžœ˜¥J•commentTRUEšœº™ºJ™—šŸœžœ<žœžœžœžœC˜ÄJ–TRUEšœ™Jšœƒ™ƒJ™—šŸœžœHžœAžœ˜¨J–TRUEšœ‹™‹Jšœð™ðJšœÀ™ÀJ™—šœ™J™—š ŸœžœFžœžœ%žœ6˜ÌJšœ˜™˜JšœÏ™ÏJšœ‡žœ™‹J™—šŸœžœužœžœ$˜ÁJ–TRUEšœË™ËJšœß™ßJšœô™ôJ™—šŸœžœ^žœ˜J–TRUEšœ¡™¡J™J˜—J˜šœ'™'J˜—šŸœžœYžœžœžœžœžœDžœ˜ŒLšœ}™}Lšœž™žLšœš™šL™—šŸœžœKžœžœžœžœžœžœB˜šJšœsŸœá™ØJ–TRUEšœ’™’Jšœ¤™¤J™—šŸœžœEžœ˜cJšœ™Jšœq™qJ˜—˜J˜—™J™—LšŸ œžœOžœ˜gL˜šžœ˜J™——…— Ü*O