DIRECTORY Rope, IO, AlgebraClasses, Ints, BigRats, RatIntervals, Variables, Polynomials, AlgebraicNumbers, Points, Sequences, Formulas, SamplePoints, CoveringSets; Triangles: CEDAR DEFINITIONS ~ BEGIN OPEN AC: AlgebraClasses, BR: BigRats, RI: RatIntervals, VARS: Variables, AN: AlgebraicNumbers, PTS: Points, SEQ: Sequences, POL: Polynomials, QFF: Formulas, SP: SamplePoints, CS: CoveringSets; TriangleSeq: TYPE = REF TriangleSeqRec; TriangleSeqRec: TYPE = RECORD [SEQUENCE trianglesPlusOne: [1..20000] OF Triangle]; Triangle: TYPE = RECORD[ firstVertex: [1..20000], secondVertex: [1..20000], thirdVertex: [1..20000] ]; CountTriangles: PROC [in: CS.CoveringSet] RETURNS [number: CARDINAL]; GenerateTriangles: PROC [in: CS.CoveringSet] RETURNS [out: TriangleSeq]; END. jTriangles.mesa Last Edited by: Arnon, May 3, 1986 3:53:47 pm PDT Triangle Representation Covering Sets and Triangulations Count how many triangles will be produced by a call to GenerateThreeDWorldTrianglesRope on this covering set. in is assumed to be a covering set for a 2-cell. Ouput a triangulation of it. out = NIL if no triangles can be generated. Κ‘˜Jšœ™J™1J˜J˜J™šΟk ˜ Icodešœ˜Kšœ˜J˜J˜Jšœ˜J˜ Jšœ ˜ J˜ Jšœ˜Jšœ˜Jšœ ˜ J˜ J˜ J˜ J˜—head2šΟn œœ ˜J˜—Jšœœœœœ œœ œœ œ œœ œœ˜Ιheadšž™Jšœ œœ˜'šœœ˜Jšœœœ ˜4—šœ œœ˜Jšœ˜Jšœ˜Jšœ˜Jšœ˜——™ š žœœœœ œ˜EKšœm™mJ˜—šžœœœœ˜HKšœz™zJ˜——Jšœ˜—…—