projects
/
anneal.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
0525dcc
)
checkpoint
author
adam
<adam@megacz.com>
Sun, 16 Dec 2007 07:01:05 +0000
(23:01 -0800)
committer
adam
<adam@megacz.com>
Sun, 16 Dec 2007 07:01:05 +0000
(23:01 -0800)
darcs-hash:
20071216070105
-5007d-
275c65b9e4837b5f4414734f51fa068acc2f175e
.gz
src/edu/berkeley/qfat/Mesh.java
patch
|
blob
|
history
diff --git
a/src/edu/berkeley/qfat/Mesh.java
b/src/edu/berkeley/qfat/Mesh.java
index
babad37
..
a2e175b
100644
(file)
--- a/
src/edu/berkeley/qfat/Mesh.java
+++ b/
src/edu/berkeley/qfat/Mesh.java
@@
-175,11
+175,13
@@
public class Mesh implements Iterable<Mesh.T> {
}
public void checkLegality() {
}
public void checkLegality() {
+ /*
for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
if (Math.abs(e.crossAngle()) > (Math.PI * 0.9) ||
Math.abs(e.next.crossAngle()) > (Math.PI * 0.9)) illegal = true;
for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
if (Math.abs(e.crossAngle()) > (Math.PI * 0.9) ||
Math.abs(e.next.crossAngle()) > (Math.PI * 0.9)) illegal = true;
- //if (e.t.aspect() < 0.1) illegal = true;
+ if (e.t.aspect() < 0.1) illegal = true;
}
}
+ */
if (!illegal) triangles.range(oldp, this.p, (Visitor<T>)this);
}
if (!illegal) triangles.range(oldp, this.p, (Visitor<T>)this);
}
@@
-339,8
+341,8
@@
public class Mesh implements Iterable<Mesh.T> {
p2.p.distance(error_against.nearest(p2.p).p))/2;
return nearest_distance/other_distance;
*/
p2.p.distance(error_against.nearest(p2.p).p))/2;
return nearest_distance/other_distance;
*/
- //return length();
- return t==null?0:(1/t.aspect());
+ return length();
+ //return t==null?0:(1/t.aspect());
}
public int compareTo(E e) {
return e.comparator() > comparator() ? 1 : -1;
}
public int compareTo(E e) {
return e.comparator() > comparator() ? 1 : -1;