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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
|
/**
* Copyright 2010 JogAmp Community. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are
* permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this list of
* conditions and the following disclaimer.
*
* 2. 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.
*
* THIS SOFTWARE IS PROVIDED BY JogAmp Community ``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 JogAmp Community 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.
*
* The views and conclusions contained in the software and documentation are those of the
* authors and should not be interpreted as representing official policies, either expressed
* or implied, of JogAmp Community.
*/
package jogamp.graph.curve.tess;
import java.util.ArrayList;
import com.jogamp.graph.geom.Vertex;
public class GraphVertex {
private Vertex point;
private ArrayList<HEdge> edges = null;
private boolean boundaryContained = false;
public GraphVertex(Vertex point) {
this.point = point;
}
public Vertex getPoint() {
return point;
}
public float getX(){
return point.getX();
}
public float getY(){
return point.getY();
}
public float getZ(){
return point.getZ();
}
public float[] getCoord() {
return point.getCoord();
}
public void setPoint(Vertex point) {
this.point = point;
}
public ArrayList<HEdge> getEdges() {
return edges;
}
public void setEdges(ArrayList<HEdge> edges) {
this.edges = edges;
}
public void addEdge(HEdge edge){
if(edges == null){
edges = new ArrayList<HEdge>();
}
edges.add(edge);
}
public void removeEdge(HEdge edge){
if(edges == null)
return;
edges.remove(edge);
if(edges.size() == 0){
edges = null;
}
}
public HEdge findNextEdge(GraphVertex nextVert){
for(int i=0; i<edges.size(); i++) {
HEdge e = edges.get(i);
if(e.getNext().getGraphPoint() == nextVert){
return e;
}
}
return null;
}
public HEdge findBoundEdge(){
for(int i=0; i<edges.size(); i++) {
HEdge e = edges.get(i);
if((e.getType() == HEdge.BOUNDARY) || (e.getType() == HEdge.HOLE)){
return e;
}
}
return null;
}
public HEdge findPrevEdge(GraphVertex prevVert){
for(int i=0; i<edges.size(); i++) {
HEdge e = edges.get(i);
if(e.getPrev().getGraphPoint() == prevVert){
return e;
}
}
return null;
}
public boolean isBoundaryContained() {
return boundaryContained;
}
public void setBoundaryContained(boolean boundaryContained) {
this.boundaryContained = boundaryContained;
}
public String toString() {
return "GraphVertex[contained "+boundaryContained+", "+point+"]";
}
}
|
