001/**
002 * Copyright (c) 2011, The University of Southampton and the individual contributors.
003 * All rights reserved.
004 *
005 * Redistribution and use in source and binary forms, with or without modification,
006 * are permitted provided that the following conditions are met:
007 *
008 *   *  Redistributions of source code must retain the above copyright notice,
009 *      this list of conditions and the following disclaimer.
010 *
011 *   *  Redistributions in binary form must reproduce the above copyright notice,
012 *      this list of conditions and the following disclaimer in the documentation
013 *      and/or other materials provided with the distribution.
014 *
015 *   *  Neither the name of the University of Southampton nor the names of its
016 *      contributors may be used to endorse or promote products derived from this
017 *      software without specific prior written permission.
018 *
019 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
020 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
021 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
022 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
023 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
024 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
025 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
026 * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
027 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
028 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
029 */
030package org.openimaj.math.geometry.shape.util.polygon;
031
032import org.openimaj.math.geometry.point.DoublePoint2dImpl;
033
034/** */
035public class EdgeNode {
036        /**
037         * Piggy-backed contour vertex data
038         */
039        public DoublePoint2dImpl vertex = new DoublePoint2dImpl();
040
041        /** Edge lower (x, y) coordinate */
042        public DoublePoint2dImpl bot = new DoublePoint2dImpl();
043
044        /** Edge upper (x, y) coordinate */
045        public DoublePoint2dImpl top = new DoublePoint2dImpl();
046
047        /** Scanbeam bottom x coordinate */
048        public double xb;
049
050        /** Scanbeam top x coordinate */
051        public double xt;
052
053        /** Change in x for a unit y increase */
054        public double dx;
055
056        /** PolygonUtils / subject edge flag */
057        public int type;
058
059        /** Bundle edge flags */
060        public int[][] bundle = new int[2][2];
061
062        /** Bundle left / right indicators */
063        public int[] bside = new int[2];
064
065        /** Edge bundle state */
066        public BundleState[] bstate = new BundleState[2];
067
068        /** Output polygon / tristrip pointer */
069        public PolygonNode[] outp = new PolygonNode[2];
070
071        /** Previous edge in the AET */
072        public EdgeNode prev;
073
074        /** Next edge in the AET */
075        public EdgeNode next;
076
077        // EdgeNode pred; /* Edge connected at the lower end */
078
079        /** Edge connected at the upper end */
080        public EdgeNode succ;
081
082        /** Pointer to next bound in LMT */
083        public EdgeNode next_bound;
084}