~nbriere/GrafreeD.git - Noware Git Repository

..	..	@@ -161,6 +161,7 @@
161	161	\|\| FaceCount() != other.FaceCount()
162	162	\|\| !(indices == null ^ other.indices != null)) // july 2014
163	163	{
	164	+ // The meshes have different structures.
164	165	//new Exception().printStackTrace();
165	166	trimmed = other.trimmed;
166	167	stripified = other.stripified;
..	..	@@ -172,16 +173,16 @@
172	173	bufV = other.bufV;
173	174	bufF = other.bufF;
174	175
175		- positions = (float[]) GrafreeD.clone(other.positions);
176		- normals = (float[]) GrafreeD.clone(other.normals);
177		- colors = (float[]) GrafreeD.clone(other.colors);
178		- uvmap = (float[]) GrafreeD.clone(other.uvmap);
179		- triangles = (int[]) GrafreeD.clone(other.triangles);
	176	+ positions = (float[]) Grafreed.clone(other.positions);
	177	+ normals = (float[]) Grafreed.clone(other.normals);
	178	+ colors = (float[]) Grafreed.clone(other.colors);
	179	+ uvmap = (float[]) Grafreed.clone(other.uvmap);
	180	+ triangles = (int[]) Grafreed.clone(other.triangles);
180	181
181		- indices = (int[]) GrafreeD.clone(other.indices);
	182	+ indices = (int[]) Grafreed.clone(other.indices);
182	183
183		- vertices = (Vector<Vertex>) GrafreeD.clone(other.vertices);
184		- faces = (Vector<Face>) GrafreeD.clone(other.faces);
	184	+ vertices = (Vector<Vertex>) Grafreed.clone(other.vertices);
	185	+ faces = (Vector<Face>) Grafreed.clone(other.faces);
185	186	}
186	187	else
187	188	{
..	..	@@ -239,9 +240,16 @@
239	240	}
240	241	}
241	242
242		- Support[] InitConnections(BoundaryRep other)
	243	+ transient Support[] cachesupports = null;
	244	+
	245	+ Support[] InitConnections()
243	246	{
244		- int n = other.startvertices.length-1;
	247	+ if (cachesupports != null)
	248	+ {
	249	+ return cachesupports;
	250	+ }
	251	+
	252	+ int n = this.startvertices.length-1;
245	253
246	254	Support[] supports = new Support[n];
247	255
..	..	@@ -253,38 +261,60 @@
253	261
254	262	for (int object=1; object<=n; object++)
255	263	{
256		- int start = other.startvertices[object-1];
257		- int end = other.startvertices[object];
	264	+ int start = this.startvertices[object-1];
	265	+ int end = this.startvertices[object];
258	266
259	267	if (start == end)
260	268	continue; // ??
261	269
	270	+ /**
	271	+ Vertex v2 = vertextemp;
	272	+ v2.x = averagepoints[object*3];
	273	+ v2.y = averagepoints[object*3+1];
	274	+ v2.z = averagepoints[object*3+2];
	275	+
	276	+ //v2.set(GetVertex(this.startvertices[subsupport]));
	277	+
	278	+ // projected point
	279	+ Vertex v3 = vertextemp2;
	280	+ //GetVertex(this.startvertices[subsupport]);
	281	+ v3.x = extremepoints[object*3];
	282	+ v3.y = extremepoints[object*3+1];
	283	+ v3.z = extremepoints[object*3+2];
	284	+
	285	+ vect3.set(v3); // "X" axis apex
	286	+ vect3.sub(v2); // origin (center)
	287	+ vect3.normalize();
	288	+ /**/
	289	+
262	290	int linkcount = 0;
263	291
264	292	int objectinlist = -1;
	293	+
	294	+ Support subsupport = supports[object-1];
265	295
266	296	for (int object2=1; object2<=n; object2++)
267	297	{
268	298	for (int i = start; i < end; i++)
269	299	{
270		- Vertex v = other.GetVertex(i);
	300	+ Vertex v = this.GetVertex(i);
271	301
272		- //
273		- if (other.Contains(v, object2))
	302	+ // Check if v is close enough from any vertex of the given subobject.
	303	+ if (this.Contains(v, object2))
274	304	{
275		- if (linkcount == supports[object-1].links.length)
	305	+ if (linkcount == subsupport.links.length)
276	306	break;
277	307
278	308	if (object2 == object)
279	309	objectinlist = linkcount;
280	310
281		- supports[object-1].links[linkcount++] = object2;
	311	+ subsupport.links[linkcount++] = object2;
282	312	break;
283	313	}
284	314	}
285	315	}
286	316
287		- supports[object-1].links[linkcount] = -1;
	317	+ subsupport.links[linkcount] = -1;
288	318
289	319	if (objectinlist == -1)
290	320	assert(objectinlist != -1);
..	..	@@ -293,9 +323,9 @@
293	323	// assert(linkcount > 1);
294	324
295	325	// show main support as blue
296		- int first = supports[object-1].links[0];
297		- supports[object-1].links[0] = supports[object-1].links[objectinlist];
298		- supports[object-1].links[objectinlist] = first;
	326	+ int first = subsupport.links[0];
	327	+ subsupport.links[0] = subsupport.links[objectinlist];
	328	+ subsupport.links[objectinlist] = first;
299	329	}
300	330
301	331	for (int loop = 0; --loop>=0;)
..	..	@@ -353,7 +383,7 @@
353	383	supports = supports2;
354	384	}
355	385
356		- return supports;
	386	+ return cachesupports = supports;
357	387	}
358	388
359	389	double Distance2(Vertex v, Vertex v2, double dist2beat, double[][] toRoot, int k)
..	..	@@ -500,7 +530,7 @@
500	530	static Vertex vertextemp = new Vertex(true);
501	531	static Vertex vertextemp2 = new Vertex(true);
502	532
503		- static double SEUIL = 0.1f; // 0.1 for rag doll; 0.07;
	533	+ static double SEUIL = 0.05f; // 0.1 for rag doll; 0.07;
504	534
505	535	// Compute weight of point w/r to this
506	536	float ComputeWeight(Vertex v, double[][] toRoot, int k)
..	..	@@ -598,7 +628,7 @@
598	628	// ;
599	629	//
600	630
601		- supportsize = supportsizes[subsupport];
	631	+ supportsize = supportminsize[subsupport];
602	632
603	633	double K = supportsize / distmax;
604	634
..	..	@@ -650,11 +680,13 @@
650	680	// if (supportsize * fadefactor > 1)
651	681	// return 1;
652	682
653		- return supportsize * fadefactor;
	683	+ return //supportsize *
	684	+ supportsize * fadefactor;
654	685	}
655	686
656	687	void RecomputeBasis(BoundaryRep other, double[][] toRoot, Vertex v)
657	688	{
	689	+ CameraPane.CreateSelectedPoint();
658	690	CameraPane.selectedpoint.
659	691	getAverage(cStatic.point1, true);
660	692
..	..	@@ -952,7 +984,7 @@
952	984
953	985	// sept 2017 SEUIL = 0.1; // aout 2013
954	986
955		- supports = InitConnections(other);
	987	+ supports = other.InitConnections();
956	988
957	989	other.supports = supports; // should be the other way around...
958	990
..	..	@@ -972,6 +1004,7 @@
972	1004
973	1005	v.closestsupport = -1;
974	1006
	1007	+ CameraPane.CreateSelectedPoint();
975	1008	CameraPane.selectedpoint.
976	1009	getAverage(cStatic.point1, true);
977	1010
..	..	@@ -1230,6 +1263,7 @@
1230	1263	for (int wi = v0.weights.length; --wi>=0;)
1231	1264	v[wi] = 0;
1232	1265
	1266	+ CameraPane.CreateSelectedPoint();
1233	1267	CameraPane.selectedpoint.
1234	1268	getAverage(cStatic.point1, true);
1235	1269
..	..	@@ -1367,6 +1401,7 @@
1367	1401	v0.x = v0.y = v0.z = 0;
1368	1402	v0.norm.x = v0.norm.y = v0.norm.z = 0;
1369	1403
	1404	+ CameraPane.CreateSelectedPoint();
1370	1405	CameraPane.selectedpoint.
1371	1406	getAverage(cStatic.point1, true);
1372	1407
..	..	@@ -1518,7 +1553,7 @@
1518	1553	InitFaceIndices();
1519	1554	}
1520	1555
1521		- BoundaryRep rep = (BoundaryRep) GrafreeD.clone(this);
	1556	+ BoundaryRep rep = (BoundaryRep) Grafreed.clone(this);
1522	1557	//float[] v = new float[100];
1523	1558
1524	1559	for (int loops=1; --loops>=0;)
..	..	@@ -1548,7 +1583,7 @@
1548	1583	InitFaceIndices();
1549	1584	}
1550	1585
1551		- BoundaryRep rep = (BoundaryRep) GrafreeD.clone(this);
	1586	+ BoundaryRep rep = (BoundaryRep) Grafreed.clone(this);
1552	1587	//float[] v = new float[100];
1553	1588
1554	1589	for (int loops=10; --loops>=0;)
..	..	@@ -1895,7 +1930,7 @@
1895	1930	return;
1896	1931	}
1897	1932
1898		- // System.exit(0);
	1933	+ // System.exit(0);
1899	1934
1900	1935	cVector vect = new cVector();
1901	1936	cVector normal = new cVector();
..	..	@@ -1966,7 +2001,10 @@
1966	2001	if (v.vertexlinks == null)
1967	2002	continue;
1968	2003
1969		- if (v.weights != null && v.weights[j] == 0) // < 0.01 * v.totalweight) // == 0)
	2004	+ // Warning: faster but dangerous
	2005	+ if (v.weights != null && v.weights[j]
	2006	+ // == 0)
	2007	+ < 0.0001 * v.totalweight)
1970	2008	{
1971	2009	//testweight += v.weights[j-1];
1972	2010	continue;
..	..	@@ -2247,6 +2285,8 @@
2247	2285
2248	2286	transient int lastsoundtime;
2249	2287
	2288	+ transient boolean once = false;
	2289	+
2250	2290	void setMasterThis0(BoundaryRep other, double[][] toRoot, boolean smooth, boolean marked)
2251	2291	{
2252	2292	if (LA.isIdentity(toRoot))
..	..	@@ -2302,7 +2342,11 @@
2302	2342
2303	2343	if (v.totalweight == 0)
2304	2344	{
2305		- System.err.println("v.totalweight == 0! --> " + this + " : " + other);
	2345	+ if (!once)
	2346	+ {
	2347	+ System.err.println("v.totalweight == 0! --> " + this + " : " + other);
	2348	+ once = true;
	2349	+ }
2306	2350	continue;
2307	2351	}
2308	2352
..	..	@@ -2670,7 +2714,7 @@
2670	2714
2671	2715	if (Globals.framecount - lastsoundtime > 30) // 0.25 secs
2672	2716	{
2673		- GrafreeD.wav.play((Math.random()+0.5)/Math.max(tmp.length2(),0.2)); //, 1);
	2717	+ Grafreed.wav.play((Math.random()+0.5)/Math.max(tmp.length2(),0.2)); //, 1);
2674	2718
2675	2719	lastsoundtime = Globals.framecount;
2676	2720	}
..	..	@@ -3098,6 +3142,7 @@
3098	3142	//
3099	3143	// transient VertexCompare[] vertexcompare = null;
3100	3144
	3145	+ // Check if v0 is close enough from any vertex of the given subobject of this.
3101	3146	boolean Contains(Vertex v0, int object)
3102	3147	{
3103	3148	int start = startvertices[object-1];
..	..	@@ -3403,7 +3448,7 @@
3403	3448	k /= xx + yy;
3404	3449	}
3405	3450	else
3406		- GrafreeD.Assert(z == 1);
	3451	+ Grafreed.Assert(z == 1);
3407	3452
3408	3453	if (k < 0)
3409	3454	k = 0;
..	..	@@ -3696,6 +3741,111 @@
3696	3741	*/
3697	3742	}
3698	3743
	3744	+ void GenerateNormals2(boolean crease)
	3745	+ {
	3746	+ cVector tempVector = new cVector();
	3747	+
	3748	+// java.util.HashMap<cVector, cVector> tableBase = new java.util.HashMap<cVector, cVector>();
	3749	+//
	3750	+//
	3751	+// for (int i=0; i<this.VertexCount(); i++)
	3752	+// {
	3753	+// Vertex v = this.GetVertex(i);
	3754	+//
	3755	+// tempVector.set(v);
	3756	+//
	3757	+// cVector n = tableBase.get(tempVector.ToFloat());
	3758	+//
	3759	+// if (n != null)
	3760	+// {
	3761	+// continue;
	3762	+// }
	3763	+//
	3764	+// tableBase.put(new cVector(tempVector), new cVector(v.norm));
	3765	+// }
	3766	+
	3767	+ BoundaryRep tempSupport = this.support;
	3768	+
	3769	+ this.support = null;
	3770	+
	3771	+ BoundaryRep tempRep = (BoundaryRep)Grafreed.clone(this);
	3772	+
	3773	+ this.support = tempSupport;
	3774	+
	3775	+ //tempRep.Unstripify();
	3776	+
	3777	+ tempRep.GenerateNormals2(crease);
	3778	+
	3779	+ boolean keepnormal = Vertex.normalmode;
	3780	+ boolean epsequal = Grafreed.epsequal;
	3781	+
	3782	+ Vertex.normalmode = false;
	3783	+ Grafreed.epsequal = false; // A bit strange
	3784	+
	3785	+ // No need to have a match for vertex counts.
	3786	+
	3787	+ java.util.HashMap<cVector, cVector> table = new java.util.HashMap<cVector, cVector>();
	3788	+
	3789	+ for (int i=0; i<tempRep.VertexCount(); i++)
	3790	+ {
	3791	+ Vertex v = tempRep.GetVertex(i);
	3792	+
	3793	+ cVector n = table.get(tempVector.ToFloat());
	3794	+
	3795	+ if (v.norm.x == 1 && v.norm.y == 0 && v.norm.z == 0)
	3796	+ {
	3797	+ //continue;
	3798	+ }
	3799	+
	3800	+ tempVector.set(v);
	3801	+
	3802	+ //cVector nBase = tableBase.get(tempVector);
	3803	+
	3804	+ //if (v.norm.dot(nBase) < 0.9)
	3805	+ //{
	3806	+ // continue;
	3807	+ //}
	3808	+
	3809	+ if (n != null && n.x == 1 && n.y == 0 && n.z == 0)
	3810	+ {
	3811	+ //continue;
	3812	+ }
	3813	+
	3814	+ if (n != null)
	3815	+ {
	3816	+// if (n.dot(v.norm) < 0)
	3817	+// n.sub(v.norm);
	3818	+// else
	3819	+// n.add(v.norm);
	3820	+//
	3821	+// n.normalize();
	3822	+ continue;
	3823	+ }
	3824	+
	3825	+ table.put(new cVector(tempVector), new cVector(v.norm));
	3826	+ }
	3827	+
	3828	+ for (int i=0; i<this.VertexCount(); i++)
	3829	+ {
	3830	+ Vertex v = this.GetVertex(i);
	3831	+
	3832	+ tempVector.set(v);
	3833	+
	3834	+ cVector n = table.get(tempVector.ToFloat());
	3835	+
	3836	+ //if (n.dot(v.norm) < 0)
	3837	+ if (n == null)
	3838	+ continue;
	3839	+
	3840	+ LA.vecCopy(n, v.norm);
	3841	+
	3842	+ this.SetVertex(v, i);
	3843	+ }
	3844	+
	3845	+ Grafreed.epsequal = epsequal;
	3846	+ Vertex.normalmode = keepnormal;
	3847	+ }
	3848	+
3699	3849	void GenerateNormals(boolean crease)
3700	3850	{
3701	3851	boolean wastrim = trimmed;
..	..	@@ -3712,6 +3862,28 @@
3712	3862	}
3713	3863
3714	3864	Trim(true/wastrim/,true,crease,wasstrip,false);
	3865	+ }
	3866	+
	3867	+ void GenerateNormalsMesh()
	3868	+ {
	3869	+ if (stripified)
	3870	+ {
	3871	+ Unstripify();
	3872	+ }
	3873	+
	3874	+ if (trimmed)
	3875	+ {
	3876	+ normals = null;
	3877	+ }
	3878	+ else
	3879	+ {
	3880	+ for (int i=VertexCount(); --i>=0;)
	3881	+ {
	3882	+ Vertex v = GetVertex(i);
	3883	+
	3884	+ v.norm = null;
	3885	+ }
	3886	+ }
3715	3887	}
3716	3888
3717	3889	void GenNormalsJME()
..	..	@@ -3836,7 +4008,7 @@
3836	4008	NormalGenerator ng;
3837	4009
3838	4010	if (crease)
3839		- ng = new NormalGenerator(Math.PI/6); // default is 44 degrees (or Math.PI/3); // /4);
	4011	+ ng = new NormalGenerator(Math.PI/4); // default is 44 degrees (or Math.PI/3); // /4);
3840	4012	else
3841	4013	ng = new NormalGenerator(Math.PI); // (Math.PI / 3); // /4);
3842	4014
..	..	@@ -3854,8 +4026,6 @@
3854	4026	//System.out.println("NEW = " + positions.length);
3855	4027	uvmap = new float[ta.getVertexCount() * 2];
3856	4028
3857		- colors = new float[ta.getVertexCount()]; // * 3];
3858		-
3859	4029	ta.getCoordinates(0, positions);
3860	4030	ta.getNormals(0, normals);
3861	4031	// ta.getColors(0, colors);
..	..	@@ -3863,12 +4033,24 @@
3863	4033
3864	4034	System.out.println("UV = " + uvmap[2] + ", " + uvmap[3] + ";");
3865	4035
	4036	+ colors = null;
	4037	+// colors = new float[ta.getVertexCount()]; // * 3];
	4038	+//
	4039	+// for (int i=colors.length; --i>=0;)
	4040	+// {
	4041	+// colors[i] = 1;
	4042	+// }
	4043	+
3866	4044	triangles = new int[ta.getVertexCount()];
3867	4045
3868	4046	for (int i = 0; i < triangles.length; i++)
3869	4047	{
3870	4048	triangles[i] = i;
3871	4049	}
	4050	+
	4051	+// Untrim();
	4052	+ if (!trimmed)
	4053	+ MergeNormals();
3872	4054	}
3873	4055	}
3874	4056
..	..	@@ -3896,17 +4078,18 @@
3896	4078	positions = new float[3 * ga.getVertexCount()];
3897	4079	normals = new float[3 * ga.getVertexCount()];
3898	4080	uvmap = new float[2 * ga.getVertexCount()];
3899		- colors = new float[1 * ga.getVertexCount()];
3900	4081
3901	4082	tsa.getCoordinates(0, positions);
3902	4083	tsa.getNormals(0, normals);
3903	4084	tsa.getTextureCoordinates(0, 0, uvmap);
3904	4085	// tsa.getColors(0, colors);
3905		-
3906		- for (int i=colors.length; --i>=0;)
3907		- {
3908		- colors[i] = 1;
3909		- }
	4086	+
	4087	+ colors = null;
	4088	+// colors = new float[1 * ga.getVertexCount()];
	4089	+// for (int i=colors.length; --i>=0;)
	4090	+// {
	4091	+// colors[i] = 1;
	4092	+// }
3910	4093
3911	4094	int stripcount = tsa.getNumStrips();
3912	4095	triangles = new int[stripcount];
..	..	@@ -3915,6 +4098,7 @@
3915	4098	stripified = true;
3916	4099	} catch (ClassCastException e)
3917	4100	{
	4101	+ // ??? aug 2019
3918	4102	TriangleArray ta = (TriangleArray) ga;
3919	4103
3920	4104	positions = new float[3 * ga.getVertexCount()];
..	..	@@ -3929,6 +4113,10 @@
3929	4113	triangles = new int[1];
3930	4114	triangles[0] = 3;
3931	4115	}
	4116	+
	4117	+ //Untrim();
	4118	+ if (!trimmed)
	4119	+ MergeNormals();
3932	4120	}
3933	4121
3934	4122	/*
..	..	@@ -3978,6 +4166,42 @@
3978	4166	}
3979	4167
3980	4168	Vertex.normalmode = false;
	4169	+ }
	4170	+
	4171	+ void MergeNormals()
	4172	+ {
	4173	+ assert(!trimmed);
	4174	+
	4175	+ boolean smooth = Grafreed.smoothmode;
	4176	+ boolean link = Grafreed.linkUV;
	4177	+ Grafreed.smoothmode = true;
	4178	+ Grafreed.linkUV = true;
	4179	+
	4180	+ System.out.println("#Vertex = " + VertexCount());
	4181	+ System.out.println("#Face = " + FaceCount());
	4182	+
	4183	+ java.util.HashSet<Vertex> table = new java.util.HashSet<Vertex>();
	4184	+
	4185	+ for (int i = 0; i < VertexCount(); i++)
	4186	+ {
	4187	+ Vertex v = GetVertex(i);
	4188	+
	4189	+ if (!table.contains(v))
	4190	+ {
	4191	+ table.add(v);
	4192	+ }
	4193	+ }
	4194	+
	4195	+ Grafreed.smoothmode = smooth;
	4196	+ Grafreed.linkUV = link;
	4197	+
	4198	+// for (int i = 0; i < VertexCount(); i++)
	4199	+// {
	4200	+// Vertex v = GetVertex(i);
	4201	+//
	4202	+// table.add(v);
	4203	+// }
	4204	+
3981	4205	}
3982	4206
3983	4207	static cVector temp1 = new cVector();
..	..	@@ -4752,16 +4976,25 @@
4752	4976	{
4753	4977	i3 = positions.length-3;
4754	4978	i2 = uvmap.length - 2;
4755		- new Exception().printStackTrace();
	4979	+ //new Exception().printStackTrace();
4756	4980	}
4757	4981
4758	4982	v./pos./x = positions[i3];
4759	4983	v./pos./y = positions[i3 + 1];
4760	4984	v./pos./z = positions[i3 + 2];
4761	4985
4762		- v.norm.x = normals[i3];
4763		- v.norm.y = normals[i3 + 1];
4764		- v.norm.z = normals[i3 + 2];
	4986	+ if (normals == null)
	4987	+ {
	4988	+ v.norm.x = 0;
	4989	+ v.norm.y = 0;
	4990	+ v.norm.z = 0;
	4991	+ }
	4992	+ else
	4993	+ {
	4994	+ v.norm.x = normals[i3];
	4995	+ v.norm.y = normals[i3 + 1];
	4996	+ v.norm.z = normals[i3 + 2];
	4997	+ }
4765	4998
4766	4999	v.s = uvmap[i2];
4767	5000	v.t = uvmap[i2 + 1];
..	..	@@ -5476,17 +5709,27 @@
5476	5709
5477	5710	transient int nbbadfaces; // ?? = 1000000;
5478	5711
5479		- int ChooseTriangle()
	5712	+ /*
	5713	+ */
	5714	+ int ChooseTriangle(boolean firstEquilateral)
5480	5715	{
5481	5716	int chosen = -1;
5482	5717
5483	5718	double minweight = 1E10;
5484	5719
	5720	+ int step = 8; // ?
	5721	+
	5722	+ if (firstEquilateral)
	5723	+ step = 1;
	5724	+
5485	5725	nbbadfaces = 0;
5486		- for (int i=0; i<faces.size(); i+=8)
	5726	+ for (int i=0; i<faces.size(); i+=step)
5487	5727	// for (int i=faces.size(); (i-=8)>=0;)
5488	5728	{
5489	5729	Face face = (Face) faces.get(i);
	5730	+
	5731	+ if (face.used)
	5732	+ continue;
5490	5733
5491	5734	if (!Valid(face))
5492	5735	{
..	..	@@ -5496,6 +5739,15 @@
5496	5739
5497	5740	if (Boundary(face))
5498	5741	continue;
	5742	+
	5743	+// if (Boundary(face.p))
	5744	+// continue;
	5745	+//
	5746	+// if (Boundary(face.q))
	5747	+// continue;
	5748	+//
	5749	+// if (Boundary(face.r))
	5750	+// continue;
5499	5751
5500	5752	if (!ValidValence(face))
5501	5753	continue;
..	..	@@ -5508,22 +5760,55 @@
5508	5760	//?? if (face.weight < 0)
5509	5761	// continue;
5510	5762
5511		- double K = 1; // 0.01; // .25;
5512		-
5513		- double factor = (1-K)face.nbiterations + K; //face.weight;
5514		-
5515		- double weight = FaceWeight(face); // Math.pow(PerimeterMax(face),0.25)factor;
5516		-
5517		- if (minweight > weight)
	5763	+ if (firstEquilateral)
5518	5764	{
5519		- minweight = weight;
	5765	+ if (OneFaceUsed(links.get(face.p)))
	5766	+ continue;
	5767	+
	5768	+ if (OneFaceUsed(links.get(face.q)))
	5769	+ continue;
	5770	+
	5771	+ if (OneFaceUsed(links.get(face.r)))
	5772	+ continue;
	5773	+
5520	5774	chosen = i;
5521		- if (minweight == 0)
5522		- break;
	5775	+ break;
	5776	+ }
	5777	+ else
	5778	+ {
	5779	+ double K = 1; // 0.01; // .25;
	5780	+
	5781	+ double factor = (1-K)face.nbiterations + K; //face.weight;
	5782	+
	5783	+ double weight = FaceWeight(face); // Math.pow(PerimeterMax(face),0.25)factor;
	5784	+
	5785	+ if (minweight > weight)
	5786	+ {
	5787	+ minweight = weight;
	5788	+ chosen = i;
	5789	+ if (minweight == 0)
	5790	+ break;
	5791	+ }
5523	5792	}
5524	5793	}
5525	5794
5526	5795	return chosen;
	5796	+ }
	5797	+
	5798	+ private boolean OneFaceUsed(Vector<Face> faces)
	5799	+ {
	5800	+ if (faces.size() != 6)
	5801	+ return true;
	5802	+
	5803	+ for (int i=0; i<6; i+=1)
	5804	+ {
	5805	+ if (faces.get(i).used)
	5806	+ {
	5807	+ return true;
	5808	+ }
	5809	+ }
	5810	+
	5811	+ return false;
5527	5812	}
5528	5813
5529	5814	static boolean remove3valence = true;
..	..	@@ -5559,7 +5844,7 @@
5559	5844	}
5560	5845	else
5561	5846	{
5562		- assert(links.size() == vertices.size());
	5847	+ // TODO Grafreed.Assert(links.size() == vertices.size());
5563	5848
5564	5849	links.setSize(vertices.size());
5565	5850	for (int i=vertices.size(); --i>=0;)
..	..	@@ -5567,6 +5852,7 @@
5567	5852	// linkstouched[i] = false;
5568	5853	if (links.get(i) == null) // ??
5569	5854	{
	5855	+ new Exception().printStackTrace();
5570	5856	links.set(i, new Vector(8));
5571	5857	// linkstouched[i] = true;
5572	5858	}
..	..	@@ -5577,6 +5863,8 @@
5577	5863	}
5578	5864	}
5579	5865
	5866	+ boolean once = false;
	5867	+
5580	5868	for (int i=faces.size(); --i>=0;)
5581	5869	{
5582	5870	Face face = (Face) faces.get(i);
..	..	@@ -5588,6 +5876,9 @@
5588	5876	//if (linkstouched[face.r])
5589	5877	links.get(face.r).add(face);
5590	5878
	5879	+ if (face.used)
	5880	+ once = true;
	5881	+
5591	5882	face.good = 1;
5592	5883	face.boundary = -1;
5593	5884	}
..	..	@@ -6953,6 +7244,10 @@
6953	7244	return (face.boundary = 1) == 1;
6954	7245	}
6955	7246
	7247	+ // June 2019
	7248	+ if (true)
	7249	+ return (face.boundary = 0) == 1;
	7250	+
6956	7251	// reverse triangle test
6957	7252	q1.set(p);
6958	7253	q2.set(q);
..	..	@@ -7402,7 +7697,7 @@
7402	7697	//InitWeights();
7403	7698	}
7404	7699
7405		- int chosen = ChooseTriangle(); // Best is slow and not really better
	7700	+ int chosen = ChooseTriangle(true); // Best is slow and not really better
7406	7701
7407	7702	if (chosen == -1)
7408	7703	{
..	..	@@ -7416,7 +7711,7 @@
7416	7711	//remove3valence = false;
7417	7712	// InitWeights();
7418	7713
7419		- chosen = ChooseTriangle();
	7714	+ chosen = ChooseTriangle(true);
7420	7715	}
7421	7716	}
7422	7717
..	..	@@ -7692,7 +7987,7 @@
7692	7987
7693	7988	// boolean lock;
7694	7989
7695		- void SplitInTwo(boolean reduction34, boolean onlyone)
	7990	+ boolean SplitInTwo(boolean reduction34, boolean onlyone)
7696	7991	{
7697	7992	if (stripified)
7698	7993	{
..	..	@@ -7729,12 +8024,12 @@
7729	8024	{
7730	8025	System.err.println("EXCEPTION CAUGHT");
7731	8026	e.printStackTrace();
7732		- return;
	8027	+ return false;
7733	8028	} catch (Error e)
7734	8029	{
7735	8030	System.err.println("ERROR CAUGHT");
7736	8031	e.printStackTrace();
7737		- return;
	8032	+ return false;
7738	8033	}
7739	8034
7740	8035	System.out.println("# faces = " + faces.size());
..	..	@@ -7744,6 +8039,7 @@
7744	8039	{
7745	8040	Face face = (Face) faces.get(i);
7746	8041
	8042	+ face.used = false;
7747	8043	face.nbiterations = 1;
7748	8044	face.weight = -1;
7749	8045	face.boundary = -1;
..	..	@@ -7795,6 +8091,11 @@
7795	8091	nbbadfaces = faces.size();
7796	8092	//remove3valence = true;
7797	8093
	8094	+ int count = 2;
	8095	+
	8096	+ if (onlyone)
	8097	+ count = 1;
	8098	+
7798	8099	firstpass = true;
7799	8100
7800	8101	int n = faces.size();
..	..	@@ -7810,8 +8111,9 @@
7810	8111	System.out.print('.');
7811	8112	}
7812	8113	System.out.println();
	8114	+ boolean atleastone = false;
7813	8115	int i = 0;
7814		- while (reduction34 \|\| faces.size() > n/2)
	8116	+ while (true) // reduction34 \|\| faces.size() > n/2)
7815	8117	{
7816	8118	if (i++%100 == 0)
7817	8119	{
..	..	@@ -7833,6 +8135,8 @@
7833	8135	{
7834	8136	if (!RemoveOneTriangle())
7835	8137	break;
	8138	+
	8139	+ atleastone = true;
7836	8140	}
7837	8141	// if (iterationcount == 0)
7838	8142	// break;
..	..	@@ -7843,8 +8147,8 @@
7843	8147	break;
7844	8148	}
7845	8149	firstpass = false;
7846		- if (onlyone)
7847		- break; // one triangle only
	8150	+// if (--count<0 && !reduction34)
	8151	+// break; // one triangle only
7848	8152	}
7849	8153
7850	8154	InitLinks(false); // for further display
..	..	@@ -7860,6 +8164,8 @@
7860	8164	Trim(true,false,false,false,false);
7861	8165
7862	8166	Globals.theRenderer.setCursor(java.awt.Cursor.getPredefinedCursor(java.awt.Cursor.DEFAULT_CURSOR));
	8167	+
	8168	+ return atleastone;
7863	8169	}
7864	8170
7865	8171	void UpdateIndices(Face face, Face minface)
..	..	@@ -7872,18 +8178,21 @@
7872	8178	face.p = minface.p;
7873	8179	//if (leafweights)
7874	8180	face.good = 0; // false;
	8181	+ face.used = true;
7875	8182	}
7876	8183	if (face.q == minface.p \|\| face.q == minface.q \|\| face.q == minface.r)
7877	8184	{
7878	8185	face.q = minface.p;
7879	8186	//if (leafweights)
7880	8187	face.good = 0; // false;
	8188	+ face.used = true;
7881	8189	}
7882	8190	if (face.r == minface.p \|\| face.r == minface.q \|\| face.r == minface.r)
7883	8191	{
7884	8192	face.r = minface.p;
7885	8193	//if (leafweights)
7886	8194	face.good = 0; // false;
	8195	+ face.used = true;
7887	8196	}
7888	8197
7889	8198	if (face.p >/=/ minface.q && face.p < minface.r)
..	..	@@ -7943,50 +8252,50 @@
7943	8252	if (v == 2)
7944	8253	vert = minface.r;
7945	8254	// Face face = (Face) faces.get(i);
7946		- Vector<Face> vertfaces = links.get(vert);
7947		- for (int i=vertfaces.size(); --i>=0;)
7948		- {
7949		- Face face = (Face) vertfaces.get(i);
7950		-
7951		- // if (face.weight == 10000)
7952		- // continue;
7953		-
7954		- if (face.p == minface.p \|\| face.q == minface.p \|\| face.r == minface.p \|\|
7955		- face.p == minface.q \|\| face.q == minface.q \|\| face.r == minface.q \|\|
7956		- face.p == minface.r \|\| face.q == minface.r \|\| face.r == minface.r)
	8255	+ Vector<Face> vertfaces = links.get(vert);
	8256	+ for (int i=vertfaces.size(); --i>=0;)
7957	8257	{
7958		- if (!leafweights)
	8258	+ Face face = (Face) vertfaces.get(i);
	8259	+
	8260	+ // if (face.weight == 10000)
	8261	+ // continue;
	8262	+
	8263	+ if (face.p == minface.p \|\| face.q == minface.p \|\| face.r == minface.p \|\|
	8264	+ face.p == minface.q \|\| face.q == minface.q \|\| face.r == minface.q \|\|
	8265	+ face.p == minface.r \|\| face.q == minface.r \|\| face.r == minface.r)
7959	8266	{
7960		-// if(minfaceweight <= 0)
7961		-// assert(minfaceweight > 0);
7962		-//
7963		-// //FaceWeight(face);
7964		-// if(face.weight < 0)
7965		-// assert(face.weight >= 0);
7966		-
7967		- face.weight += minfaceweight;
7968		-
7969		-// if (face.weight >= 10000)
7970		-// assert(face.weight < 10000);
	8267	+ if (!leafweights)
	8268	+ {
	8269	+ // if(minfaceweight <= 0)
	8270	+ // assert(minfaceweight > 0);
	8271	+ //
	8272	+ // //FaceWeight(face);
	8273	+ // if(face.weight < 0)
	8274	+ // assert(face.weight >= 0);
	8275	+
	8276	+ face.weight += minfaceweight;
	8277	+
	8278	+ // if (face.weight >= 10000)
	8279	+ // assert(face.weight < 10000);
	8280	+ }
	8281	+ else
	8282	+ face.weight = -1;
	8283	+
	8284	+ face.nbiterations += 1;
	8285	+ face.boundary = -1;
	8286	+
	8287	+ Vertex p = (Vertex)vertices.get(face.p);
	8288	+ Vertex q = (Vertex)vertices.get(face.q);
	8289	+ Vertex r = (Vertex)vertices.get(face.r);
	8290	+
	8291	+ p.boundary = -1;
	8292	+ q.boundary = -1;
	8293	+ r.boundary = -1;
7971	8294	}
7972	8295	else
7973		- face.weight = -1;
7974		-
7975		- face.nbiterations += 1;
7976		- face.boundary = -1;
7977		-
7978		- Vertex p = (Vertex)vertices.get(face.p);
7979		- Vertex q = (Vertex)vertices.get(face.q);
7980		- Vertex r = (Vertex)vertices.get(face.r);
7981		-
7982		- p.boundary = -1;
7983		- q.boundary = -1;
7984		- r.boundary = -1;
	8296	+ assert(false);
7985	8297	}
7986		- else
7987		- assert(false);
7988	8298	}
7989		- }
7990	8299
7991	8300	// TouchVertex(minface.p);
7992	8301	// TouchVertex(minface.q);
..	..	@@ -8187,6 +8496,7 @@
8187	8496	for (int i=vertfaces.size(); --i>=0;)
8188	8497	{
8189	8498	Face face = (Face) vertfaces.get(i);
	8499	+ face.used = true;
8190	8500	face.good = 0; // false;
8191	8501	if (leafweights)
8192	8502	face.weight = -1;
..	..	@@ -8233,7 +8543,7 @@
8233	8543	if (!trimmed)
8234	8544	return;
8235	8545
8236		- GrafreeD.linkUV = false;
	8546	+ Grafreed.linkUV = false;
8237	8547
8238	8548	try
8239	8549	{
..	..	@@ -8465,7 +8775,8 @@
8465	8775	int[] startvertices;
8466	8776	float[] averagepoints;
8467	8777	float[] extremepoints;
8468		- float[] supportsizes; // distance of closest point
	8778	+ float[] supportminsize; // distance of closest point
	8779	+ float[] supportmaxsize; // distance of fartest point
8469	8780
8470	8781	transient Hashtable vertextable;
8471	8782	/transient/ private Vertex[] verticesCopy;