Commit 93be1833 authored by Boris Springborn's avatar Boris Springborn

revert gunn's suspicious edits

git-svn-id: https://svn.math.tu-berlin.de/svn/jtem@1611 f5b180c5-49ee-4939-b20e-b6ed35f0f7b7
parent 3b0b3674
......@@ -82,10 +82,8 @@ public abstract class Face <V extends Vertex<V, E, F>,
return boundaryEdge;
}
final public void setBoundaryEdge(E e) {
final void setBoundaryEdge(E e) {
checkHalfEdgeDataStructure(e);
if (!hds.getEdges().contains(e))
throw new IllegalStateException("Not an edge of this face");
this.boundaryEdge = e;
};
......
......@@ -283,7 +283,7 @@ public class HalfEdgeDataStructure <V extends Vertex<V, E, F>,
throw new RuntimeException(face + " is null or does not belong to " + this + ".");
}
if (faceList.remove(face)) {
// face.setBoundaryEdge(null);
face.setBoundaryEdge(null);
face.setHalfEdgeDataStructure(null);
reindexFaces(face.index);
return;
......
......@@ -427,10 +427,10 @@ public final class HalfEdgeUtils {
LinkedList<E> result = new LinkedList<E>();
E e = e0;
do {
// if (vertex != e.getTargetVertex()) {
// throw new RuntimeException("Edge " + e + " does not have vertex " + vertex + " as target vertex, " +
// "although it is the opposite of the next edge of an edge which does.");
// }
if (vertex != e.getTargetVertex()) {
throw new RuntimeException("Edge " + e + " does not have vertex " + vertex + " as target vertex, " +
"although it is the opposite of the next edge of an edge which does.");
}
result.add(e);
e = e.getNextEdge();
if (e == null) {
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment