C# Segment.SharedVertex方法代码示例

        public Angle(Segment ray1, Segment ray2)
            : base()
        {
            Point vertex = ray1.SharedVertex(ray2);

            if (vertex == null) throw new ArgumentException("Rays do not share a vertex: " + ray1 + " " + ray2);

            this.A = ray1.OtherPoint(vertex);
            this.B = vertex;
            this.C = ray2.OtherPoint(vertex);
            this.ray1 = ray1;
            this.ray2 = ray2;
            this.measure = toDegrees(findAngle(A, B, C));

            if (measure <= 0)
            {
                //System.Diagnostics.Debug.WriteLine("NO-OP");
            //                throw new ArgumentException("Measure of " + this.ToString() + " is ZERO");
            }
        }

        public bool IsIncludedAngle(Segment s1, Segment s2, Angle a)
        {
            if (!HasSegment(s1) || !HasSegment(s2) && !HasAngle(a)) return false;

            // If the shared vertex between the segments is the vertex of this given angle, then
            // the angle is the included angle as desired
            return s1.SharedVertex(s2).Equals(a.GetVertex());
        }

        //            top
        // shared1  _______   off1
        //         |
        //   mid   |
        //         |_________   off2
        //            bottom
        private static Segment AcquireMiddleSegment(Segment seg1, Segment seg2, Segment seg3, out Segment top, out Segment bottom)
        {
            if (seg1.SharedVertex(seg2) != null && seg1.SharedVertex(seg3) != null)
            {
                top = seg2;
                bottom = seg3;
                return seg1;
            }

            if (seg2.SharedVertex(seg1) != null && seg2.SharedVertex(seg3) != null)
            {
                top = seg1;
                bottom = seg3;
                return seg2;
            }

            if (seg3.SharedVertex(seg1) != null && seg3.SharedVertex(seg2) != null)
            {
                top = seg1;
                bottom = seg2;
                return seg3;
            }

            top = null;
            bottom = null;

            return null;
        }

        public Quadrilateral(Segment left, Segment right, Segment top, Segment bottom)
            : base()
        {
            //
            // Segments
            //
            this.left = left;
            this.right = right;
            this.top = top;
            this.bottom = bottom;

            orderedSides = new List<Segment>();
            orderedSides.Add(left);
            orderedSides.Add(top);
            orderedSides.Add(right);
            orderedSides.Add(bottom);

            //
            // Points
            //
            this.topLeft = left.SharedVertex(top);
            if (topLeft == null)
            {
                return;
                // throw new ArgumentException("Top left point is invalid: " + top + " " + left);
            }
            this.topRight = right.SharedVertex(top);
            if (topRight == null) throw new ArgumentException("Top left point is invalid: " + top + " " + right);

            this.bottomLeft = left.SharedVertex(bottom);
            if (bottomLeft == null) throw new ArgumentException("Bottom left point is invalid: " + bottom + " " + left);

            this.bottomRight = right.SharedVertex(bottom);
            if (bottomRight == null) throw new ArgumentException("Bottom right point is invalid: " + bottom + " " + right);

            points = new List<Point>();
            points.Add(topLeft);
            points.Add(topRight);
            points.Add(bottomRight);
            points.Add(bottomLeft);

            // Verify that we have 4 unique points
            for (int i = 0; i < points.Count - 1; i++)
            {
                for (int j = i + 1; j < points.Count; j++)
                {
                    if (points[i].StructurallyEquals(points[j]))
                    {
                        throw new ArgumentException("Points of quadrilateral are not distinct: " + points[i] + " " + points[j]);
                    }
                }
            }

            //
            // Diagonals
            //
            this.topLeftBottomRightDiagonal = new Segment(topLeft, bottomRight);
            this.bottomLeftTopRightDiagonal = new Segment(bottomLeft, topRight);
            this.diagonalIntersection = null;
            triPairTLBR = new KeyValuePair<Triangle, Triangle>(new Triangle(topLeft, bottomLeft, bottomRight), new Triangle(topLeft, topRight, bottomRight));
            triPairBLTR = new KeyValuePair<Triangle, Triangle>(new Triangle(bottomLeft, topLeft, topRight), new Triangle(bottomLeft, bottomRight, topRight));

            //
            // Angles
            //
            this.topLeftAngle = new Angle(bottomLeft, topLeft, topRight);
            this.topRightAngle = new Angle(topLeft, topRight, bottomRight);
            this.bottomRightAngle = new Angle(topRight, bottomRight, bottomLeft);
            this.bottomLeftAngle = new Angle(bottomRight, bottomLeft, topLeft);

            angles = new List<Angle>();
            angles.Add(topLeftAngle);
            angles.Add(topRightAngle);
            angles.Add(bottomLeftAngle);
            angles.Add(bottomRightAngle);

            this.FigureSynthesizerConstructor();

            addSuperFigureToDependencies();
        }

        //
        // Do these segments overlay this angle?
        //
        public bool IsIncludedAngle(Segment seg1, Segment seg2)
        {
            // Do not allow the same segment.
            if (seg1.StructurallyEquals(seg2)) return false;

            // Check direct inclusion
            if (seg1.Equals(ray1) && seg2.Equals(ray2) || seg1.Equals(ray2) && seg2.Equals(ray1)) return true;

            // Check overlaying angle
            Point shared = seg1.SharedVertex(seg2);

            if (shared == null) return false;

            Angle thatAngle = new Angle(seg1.OtherPoint(shared), shared, seg2.OtherPoint(shared));

            return this.Equates(thatAngle);
        }