From 21ac57b36a9e3b909853c7d64ac29b7ad72490a3 Mon Sep 17 00:00:00 2001
From: Normand Briere <nbriere@noware.ca>
Date: Mon, 02 Sep 2019 16:52:19 -0400
Subject: [PATCH] Figure panel.
---
BoundaryRep.java | 985 ++++++++++++++++++++++++++++++++++++++++++++-------------
1 files changed, 761 insertions(+), 224 deletions(-)
diff --git a/BoundaryRep.java b/BoundaryRep.java
index 931cfab..3d93ef4 100644
--- a/BoundaryRep.java
+++ b/BoundaryRep.java
@@ -15,7 +15,7 @@
{
this(0, 0);
}
-
+
void SaveSupports()
{
transientsupport = support;
@@ -161,6 +161,7 @@
|| FaceCount() != other.FaceCount()
|| !(indices == null ^ other.indices != null)) // july 2014
{
+ // The meshes have different structures.
//new Exception().printStackTrace();
trimmed = other.trimmed;
stripified = other.stripified;
@@ -172,16 +173,16 @@
bufV = other.bufV;
bufF = other.bufF;
- positions = (float[]) GraphreeD.clone(other.positions);
- normals = (float[]) GraphreeD.clone(other.normals);
- colors = (float[]) GraphreeD.clone(other.colors);
- uvmap = (float[]) GraphreeD.clone(other.uvmap);
- triangles = (int[]) GraphreeD.clone(other.triangles);
+ positions = (float[]) Grafreed.clone(other.positions);
+ normals = (float[]) Grafreed.clone(other.normals);
+ colors = (float[]) Grafreed.clone(other.colors);
+ uvmap = (float[]) Grafreed.clone(other.uvmap);
+ triangles = (int[]) Grafreed.clone(other.triangles);
- indices = (int[]) GraphreeD.clone(other.indices);
+ indices = (int[]) Grafreed.clone(other.indices);
- vertices = (Vector<Vertex>) GraphreeD.clone(other.vertices);
- faces = (Vector<Face>) GraphreeD.clone(other.faces);
+ vertices = (Vector<Vertex>) Grafreed.clone(other.vertices);
+ faces = (Vector<Face>) Grafreed.clone(other.faces);
}
else
{
@@ -239,9 +240,16 @@
}
}
- Support[] InitConnections(BoundaryRep other)
+ transient Support[] cachesupports = null;
+
+ Support[] InitConnections()
{
- int n = other.startvertices.length-1;
+ if (cachesupports != null)
+ {
+ return cachesupports;
+ }
+
+ int n = this.startvertices.length-1;
Support[] supports = new Support[n];
@@ -253,38 +261,60 @@
for (int object=1; object<=n; object++)
{
- int start = other.startvertices[object-1];
- int end = other.startvertices[object];
+ int start = this.startvertices[object-1];
+ int end = this.startvertices[object];
if (start == end)
continue; // ??
+ /**
+ Vertex v2 = vertextemp;
+ v2.x = averagepoints[object*3];
+ v2.y = averagepoints[object*3+1];
+ v2.z = averagepoints[object*3+2];
+
+ //v2.set(GetVertex(this.startvertices[subsupport]));
+
+ // projected point
+ Vertex v3 = vertextemp2;
+ //GetVertex(this.startvertices[subsupport]);
+ v3.x = extremepoints[object*3];
+ v3.y = extremepoints[object*3+1];
+ v3.z = extremepoints[object*3+2];
+
+ vect3.set(v3); // "X" axis apex
+ vect3.sub(v2); // origin (center)
+ vect3.normalize();
+ /**/
+
int linkcount = 0;
int objectinlist = -1;
+
+ Support subsupport = supports[object-1];
for (int object2=1; object2<=n; object2++)
{
for (int i = start; i < end; i++)
{
- Vertex v = other.GetVertex(i);
+ Vertex v = this.GetVertex(i);
- //
- if (other.Contains(v, object2))
+ // Check if v is close enough from any vertex of the given subobject.
+ if (this.Contains(v, object2))
{
- if (linkcount == supports[object-1].links.length)
+ if (linkcount == subsupport.links.length)
break;
if (object2 == object)
objectinlist = linkcount;
- supports[object-1].links[linkcount++] = object2;
+ subsupport.links[linkcount++] = object2;
break;
}
}
}
- supports[object-1].links[linkcount] = -1;
+ subsupport.links[linkcount] = -1;
if (objectinlist == -1)
assert(objectinlist != -1);
@@ -293,9 +323,9 @@
// assert(linkcount > 1);
// show main support as blue
- int first = supports[object-1].links[0];
- supports[object-1].links[0] = supports[object-1].links[objectinlist];
- supports[object-1].links[objectinlist] = first;
+ int first = subsupport.links[0];
+ subsupport.links[0] = subsupport.links[objectinlist];
+ subsupport.links[objectinlist] = first;
}
for (int loop = 0; --loop>=0;)
@@ -353,7 +383,7 @@
supports = supports2;
}
- return supports;
+ return cachesupports = supports;
}
double Distance2(Vertex v, Vertex v2, double dist2beat, double[][] toRoot, int k)
@@ -497,10 +527,10 @@
return dist2;
}
- static Vertex vertextemp = new Vertex();
- static Vertex vertextemp2 = new Vertex();
+ static Vertex vertextemp = new Vertex(true);
+ static Vertex vertextemp2 = new Vertex(true);
- static double SEUIL = 0.1; // 0.1 for rag doll; 0.07;
+ static double SEUIL = 0.05f; // 0.1 for rag doll; 0.07;
// Compute weight of point w/r to this
float ComputeWeight(Vertex v, double[][] toRoot, int k)
@@ -570,8 +600,10 @@
if (dot > distmax)
dot = distmax;
+ //return 0; // patch for strange behavior
if (dot < -distmax)
dot = -distmax;
+ //return 0; // patch for strange behavior
// v3 = GetVertex(this.startvertices[subsupport] + 16);
//
@@ -596,7 +628,7 @@
// ;
//
- supportsize = supportsizes[subsupport];
+ supportsize = supportminsize[subsupport];
double K = supportsize / distmax;
@@ -609,10 +641,12 @@
float dist2 = (float)Distance2(v, v2, 1E10, toRoot, k);
- if (dist2 >= 2 * SEUIL*SEUIL) // && !CameraPane.CROWD) // weightmode
+ double seuil = SEUIL * 2;
+
+ if (dist2 >= 2 * seuil*seuil) // && !CameraPane.CROWD) // weightmode
return 0;
- dist2 /= 2 * SEUIL*SEUIL; // multiplied by two because center of support
+ dist2 /= 2 * seuil*seuil; // multiplied by two because center of support
// could be far from closest point
// dist2 = Math.pow(dist2, 2);
@@ -646,11 +680,13 @@
// if (supportsize * fadefactor > 1)
// return 1;
- return supportsize * fadefactor;
+ return //supportsize *
+ supportsize * fadefactor;
}
void RecomputeBasis(BoundaryRep other, double[][] toRoot, Vertex v)
{
+ CameraPane.CreateSelectedPoint();
CameraPane.selectedpoint.
getAverage(cStatic.point1, true);
@@ -786,7 +822,7 @@
v.weights[k] = other.ComputeWeight(v, toRoot, k); // (float)(supportsize * normalweight * nz / Math.pow(tx*tx+ty*ty+tz*tz, 1));
v.totalweight += v.weights[k];
- if (CameraPane.CROWD)
+ if (Globals.CROWD)
{
// System.out.print("weight = " + v.weights[k]);
// System.out.println("; totalweight = " + v.totalweight);
@@ -946,9 +982,9 @@
int nbsupports;
- SEUIL = 0.1; // aout 2013
+ // sept 2017 SEUIL = 0.1; // aout 2013
- supports = InitConnections(other);
+ supports = other.InitConnections();
other.supports = supports; // should be the other way around...
@@ -968,6 +1004,7 @@
v.closestsupport = -1;
+ CameraPane.CreateSelectedPoint();
CameraPane.selectedpoint.
getAverage(cStatic.point1, true);
@@ -982,7 +1019,7 @@
int subsupports = 0;
- SEUIL = 0.1; // aout 2013
+ // sept 2017 SEUIL = 0.1; // aout 2013
while (subsupports == 0)
{
@@ -1006,6 +1043,26 @@
vect.set(v);
vect.sub(vect2);
+
+// vertextemp.x = other.averagepoints[c*3];
+// vertextemp.y = other.averagepoints[c*3+1];
+// vertextemp.z = other.averagepoints[c*3+2];
+//
+// Vertex v3 = vertextemp2;
+// v3.x = other.extremepoints[c*3];
+// v3.y = other.extremepoints[c*3+1];
+// v3.z = other.extremepoints[c*3+2];
+//
+// vect3.set(v3); // "X" axis apex
+// vect3.sub(vertextemp); // origin (center)
+//
+// double distmax = vect3.length();
+//
+// vect3.set(v2); // "X" axis apex
+// vect3.sub(vertextemp); // origin (center)
+//
+// if (vect3.length() >= distmax)
+// continue;
if (mindistance > vect.dot(vect))
{
@@ -1017,7 +1074,9 @@
subsupports = v.closestsupport==-1 ? 0 : supports[v.closestsupport].Length();
- SEUIL *= 2;
+ // previously for "contains", now for weights.
+ assert(subsupports > 0);
+ //SEUIL *= 2;
}
assert(subsupports > 0);
@@ -1204,6 +1263,7 @@
for (int wi = v0.weights.length; --wi>=0;)
v[wi] = 0;
+ CameraPane.CreateSelectedPoint();
CameraPane.selectedpoint.
getAverage(cStatic.point1, true);
@@ -1341,6 +1401,7 @@
v0.x = v0.y = v0.z = 0;
v0.norm.x = v0.norm.y = v0.norm.z = 0;
+ CameraPane.CreateSelectedPoint();
CameraPane.selectedpoint.
getAverage(cStatic.point1, true);
@@ -1492,7 +1553,7 @@
InitFaceIndices();
}
- BoundaryRep rep = (BoundaryRep) GraphreeD.clone(this);
+ BoundaryRep rep = (BoundaryRep) Grafreed.clone(this);
//float[] v = new float[100];
for (int loops=1; --loops>=0;)
@@ -1522,7 +1583,7 @@
InitFaceIndices();
}
- BoundaryRep rep = (BoundaryRep) GraphreeD.clone(this);
+ BoundaryRep rep = (BoundaryRep) Grafreed.clone(this);
//float[] v = new float[100];
for (int loops=10; --loops>=0;)
@@ -1869,7 +1930,7 @@
return;
}
- // System.exit(0);
+ // System.exit(0);
cVector vect = new cVector();
cVector normal = new cVector();
@@ -1940,7 +2001,10 @@
if (v.vertexlinks == null)
continue;
- if (v.weights != null && v.weights[j] == 0) // < 0.01 * v.totalweight) // == 0)
+ // Warning: faster but dangerous
+ if (v.weights != null && v.weights[j]
+ // == 0)
+ < 0.0001 * v.totalweight)
{
//testweight += v.weights[j-1];
continue;
@@ -2163,7 +2227,7 @@
// if (slow)
// aout 2013
// sept 2013 merde...
- W = 13;
+ W = 3; // 13;
// POSERATE
if (CameraPane.tickcount > 0 || CameraPane.SLOWPOSE)
@@ -2221,6 +2285,8 @@
transient int lastsoundtime;
+ transient boolean once = false;
+
void setMasterThis0(BoundaryRep other, double[][] toRoot, boolean smooth, boolean marked)
{
if (LA.isIdentity(toRoot))
@@ -2276,7 +2342,11 @@
if (v.totalweight == 0)
{
- System.err.println("v.totalweight == 0! --> " + this + " : " + other);
+ if (!once)
+ {
+ System.err.println("v.totalweight == 0! --> " + this + " : " + other);
+ once = true;
+ }
continue;
}
@@ -2600,7 +2670,7 @@
// if (stepout && !playedonce)
// {
// // sound
-// GraphreeD.wav.play();
+// GrafreeD.wav.play();
// playedonce = true;
// }
//
@@ -2635,18 +2705,18 @@
if (false) // slow && stepout && onein)
{
// sound
- cVector eye = CameraPane.theRenderer.eyeCamera.location;
+ cVector eye = Globals.theRenderer.EyeCamera().location;
Vertex v = GetVertex(0);
tmp.set(v);
tmp.sub(eye);
- if (CameraPane.framecount - lastsoundtime > 30) // 0.25 secs
+ if (Globals.framecount - lastsoundtime > 30) // 0.25 secs
{
- GraphreeD.wav.play((Math.random()+0.5)/Math.max(tmp.length2(),0.2)); //, 1);
+ Grafreed.wav.play((Math.random()+0.5)/Math.max(tmp.length2(),0.2)); //, 1);
- lastsoundtime = CameraPane.framecount;
+ lastsoundtime = Globals.framecount;
}
stepout = false;
@@ -3072,6 +3142,7 @@
//
// transient VertexCompare[] vertexcompare = null;
+ // Check if v0 is close enough from any vertex of the given subobject of this.
boolean Contains(Vertex v0, int object)
{
int start = startvertices[object-1];
@@ -3129,7 +3200,27 @@
*/
}
- void GenUV()
+ void UnfoldUV()
+ {
+ for (int i = 0; i < VertexCount(); i++)
+ {
+ Vertex v = GetVertex(i);
+
+ v.x = v.s;
+ v.y = v.t;
+ v.z = 0;
+
+ v.norm.x = 0;
+ v.norm.y = 0;
+ v.norm.z = 1;
+
+ SetVertex(v, i);
+ }
+ }
+
+ float power = 2;
+
+ void GenUV() // float power)
{
Trim();
@@ -3193,6 +3284,125 @@
y -= 0.5;
z -= 0.5;
+ double ax = Math.abs(x);
+ double ay = Math.abs(y);
+ double max = ax;
+ if (max < ay)
+ {
+ max = ay;
+ }
+
+ if (max == 0)
+ {
+ uvmap[i2] = 0.5f;
+ uvmap[i2+1] = 0.5f;
+ continue;
+ }
+
+ x /= max;
+ y /= max;
+
+ double angle = Math.acos(Math.abs(z*2));
+
+ double k = angle / Math.PI * 2;
+
+ assert(k >= 0);
+
+ // k == 0 => uv = 0 (center)
+ // k == 1 => uv = -1,1 (border)
+
+ if (i == 0)
+ System.out.println("power = " + power);
+
+ double length1 = (ax+ay)/max;
+ double length2 = Math.sqrt(ax*ax + ay*ay) / max;
+
+ double t = k;
+
+ t = Math.pow(t, 3);
+
+ // Interpolate between k/length2 (center) and k (border)
+ if (length2 > 0)
+ k *= (1 - t) / length2 + t;
+
+ double u = k*x;
+ double v = k*y;
+
+ u /= 2;
+ v /= 2;
+ u += 0.5;
+ v += 0.5;
+
+ uvmap[i2] = (float) u;
+ uvmap[i2+1] = (float) v;
+ }
+ }
+
+ void GenUVold(float power)
+ {
+ Trim();
+
+ cVector boxcenter = null;
+ cVector minima, maxima;
+ minima = new cVector();
+ maxima = new cVector();
+ minima.x = minima.y = minima.z = Double.MAX_VALUE;
+ maxima.x = maxima.y = maxima.z = -Double.MAX_VALUE;
+ for (int i = 0; i < VertexCount(); i++)
+ {
+ Vertex v = GetVertex(i);
+
+ if (minima.x > v.x)
+ {
+ minima.x = v.x;
+ }
+ if (minima.y > v.y)
+ {
+ minima.y = v.y;
+ }
+ if (minima.z > v.z)
+ {
+ minima.z = v.z;
+ }
+
+ if (maxima.x < v.x)
+ {
+ maxima.x = v.x;
+ }
+ if (maxima.y < v.y)
+ {
+ maxima.y = v.y;
+ }
+ if (maxima.z < v.z)
+ {
+ maxima.z = v.z;
+ }
+ }
+
+ boxcenter = new cVector((maxima.x + minima.x) / 2, (maxima.y + minima.y) / 2, (maxima.z + minima.z) / 2);
+ int i2 = 0, i3 = 0;
+ for (int i = 0; i < positions.length/3; i++, i3 += 3, i2 += 2)
+ {
+// //uvmap[i2] = (float) normals[i3]*0.5f + 0.5f; // v.x;
+// //uvmap[i2 + 1] = (float) normals[i3+1]*0.5f + 0.5f; //z;
+// uvmap[i2] = (float) (positions[i3] - boxcenter.x);
+// uvmap[i2 + 1] = (float) (positions[i3+2] - boxcenter.z);
+// uvmap[i2] = (float) Math.atan2(positions[i3+1] - boxcenter.y, positions[i3] - boxcenter.x);
+// uvmap[i2 + 1] = (float)(positions[i3+2] - boxcenter.z);
+ // box UV
+ double x = positions[i3] - minima.x; // - Math.floor(positions[i3]);
+ double y = positions[i3+1] - minima.y; // - Math.floor(positions[i3+1]);
+ double z = positions[i3+2] - minima.z; // - Math.floor(positions[i3+2]);
+
+ // [-1/2, 1/2]
+ x /= maxima.x - minima.x;
+ y /= maxima.y - minima.y;
+ z /= maxima.z - minima.z;
+
+ x -= 0.5;
+ y -= 0.5;
+ z -= 0.5;
+
// x *= 2;
// y *= 2;
// z *= 2;
@@ -3219,6 +3429,15 @@
z = Math.cos(angle/2);
+ assert(z >= 0);
+ assert(z <= 1);
+
+ /**/
+ //z = Math.pow(z, power); //1.08f);
+
+ if (i == 0)
+ System.out.println("power = " + power);
+
// sqrt(k2*x2 + k2*z2 + y2) = length
// k2*x2 + k2*z2 = length2 - y2
// k2 = (length2 - y2) / (x2 + z2)
@@ -3229,7 +3448,7 @@
k /= x*x + y*y;
}
else
- GraphreeD.Assert(z == 1);
+ Grafreed.Assert(z == 1);
if (k < 0)
k = 0;
@@ -3238,6 +3457,7 @@
x *= k;
y *= k;
+ /**/
double max = Math.abs(x);
if (max < Math.abs(y))
@@ -3250,10 +3470,15 @@
}
// max = Math.sqrt(max*2)/2;
+// double x2 = Math.pow(Math.abs(x), 1/power);
+// double y2 = Math.pow(Math.abs(y), 1/power);
+// double z2 = Math.pow(Math.abs(z), 1/power);
+// max = Math.pow(x2 + y2 + z2, power);
// if (!(max > 0))
- assert(max > 0);
-
+ //assert(max > 0);
+ assert(max >= 0);
+
x /= max;
y /= max;
z /= max;
@@ -3516,6 +3741,111 @@
*/
}
+ void GenerateNormals2(boolean crease)
+ {
+ cVector tempVector = new cVector();
+
+// java.util.HashMap<cVector, cVector> tableBase = new java.util.HashMap<cVector, cVector>();
+//
+//
+// for (int i=0; i<this.VertexCount(); i++)
+// {
+// Vertex v = this.GetVertex(i);
+//
+// tempVector.set(v);
+//
+// cVector n = tableBase.get(tempVector.ToFloat());
+//
+// if (n != null)
+// {
+// continue;
+// }
+//
+// tableBase.put(new cVector(tempVector), new cVector(v.norm));
+// }
+
+ BoundaryRep tempSupport = this.support;
+
+ this.support = null;
+
+ BoundaryRep tempRep = (BoundaryRep)Grafreed.clone(this);
+
+ this.support = tempSupport;
+
+ //tempRep.Unstripify();
+
+ tempRep.GenerateNormals2(crease);
+
+ boolean keepnormal = Vertex.normalmode;
+ boolean epsequal = Grafreed.epsequal;
+
+ Vertex.normalmode = false;
+ Grafreed.epsequal = false; // A bit strange
+
+ // No need to have a match for vertex counts.
+
+ java.util.HashMap<cVector, cVector> table = new java.util.HashMap<cVector, cVector>();
+
+ for (int i=0; i<tempRep.VertexCount(); i++)
+ {
+ Vertex v = tempRep.GetVertex(i);
+
+ cVector n = table.get(tempVector.ToFloat());
+
+ if (v.norm.x == 1 && v.norm.y == 0 && v.norm.z == 0)
+ {
+ //continue;
+ }
+
+ tempVector.set(v);
+
+ //cVector nBase = tableBase.get(tempVector);
+
+ //if (v.norm.dot(nBase) < 0.9)
+ //{
+ // continue;
+ //}
+
+ if (n != null && n.x == 1 && n.y == 0 && n.z == 0)
+ {
+ //continue;
+ }
+
+ if (n != null)
+ {
+// if (n.dot(v.norm) < 0)
+// n.sub(v.norm);
+// else
+// n.add(v.norm);
+//
+// n.normalize();
+ continue;
+ }
+
+ table.put(new cVector(tempVector), new cVector(v.norm));
+ }
+
+ for (int i=0; i<this.VertexCount(); i++)
+ {
+ Vertex v = this.GetVertex(i);
+
+ tempVector.set(v);
+
+ cVector n = table.get(tempVector.ToFloat());
+
+ //if (n.dot(v.norm) < 0)
+ if (n == null)
+ continue;
+
+ LA.vecCopy(n, v.norm);
+
+ this.SetVertex(v, i);
+ }
+
+ Grafreed.epsequal = epsequal;
+ Vertex.normalmode = keepnormal;
+ }
+
void GenerateNormals(boolean crease)
{
boolean wastrim = trimmed;
@@ -3531,7 +3861,29 @@
e.printStackTrace();
}
- Trim(wastrim,true,crease,wasstrip,false);
+ Trim(true/*wastrim*/,true,crease,wasstrip,false);
+ }
+
+ void GenerateNormalsMesh()
+ {
+ if (stripified)
+ {
+ Unstripify();
+ }
+
+ if (trimmed)
+ {
+ normals = null;
+ }
+ else
+ {
+ for (int i=VertexCount(); --i>=0;)
+ {
+ Vertex v = GetVertex(i);
+
+ v.norm = null;
+ }
+ }
}
void GenNormalsJME()
@@ -3656,7 +4008,7 @@
NormalGenerator ng;
if (crease)
- ng = new NormalGenerator(Math.PI/6); // default is 44 degrees (or Math.PI/3); // /4);
+ ng = new NormalGenerator(Math.PI/4); // default is 44 degrees (or Math.PI/3); // /4);
else
ng = new NormalGenerator(Math.PI); // (Math.PI / 3); // /4);
@@ -3674,8 +4026,6 @@
//System.out.println("NEW = " + positions.length);
uvmap = new float[ta.getVertexCount() * 2];
- colors = new float[ta.getVertexCount()]; // * 3];
-
ta.getCoordinates(0, positions);
ta.getNormals(0, normals);
// ta.getColors(0, colors);
@@ -3683,12 +4033,24 @@
System.out.println("UV = " + uvmap[2] + ", " + uvmap[3] + ";");
+ colors = null;
+// colors = new float[ta.getVertexCount()]; // * 3];
+//
+// for (int i=colors.length; --i>=0;)
+// {
+// colors[i] = 1;
+// }
+
triangles = new int[ta.getVertexCount()];
for (int i = 0; i < triangles.length; i++)
{
triangles[i] = i;
}
+
+// Untrim();
+ if (!trimmed)
+ MergeNormals();
}
}
@@ -3716,12 +4078,18 @@
positions = new float[3 * ga.getVertexCount()];
normals = new float[3 * ga.getVertexCount()];
uvmap = new float[2 * ga.getVertexCount()];
- colors = new float[1 * ga.getVertexCount()];
tsa.getCoordinates(0, positions);
tsa.getNormals(0, normals);
tsa.getTextureCoordinates(0, 0, uvmap);
// tsa.getColors(0, colors);
+
+ colors = null;
+// colors = new float[1 * ga.getVertexCount()];
+// for (int i=colors.length; --i>=0;)
+// {
+// colors[i] = 1;
+// }
int stripcount = tsa.getNumStrips();
triangles = new int[stripcount];
@@ -3730,6 +4098,7 @@
stripified = true;
} catch (ClassCastException e)
{
+ // ??? aug 2019
TriangleArray ta = (TriangleArray) ga;
positions = new float[3 * ga.getVertexCount()];
@@ -3744,6 +4113,10 @@
triangles = new int[1];
triangles[0] = 3;
}
+
+ //Untrim();
+ if (!trimmed)
+ MergeNormals();
}
/*
@@ -3776,21 +4149,66 @@
for (int i = 0; i < VertexCount(); i++)
{
Vertex v = GetVertex(i);
+
+ vertextemp.set(v);
+
//if (v.norm.x == 0 && v.norm.y == 0 && v.norm.z == 0)
{
- GenerateNormal(i, v);
- SetVertex(v, i);
+ if (!GenerateNormal(i, vertextemp))
+ continue;
+
+ if (v.norm.dot(vertextemp.norm) < 0)
+ vertextemp.norm.mul(-1);
+
+ if (v.norm.dot(vertextemp.norm) < 0.9)
+ SetVertex(vertextemp, i);
}
}
Vertex.normalmode = false;
}
+ void MergeNormals()
+ {
+ assert(!trimmed);
+
+ boolean smooth = Grafreed.smoothmode;
+ boolean link = Grafreed.linkUV;
+ Grafreed.smoothmode = true;
+ Grafreed.linkUV = true;
+
+ System.out.println("#Vertex = " + VertexCount());
+ System.out.println("#Face = " + FaceCount());
+
+ java.util.HashSet<Vertex> table = new java.util.HashSet<Vertex>();
+
+ for (int i = 0; i < VertexCount(); i++)
+ {
+ Vertex v = GetVertex(i);
+
+ if (!table.contains(v))
+ {
+ table.add(v);
+ }
+ }
+
+ Grafreed.smoothmode = smooth;
+ Grafreed.linkUV = link;
+
+// for (int i = 0; i < VertexCount(); i++)
+// {
+// Vertex v = GetVertex(i);
+//
+// table.add(v);
+// }
+
+ }
+
static cVector temp1 = new cVector();
static cVector temp2 = new cVector();
static cVector temp3 = new cVector();
- void GenerateNormal(int index, Vertex v)
+ boolean GenerateNormal(int index, Vertex v)
{
//System.out.println("Old normal = " + v.norm);
LA.setVector(v.norm, 0, 0, 0);
@@ -3819,6 +4237,10 @@
LA.vecSub(p/*.pos*/, v/*.pos*/, temp1);
LA.vecSub(q/*.pos*/, v/*.pos*/, temp2);
}
+ else
+ {
+ continue;
+ }
//LA.vecNormalize(temp1);
//LA.vecNormalize(temp2);
@@ -3829,17 +4251,25 @@
double s = temp3.length();
//double c = temp2.dot(temp1);
+ if (s == 0)
+ return false;
+
float angle = 1; // (float) Math.atan2(s, c);
//if(angle < 0) angle = -angle;
//LA.vecNormalize(temp3);
LA.vecScale(temp3, angle / s);
+// if (temp3.dot(v.norm) < 0)
+// assert(temp3.dot(v.norm) >= 0);
+
LA.vecAdd(temp3, v.norm, v.norm);
}
LA.vecNormalize(v.norm);
//System.out.println("New normal = " + v.norm);
+
+ return true;
}
double Arccos(double x)
@@ -4233,7 +4663,7 @@
int count = VertexCount();
// mars 2014
- while (step >= count)
+ while (step > count)
step /= 10;
for (int i = 0; i < count; i+=step)
@@ -4381,7 +4811,7 @@
}
}
- void CullVertex(javax.media.opengl.GL gl, boolean shadow)
+ void CullVertex(javax.media.opengl.GL glNOTUSED, boolean shadowNOTUSED)
{
CameraPane.glu.gluProject(vect5.x,vect5.y,vect5.z,
CameraPane.tempmat,0, CameraPane.tempmat2,0,
@@ -4413,14 +4843,14 @@
// june 2014
// Camera parentcam = cam;
//
-// if (cam == CameraPane.theRenderer.cameras[0])
+// if (cam == Globals.theRenderer.cameras[0])
// {
-// parentcam = CameraPane.theRenderer.cameras[1];
+// parentcam = Globals.theRenderer.cameras[1];
// }
//
-// if (cam == CameraPane.theRenderer.cameras[1])
+// if (cam == Globals.theRenderer.cameras[1])
// {
-// parentcam = CameraPane.theRenderer.cameras[0];
+// parentcam = Globals.theRenderer.cameras[0];
// }
gl.glGetDoublev(gl.GL_MODELVIEW_MATRIX, CameraPane.tempmat, 0);
@@ -4546,16 +4976,25 @@
{
i3 = positions.length-3;
i2 = uvmap.length - 2;
- new Exception().printStackTrace();
+ //new Exception().printStackTrace();
}
v./*pos.*/x = positions[i3];
v./*pos.*/y = positions[i3 + 1];
v./*pos.*/z = positions[i3 + 2];
- v.norm.x = normals[i3];
- v.norm.y = normals[i3 + 1];
- v.norm.z = normals[i3 + 2];
+ if (normals == null)
+ {
+ v.norm.x = 0;
+ v.norm.y = 0;
+ v.norm.z = 0;
+ }
+ else
+ {
+ v.norm.x = normals[i3];
+ v.norm.y = normals[i3 + 1];
+ v.norm.z = normals[i3 + 2];
+ }
v.s = uvmap[i2];
v.t = uvmap[i2 + 1];
@@ -4846,7 +5285,7 @@
return verticesCopy;
}
- void PreprocessOcclusion(CameraPane cp, double[][] transform)
+ void PreprocessOcclusion(iCameraPane cp, double[][] transform)
{
if (//!trimmed ||
AOdone)
@@ -4855,80 +5294,7 @@
return;
}
- Camera keep = cp.renderCamera;
- cp.renderCamera = localcamera;
-
- if (trimmed)
- {
- float[] colors = new float[positions.length / 3];
-
- int i3 = 0;
- for (int i = 0; i < positions.length / 3; i++, i3 += 3)
- {
- if (normals[i3] == 0 && normals[i3+1] == 0 && normals[i3+2] == 0)
- continue;
-
- from.set(positions[i3], positions[i3 + 1], positions[i3 + 2]);
- to.set(positions[i3] + normals[i3],
- positions[i3 + 1] + normals[i3 + 1],
- positions[i3 + 2] + normals[i3 + 2]);
- LA.xformPos(from, transform, from);
- LA.xformPos(to, transform, to); // RIGID ONLY
- localcamera.setAim(from, to);
-
- CameraPane.occlusionbuffer.display();
-
- if (CameraPane.DEBUG_OCCLUSION)
- cp.display(); // debug
-
- colors[i] = cp.vertexOcclusion.r;
- //colors[i3 + 1] = cp.vertexOcclusion.g;
- //colors[i3 + 2] = cp.vertexOcclusion.b;
-
- if ((i % 1000) == 0 && i != 0)
- {
- CameraPane.theRenderer.setCursor(java.awt.Cursor.getPredefinedCursor(java.awt.Cursor.WAIT_CURSOR));
- //System.out.println("Color = " + cp.vertexOcclusion.r + ", " + cp.vertexOcclusion.g + ", " + cp.vertexOcclusion.b + "; " + (int)(100.0*i/(positions.length/3)) + "% done");
- System.out.println((int) (100.0 * i / (positions.length / 3)) + "% (" + i + " of " + (positions.length / 3) + ")");
- }
- }
-
- this.colors = colors;
- }
- else
- {
- for (int i = 0; i < VertexCount(); i++)
- {
- Vertex v = GetVertex(i);
-
- if (v.norm.x == 0 && v.norm.y == 0 && v.norm.z == 0)
- continue;
-
- from.set(v.x, v.y, v.z);
- to.set(v.x+v.norm.x, v.y+v.norm.y, v.z+v.norm.z);
- LA.xformPos(from, transform, from);
- LA.xformPos(to, transform, to); // RIGID ONLY
- localcamera.setAim(from, to);
-
- CameraPane.occlusionbuffer.display();
-
- if (CameraPane.DEBUG_OCCLUSION)
- cp.display(); // debug
-
- v.AO = cp.vertexOcclusion.r;
-
- if ((i % 1000) == 0 && i != 0)
- {
- CameraPane.theRenderer.setCursor(java.awt.Cursor.getPredefinedCursor(java.awt.Cursor.WAIT_CURSOR));
- //System.out.println("Color = " + cp.vertexOcclusion.r + ", " + cp.vertexOcclusion.g + ", " + cp.vertexOcclusion.b + "; " + (int)(100.0*i/(positions.length/3)) + "% done");
- System.out.println((int) (100.0 * i / VertexCount()) + "% (" + i + " of " + VertexCount() + ")");
- }
- }
- }
-
- System.out.println("done.");
-
- cp.renderCamera = keep;
+ cp.PrepOcclusion(this, transform);
AOdone = true;
}
@@ -5036,6 +5402,59 @@
}
}
colors = null;
+ }
+
+ void CreateMesh(iHeightField hf, int x, int y)
+ {
+ BoundaryRep tmp = new BoundaryRep();
+
+ int vc = 0;
+
+ Vertex v = new Vertex(true);
+
+ for (int i=0; i<x; i++)
+ {
+ for (int j=0; j<y; j++)
+ {
+// Vertex v = tmp.GetVertex(vc++);
+
+ v.s = v.x = i;
+ v.t = v.z = j;
+ v.s /= x; v.t /= y;
+ v.y = hf.f(i,j);
+
+ int iu = tmp.AddTableVertex(v);
+
+ v.s = v.x = i+1;
+ v.t = v.z = j;
+ v.s /= x; v.t /= y;
+ v.y = hf.f(i+1,j);
+
+ int iv = tmp.AddTableVertex(v);
+
+ v.s = v.x = i+1;
+ v.t = v.z = j+1;
+ v.s /= x; v.t /= y;
+ v.y = hf.f(i+1,j+1);
+
+ int iw = tmp.AddTableVertex(v);
+
+ v.s = v.x = i;
+ v.t = v.z = j+1;
+ v.s /= x; v.t /= y;
+ v.y = hf.f(i,j+1);
+
+ int ix = tmp.AddTableVertex(v);
+
+ tmp.AddFace(iu,iw,iv);
+ tmp.AddFace(iu,ix,iw);
+ }
+ }
+
+ Set(tmp);
+
+ Trim(true,false,true);
+ ClearColors();
}
void Stripify()
@@ -5290,25 +5709,27 @@
transient int nbbadfaces; // ?? = 1000000;
- int ChooseTriangle()
+ /*
+ */
+ int ChooseTriangle(boolean firstEquilateral)
{
int chosen = -1;
double minweight = 1E10;
+ int step = 8; // ?
+
+ if (firstEquilateral)
+ step = 1;
+
nbbadfaces = 0;
- for (int i=faces.size(); (i-=8)>=0;)
+ for (int i=0; i<faces.size(); i+=step)
+// for (int i=faces.size(); (i-=8)>=0;)
{
Face face = (Face) faces.get(i);
- //?? if (face.weight < 0)
- // continue;
-
- double K = 1; // 0.01; // .25;
-
- double factor = (1-K)*face.nbiterations + K; //*face.weight;
-
- double weight = FaceWeight(face); // *Math.pow(PerimeterMax(face),0.25)*factor;
+ if (face.used)
+ continue;
if (!Valid(face))
{
@@ -5319,6 +5740,15 @@
if (Boundary(face))
continue;
+// if (Boundary(face.p))
+// continue;
+//
+// if (Boundary(face.q))
+// continue;
+//
+// if (Boundary(face.r))
+// continue;
+
if (!ValidValence(face))
continue;
@@ -5327,14 +5757,58 @@
!ValidValence(face.r))
continue;
- if (minweight > weight)
+ //?? if (face.weight < 0)
+ // continue;
+
+ if (firstEquilateral)
{
- minweight = weight;
+ if (OneFaceUsed(links.get(face.p)))
+ continue;
+
+ if (OneFaceUsed(links.get(face.q)))
+ continue;
+
+ if (OneFaceUsed(links.get(face.r)))
+ continue;
+
chosen = i;
+ break;
+ }
+ else
+ {
+ double K = 1; // 0.01; // .25;
+
+ double factor = (1-K)*face.nbiterations + K; //*face.weight;
+
+ double weight = FaceWeight(face); // *Math.pow(PerimeterMax(face),0.25)*factor;
+
+ if (minweight > weight)
+ {
+ minweight = weight;
+ chosen = i;
+ if (minweight == 0)
+ break;
+ }
}
}
return chosen;
+ }
+
+ private boolean OneFaceUsed(Vector<Face> faces)
+ {
+ if (faces.size() != 6)
+ return true;
+
+ for (int i=0; i<6; i+=1)
+ {
+ if (faces.get(i).used)
+ {
+ return true;
+ }
+ }
+
+ return false;
}
static boolean remove3valence = true;
@@ -5370,7 +5844,7 @@
}
else
{
- assert(links.size() == vertices.size());
+ // TODO Grafreed.Assert(links.size() == vertices.size());
links.setSize(vertices.size());
for (int i=vertices.size(); --i>=0;)
@@ -5378,6 +5852,7 @@
// linkstouched[i] = false;
if (links.get(i) == null) // ??
{
+ new Exception().printStackTrace();
links.set(i, new Vector(8));
// linkstouched[i] = true;
}
@@ -5388,6 +5863,8 @@
}
}
+ boolean once = false;
+
for (int i=faces.size(); --i>=0;)
{
Face face = (Face) faces.get(i);
@@ -5399,6 +5876,9 @@
//if (linkstouched[face.r])
links.get(face.r).add(face);
+ if (face.used)
+ once = true;
+
face.good = 1;
face.boundary = -1;
}
@@ -6170,6 +6650,7 @@
void InitWeights()
{
+ new Exception().printStackTrace();
System.exit(0);
int n = 0;
int b = 0;
@@ -6763,6 +7244,10 @@
return (face.boundary = 1) == 1;
}
+ // June 2019
+ if (true)
+ return (face.boundary = 0) == 1;
+
// reverse triangle test
q1.set(p);
q2.set(q);
@@ -7019,6 +7504,7 @@
assert(f2.contains(i));
assert(f3.contains(i));
+ // when r is the "center", p is along the boundary
while (f0.r != i)
{
int t = f0.p;
@@ -7075,59 +7561,90 @@
f0 = f3;
f3 = t;
}
- atleastone = true;
+ int va = f0.q;
+ int vb = f0.r;
+ int vc = -1;
+
+ Face toremove1 = null;
+ Face toremove2 = null;
+
+ // f0 is the buffer for the first new triangle,
+ // and otherf is the other upper one.
Face otherf = null;
if (f1.contains(f0.p))
{
if (f1.p == f0.p)
{
+ assert(false);
f0.r = f1.q;
}
else
{
assert(f1.q == f0.p);
- f0.r = f1.p;
+ vc = f1.p;
}
otherf = f2;
- faces.remove(f1);
- faces.remove(f3);
+ toremove1 = f1;
+ toremove2 = f3;
}
else
if (f2.contains(f0.p))
{
if (f2.p == f0.p)
{
+ assert(false);
f0.r = f2.q;
}
else
{
assert(f2.q == f0.p);
- f0.r = f2.p;
+ vc = f2.p;
}
otherf = f3;
- faces.remove(f1);
- faces.remove(f2);
+ toremove1 = f1;
+ toremove2 = f2;
}
if (f3.contains(f0.p))
{
if (f3.p == f0.p)
{
+// assert(false);
+ new Exception().printStackTrace();
f0.r = f3.q;
}
else
{
assert(f3.q == f0.p);
- f0.r = f3.p;
+ vc = f3.p;
}
otherf = f1;
- faces.remove(f2);
- faces.remove(f3);
+ toremove1 = f2;
+ toremove2 = f3;
}
+
+ vertextemp.set(vertices.get(va));
+ vertextemp.sub(vertices.get(vb));
+ vertextemp.normalize();
+ vertextemp2.set(vertices.get(vc));
+ vertextemp2.sub(vertices.get(vb));
+ vertextemp2.normalize();
+
+ if (vertextemp.dot(vertextemp2) > -0.95)
+ {
+ continue;
+ }
+
+ atleastone = true;
+
+ f0.r = vc;
+
+ faces.remove(toremove1);
+ faces.remove(toremove2);
if (!f0.contains(otherf.p))
{
@@ -7180,7 +7697,7 @@
//InitWeights();
}
- int chosen = ChooseTriangle(); // Best is slow and not really better
+ int chosen = ChooseTriangle(true); // Best is slow and not really better
if (chosen == -1)
{
@@ -7194,7 +7711,7 @@
//remove3valence = false;
// InitWeights();
- chosen = ChooseTriangle();
+ chosen = ChooseTriangle(true);
}
}
@@ -7335,7 +7852,7 @@
Trim();
Untrim();
- BoundaryRep tmp = new BoundaryRep(); // (BoundaryRep) GraphreeD.clone(this);
+ BoundaryRep tmp = new BoundaryRep(); // (BoundaryRep) GrafreeD.clone(this);
double minx = Float.POSITIVE_INFINITY;
double maxx = Float.NEGATIVE_INFINITY;
@@ -7373,7 +7890,7 @@
if (max < maxz - minz)
max = maxz - minz;
- tmp.THRESHOLD = max/25; // 50;
+ tmp.THRESHOLD = 0.5; // max/25; // 50;
tmp.faces.clear();
@@ -7470,7 +7987,7 @@
// boolean lock;
- void SplitInTwo(boolean reduction34, boolean onlyone)
+ boolean SplitInTwo(boolean reduction34, boolean onlyone)
{
if (stripified)
{
@@ -7498,7 +8015,7 @@
s3 = new cVector();
}
- CameraPane.theRenderer.setCursor(java.awt.Cursor.getPredefinedCursor(java.awt.Cursor.WAIT_CURSOR));
+ Globals.theRenderer.setCursor(java.awt.Cursor.getPredefinedCursor(java.awt.Cursor.WAIT_CURSOR));
try
{
@@ -7507,12 +8024,12 @@
{
System.err.println("EXCEPTION CAUGHT");
e.printStackTrace();
- return;
+ return false;
} catch (Error e)
{
System.err.println("ERROR CAUGHT");
e.printStackTrace();
- return;
+ return false;
}
System.out.println("# faces = " + faces.size());
@@ -7522,6 +8039,7 @@
{
Face face = (Face) faces.get(i);
+ face.used = false;
face.nbiterations = 1;
face.weight = -1;
face.boundary = -1;
@@ -7573,6 +8091,11 @@
nbbadfaces = faces.size();
//remove3valence = true;
+ int count = 2;
+
+ if (onlyone)
+ count = 1;
+
firstpass = true;
int n = faces.size();
@@ -7588,12 +8111,13 @@
System.out.print('.');
}
System.out.println();
+ boolean atleastone = false;
int i = 0;
- while (reduction34 || faces.size() > n/2)
+ while (true) // reduction34 || faces.size() > n/2)
{
if (i++%100 == 0)
{
- CameraPane.theRenderer.setCursor(java.awt.Cursor.getPredefinedCursor(java.awt.Cursor.WAIT_CURSOR));
+ Globals.theRenderer.setCursor(java.awt.Cursor.getPredefinedCursor(java.awt.Cursor.WAIT_CURSOR));
System.out.println("#faces = " + faces.size());
// if (i != 1)
// break;
@@ -7611,6 +8135,8 @@
{
if (!RemoveOneTriangle())
break;
+
+ atleastone = true;
}
// if (iterationcount == 0)
// break;
@@ -7621,8 +8147,8 @@
break;
}
firstpass = false;
- if (onlyone)
- break; // one triangle only
+// if (--count<0 && !reduction34)
+// break; // one triangle only
}
InitLinks(false); // for further display
@@ -7637,7 +8163,9 @@
//Trim(true,cJME.gennormals,true,false); // doesn't work
Trim(true,false,false,false,false);
- CameraPane.theRenderer.setCursor(java.awt.Cursor.getPredefinedCursor(java.awt.Cursor.DEFAULT_CURSOR));
+ Globals.theRenderer.setCursor(java.awt.Cursor.getPredefinedCursor(java.awt.Cursor.DEFAULT_CURSOR));
+
+ return atleastone;
}
void UpdateIndices(Face face, Face minface)
@@ -7650,18 +8178,21 @@
face.p = minface.p;
//if (leafweights)
face.good = 0; // false;
+ face.used = true;
}
if (face.q == minface.p || face.q == minface.q || face.q == minface.r)
{
face.q = minface.p;
//if (leafweights)
face.good = 0; // false;
+ face.used = true;
}
if (face.r == minface.p || face.r == minface.q || face.r == minface.r)
{
face.r = minface.p;
//if (leafweights)
face.good = 0; // false;
+ face.used = true;
}
if (face.p >/*=*/ minface.q && face.p < minface.r)
@@ -7721,50 +8252,50 @@
if (v == 2)
vert = minface.r;
// Face face = (Face) faces.get(i);
- Vector<Face> vertfaces = links.get(vert);
- for (int i=vertfaces.size(); --i>=0;)
- {
- Face face = (Face) vertfaces.get(i);
-
- // if (face.weight == 10000)
- // continue;
-
- if (face.p == minface.p || face.q == minface.p || face.r == minface.p ||
- face.p == minface.q || face.q == minface.q || face.r == minface.q ||
- face.p == minface.r || face.q == minface.r || face.r == minface.r)
+ Vector<Face> vertfaces = links.get(vert);
+ for (int i=vertfaces.size(); --i>=0;)
{
- if (!leafweights)
+ Face face = (Face) vertfaces.get(i);
+
+ // if (face.weight == 10000)
+ // continue;
+
+ if (face.p == minface.p || face.q == minface.p || face.r == minface.p ||
+ face.p == minface.q || face.q == minface.q || face.r == minface.q ||
+ face.p == minface.r || face.q == minface.r || face.r == minface.r)
{
-// if(minfaceweight <= 0)
-// assert(minfaceweight > 0);
-//
-// //FaceWeight(face);
-// if(face.weight < 0)
-// assert(face.weight >= 0);
-
- face.weight += minfaceweight;
-
-// if (face.weight >= 10000)
-// assert(face.weight < 10000);
+ if (!leafweights)
+ {
+ // if(minfaceweight <= 0)
+ // assert(minfaceweight > 0);
+ //
+ // //FaceWeight(face);
+ // if(face.weight < 0)
+ // assert(face.weight >= 0);
+
+ face.weight += minfaceweight;
+
+ // if (face.weight >= 10000)
+ // assert(face.weight < 10000);
+ }
+ else
+ face.weight = -1;
+
+ face.nbiterations += 1;
+ face.boundary = -1;
+
+ Vertex p = (Vertex)vertices.get(face.p);
+ Vertex q = (Vertex)vertices.get(face.q);
+ Vertex r = (Vertex)vertices.get(face.r);
+
+ p.boundary = -1;
+ q.boundary = -1;
+ r.boundary = -1;
}
else
- face.weight = -1;
-
- face.nbiterations += 1;
- face.boundary = -1;
-
- Vertex p = (Vertex)vertices.get(face.p);
- Vertex q = (Vertex)vertices.get(face.q);
- Vertex r = (Vertex)vertices.get(face.r);
-
- p.boundary = -1;
- q.boundary = -1;
- r.boundary = -1;
+ assert(false);
}
- else
- assert(false);
}
- }
// TouchVertex(minface.p);
// TouchVertex(minface.q);
@@ -7932,6 +8463,8 @@
minface.q = minface.r = minface.p;
+ int count = 0;
+
for (int i=0; i<faces.size(); i++)
{
Face face = (Face) faces.get(i);
@@ -7943,6 +8476,9 @@
TouchVertex(face.r, true); // , minface.weight);
// assert(!lock);
faces.remove(i--);
+ count++;
+ if (count == 4)
+ break;
}
}
@@ -7960,6 +8496,7 @@
for (int i=vertfaces.size(); --i>=0;)
{
Face face = (Face) vertfaces.get(i);
+ face.used = true;
face.good = 0; // false;
if (leafweights)
face.weight = -1;
@@ -8006,7 +8543,7 @@
if (!trimmed)
return;
- GraphreeD.linkUV = false;
+ Grafreed.linkUV = false;
try
{
@@ -8214,9 +8751,6 @@
return "trim = " + trimmed + "; stripped = " + stripified + "; colors = " + colors + "; faces = " + (faces!=null?faces.size():null) + "; triangles = " + (triangles!=null?triangles.length:null) + "; indices = " + indices;
}
- static Camera localcamera = new Camera();
- static cVector from = new cVector();
- static cVector to = new cVector();
boolean trimmed = false;
boolean stripified = false;
transient boolean AOdone = false;
@@ -8224,8 +8758,10 @@
/*transient*/ int maxIndexV = 0;
/*transient*/ int bufV, bufF;
// Raw version
- private float[] positions;
- private float[] normals;
+ //private
+ float[] positions;
+ //private
+ float[] normals;
float[] colors;
private float[] uvmap;
private int[] triangles;
@@ -8239,7 +8775,8 @@
int[] startvertices;
float[] averagepoints;
float[] extremepoints;
- float[] supportsizes; // distance of closest point
+ float[] supportminsize; // distance of closest point
+ float[] supportmaxsize; // distance of fartest point
transient Hashtable vertextable;
/*transient*/ private Vertex[] verticesCopy;
--
Gitblit v1.6.2