AxiosEngine-old 

AxiosEngine-old Mercurial Source Tree


Root/axios/Common/Decomposition/CDT/Delaunay/Sweep/AdvancingFrontNode.cs

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
/* Poly2Tri
 * Copyright (c) 2009-2010, Poly2Tri Contributors
 *
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without modification,
 * are permitted provided that the following conditions are met:
 *
 * * Redistributions of source code must retain the above copyright notice,
 *   this list of conditions and the following disclaimer.
 * * Redistributions in binary form must reproduce the above copyright notice,
 *   this list of conditions and the following disclaimer in the documentation
 *   and/or other materials provided with the distribution.
 * * Neither the name of Poly2Tri nor the names of its contributors may be
 *   used to endorse or promote products derived from this software without specific
 *   prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
// Changes from the Java version
//   Removed getters
//   Has* turned into attributes
// Future possibilities
//   Comments!
 
namespace Poly2Tri.Triangulation.Delaunay.Sweep
{
    public class AdvancingFrontNode
    {
        public AdvancingFrontNode Next;
        public TriangulationPoint Point;
        public AdvancingFrontNode Prev;
        public DelaunayTriangle Triangle;
        public double Value;
 
        public AdvancingFrontNode(TriangulationPoint point)
        {
            Point = point;
            Value = point.X;
        }
 
        public bool HasNext
        {
            get { return Next != null; }
        }
 
        public bool HasPrev
        {
            get { return Prev != null; }
        }
    }
}
Source at commit bffd63700ae0 created 12 years 9 months ago.
By nathan@daedalus, Adding initial files

Archive Download this file

Page rendered in 0.83280s using 11 queries.