~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;
..	..	@@ -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,7 +680,8 @@
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)
..	..	@@ -952,7 +983,7 @@
952	983
953	984	// sept 2017 SEUIL = 0.1; // aout 2013
954	985
955		- supports = InitConnections(other);
	986	+ supports = other.InitConnections();
956	987
957	988	other.supports = supports; // should be the other way around...
958	989
..	..	@@ -1895,7 +1926,7 @@
1895	1926	return;
1896	1927	}
1897	1928
1898		- // System.exit(0);
	1929	+ // System.exit(0);
1899	1930
1900	1931	cVector vect = new cVector();
1901	1932	cVector normal = new cVector();
..	..	@@ -1966,7 +1997,10 @@
1966	1997	if (v.vertexlinks == null)
1967	1998	continue;
1968	1999
1969		- if (v.weights != null && v.weights[j] == 0) // < 0.01 * v.totalweight) // == 0)
	2000	+ // Warning: faster but dangerous
	2001	+ if (v.weights != null && v.weights[j]
	2002	+ // == 0)
	2003	+ < 0.001 * v.totalweight)
1970	2004	{
1971	2005	//testweight += v.weights[j-1];
1972	2006	continue;
..	..	@@ -2247,6 +2281,8 @@
2247	2281
2248	2282	transient int lastsoundtime;
2249	2283
	2284	+ transient boolean once = false;
	2285	+
2250	2286	void setMasterThis0(BoundaryRep other, double[][] toRoot, boolean smooth, boolean marked)
2251	2287	{
2252	2288	if (LA.isIdentity(toRoot))
..	..	@@ -2302,7 +2338,11 @@
2302	2338
2303	2339	if (v.totalweight == 0)
2304	2340	{
2305		- System.err.println("v.totalweight == 0! --> " + this + " : " + other);
	2341	+ if (!once)
	2342	+ {
	2343	+ System.err.println("v.totalweight == 0! --> " + this + " : " + other);
	2344	+ once = true;
	2345	+ }
2306	2346	continue;
2307	2347	}
2308	2348
..	..	@@ -3098,6 +3138,7 @@
3098	3138	//
3099	3139	// transient VertexCompare[] vertexcompare = null;
3100	3140
	3141	+ // Check if v0 is close enough from any vertex of the given subobject of this.
3101	3142	boolean Contains(Vertex v0, int object)
3102	3143	{
3103	3144	int start = startvertices[object-1];
..	..	@@ -3696,6 +3737,111 @@
3696	3737	*/
3697	3738	}
3698	3739
	3740	+ void GenerateNormals2(boolean crease)
	3741	+ {
	3742	+ cVector tempVector = new cVector();
	3743	+
	3744	+// java.util.HashMap<cVector, cVector> tableBase = new java.util.HashMap<cVector, cVector>();
	3745	+//
	3746	+//
	3747	+// for (int i=0; i<this.VertexCount(); i++)
	3748	+// {
	3749	+// Vertex v = this.GetVertex(i);
	3750	+//
	3751	+// tempVector.set(v);
	3752	+//
	3753	+// cVector n = tableBase.get(tempVector.ToFloat());
	3754	+//
	3755	+// if (n != null)
	3756	+// {
	3757	+// continue;
	3758	+// }
	3759	+//
	3760	+// tableBase.put(new cVector(tempVector), new cVector(v.norm));
	3761	+// }
	3762	+
	3763	+ BoundaryRep tempSupport = this.support;
	3764	+
	3765	+ this.support = null;
	3766	+
	3767	+ BoundaryRep tempRep = (BoundaryRep)Grafreed.clone(this);
	3768	+
	3769	+ this.support = tempSupport;
	3770	+
	3771	+ //tempRep.Unstripify();
	3772	+
	3773	+ tempRep.GenerateNormals2(crease);
	3774	+
	3775	+ boolean keepnormal = Vertex.normalmode;
	3776	+ boolean epsequal = Grafreed.epsequal;
	3777	+
	3778	+ Vertex.normalmode = false;
	3779	+ Grafreed.epsequal = false; // A bit strange
	3780	+
	3781	+ // No need to have a match for vertex counts.
	3782	+
	3783	+ java.util.HashMap<cVector, cVector> table = new java.util.HashMap<cVector, cVector>();
	3784	+
	3785	+ for (int i=0; i<tempRep.VertexCount(); i++)
	3786	+ {
	3787	+ Vertex v = tempRep.GetVertex(i);
	3788	+
	3789	+ cVector n = table.get(tempVector.ToFloat());
	3790	+
	3791	+ if (v.norm.x == 1 && v.norm.y == 0 && v.norm.z == 0)
	3792	+ {
	3793	+ //continue;
	3794	+ }
	3795	+
	3796	+ tempVector.set(v);
	3797	+
	3798	+ //cVector nBase = tableBase.get(tempVector);
	3799	+
	3800	+ //if (v.norm.dot(nBase) < 0.9)
	3801	+ //{
	3802	+ // continue;
	3803	+ //}
	3804	+
	3805	+ if (n != null && n.x == 1 && n.y == 0 && n.z == 0)
	3806	+ {
	3807	+ //continue;
	3808	+ }
	3809	+
	3810	+ if (n != null)
	3811	+ {
	3812	+// if (n.dot(v.norm) < 0)
	3813	+// n.sub(v.norm);
	3814	+// else
	3815	+// n.add(v.norm);
	3816	+//
	3817	+// n.normalize();
	3818	+ continue;
	3819	+ }
	3820	+
	3821	+ table.put(new cVector(tempVector), new cVector(v.norm));
	3822	+ }
	3823	+
	3824	+ for (int i=0; i<this.VertexCount(); i++)
	3825	+ {
	3826	+ Vertex v = this.GetVertex(i);
	3827	+
	3828	+ tempVector.set(v);
	3829	+
	3830	+ cVector n = table.get(tempVector.ToFloat());
	3831	+
	3832	+ //if (n.dot(v.norm) < 0)
	3833	+ if (n == null)
	3834	+ continue;
	3835	+
	3836	+ LA.vecCopy(n, v.norm);
	3837	+
	3838	+ this.SetVertex(v, i);
	3839	+ }
	3840	+
	3841	+ Grafreed.epsequal = epsequal;
	3842	+ Vertex.normalmode = keepnormal;
	3843	+ }
	3844	+
3699	3845	void GenerateNormals(boolean crease)
3700	3846	{
3701	3847	boolean wastrim = trimmed;
..	..	@@ -3712,6 +3858,28 @@
3712	3858	}
3713	3859
3714	3860	Trim(true/wastrim/,true,crease,wasstrip,false);
	3861	+ }
	3862	+
	3863	+ void GenerateNormalsMesh()
	3864	+ {
	3865	+ if (stripified)
	3866	+ {
	3867	+ Unstripify();
	3868	+ }
	3869	+
	3870	+ if (trimmed)
	3871	+ {
	3872	+ normals = null;
	3873	+ }
	3874	+ else
	3875	+ {
	3876	+ for (int i=VertexCount(); --i>=0;)
	3877	+ {
	3878	+ Vertex v = GetVertex(i);
	3879	+
	3880	+ v.norm = null;
	3881	+ }
	3882	+ }
3715	3883	}
3716	3884
3717	3885	void GenNormalsJME()
..	..	@@ -3836,7 +4004,7 @@
3836	4004	NormalGenerator ng;
3837	4005
3838	4006	if (crease)
3839		- ng = new NormalGenerator(Math.PI/6); // default is 44 degrees (or Math.PI/3); // /4);
	4007	+ ng = new NormalGenerator(Math.PI/4); // default is 44 degrees (or Math.PI/3); // /4);
3840	4008	else
3841	4009	ng = new NormalGenerator(Math.PI); // (Math.PI / 3); // /4);
3842	4010
..	..	@@ -3869,6 +4037,10 @@
3869	4037	{
3870	4038	triangles[i] = i;
3871	4039	}
	4040	+
	4041	+// Untrim();
	4042	+ if (!trimmed)
	4043	+ MergeNormals();
3872	4044	}
3873	4045	}
3874	4046
..	..	@@ -3929,6 +4101,10 @@
3929	4101	triangles = new int[1];
3930	4102	triangles[0] = 3;
3931	4103	}
	4104	+
	4105	+ //Untrim();
	4106	+ if (!trimmed)
	4107	+ MergeNormals();
3932	4108	}
3933	4109
3934	4110	/*
..	..	@@ -3978,6 +4154,42 @@
3978	4154	}
3979	4155
3980	4156	Vertex.normalmode = false;
	4157	+ }
	4158	+
	4159	+ void MergeNormals()
	4160	+ {
	4161	+ assert(!trimmed);
	4162	+
	4163	+ boolean smooth = Grafreed.smoothmode;
	4164	+ boolean link = Grafreed.linkUV;
	4165	+ Grafreed.smoothmode = true;
	4166	+ Grafreed.linkUV = true;
	4167	+
	4168	+ System.out.println("#Vertex = " + VertexCount());
	4169	+ System.out.println("#Face = " + FaceCount());
	4170	+
	4171	+ java.util.HashSet<Vertex> table = new java.util.HashSet<Vertex>();
	4172	+
	4173	+ for (int i = 0; i < VertexCount(); i++)
	4174	+ {
	4175	+ Vertex v = GetVertex(i);
	4176	+
	4177	+ if (!table.contains(v))
	4178	+ {
	4179	+ table.add(v);
	4180	+ }
	4181	+ }
	4182	+
	4183	+ Grafreed.smoothmode = smooth;
	4184	+ Grafreed.linkUV = link;
	4185	+
	4186	+// for (int i = 0; i < VertexCount(); i++)
	4187	+// {
	4188	+// Vertex v = GetVertex(i);
	4189	+//
	4190	+// table.add(v);
	4191	+// }
	4192	+
3981	4193	}
3982	4194
3983	4195	static cVector temp1 = new cVector();
..	..	@@ -4752,16 +4964,25 @@
4752	4964	{
4753	4965	i3 = positions.length-3;
4754	4966	i2 = uvmap.length - 2;
4755		- new Exception().printStackTrace();
	4967	+ //new Exception().printStackTrace();
4756	4968	}
4757	4969
4758	4970	v./pos./x = positions[i3];
4759	4971	v./pos./y = positions[i3 + 1];
4760	4972	v./pos./z = positions[i3 + 2];
4761	4973
4762		- v.norm.x = normals[i3];
4763		- v.norm.y = normals[i3 + 1];
4764		- v.norm.z = normals[i3 + 2];
	4974	+ if (normals == null)
	4975	+ {
	4976	+ v.norm.x = 0;
	4977	+ v.norm.y = 0;
	4978	+ v.norm.z = 0;
	4979	+ }
	4980	+ else
	4981	+ {
	4982	+ v.norm.x = normals[i3];
	4983	+ v.norm.y = normals[i3 + 1];
	4984	+ v.norm.z = normals[i3 + 2];
	4985	+ }
4765	4986
4766	4987	v.s = uvmap[i2];
4767	4988	v.t = uvmap[i2 + 1];
..	..	@@ -5476,17 +5697,27 @@
5476	5697
5477	5698	transient int nbbadfaces; // ?? = 1000000;
5478	5699
5479		- int ChooseTriangle()
	5700	+ /*
	5701	+ */
	5702	+ int ChooseTriangle(boolean firstEquilateral)
5480	5703	{
5481	5704	int chosen = -1;
5482	5705
5483	5706	double minweight = 1E10;
5484	5707
	5708	+ int step = 8; // ?
	5709	+
	5710	+ if (firstEquilateral)
	5711	+ step = 1;
	5712	+
5485	5713	nbbadfaces = 0;
5486		- for (int i=0; i<faces.size(); i+=8)
	5714	+ for (int i=0; i<faces.size(); i+=step)
5487	5715	// for (int i=faces.size(); (i-=8)>=0;)
5488	5716	{
5489	5717	Face face = (Face) faces.get(i);
	5718	+
	5719	+ if (face.used)
	5720	+ continue;
5490	5721
5491	5722	if (!Valid(face))
5492	5723	{
..	..	@@ -5496,6 +5727,15 @@
5496	5727
5497	5728	if (Boundary(face))
5498	5729	continue;
	5730	+
	5731	+// if (Boundary(face.p))
	5732	+// continue;
	5733	+//
	5734	+// if (Boundary(face.q))
	5735	+// continue;
	5736	+//
	5737	+// if (Boundary(face.r))
	5738	+// continue;
5499	5739
5500	5740	if (!ValidValence(face))
5501	5741	continue;
..	..	@@ -5508,22 +5748,55 @@
5508	5748	//?? if (face.weight < 0)
5509	5749	// continue;
5510	5750
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)
	5751	+ if (firstEquilateral)
5518	5752	{
5519		- minweight = weight;
	5753	+ if (OneFaceUsed(links.get(face.p)))
	5754	+ continue;
	5755	+
	5756	+ if (OneFaceUsed(links.get(face.q)))
	5757	+ continue;
	5758	+
	5759	+ if (OneFaceUsed(links.get(face.r)))
	5760	+ continue;
	5761	+
5520	5762	chosen = i;
5521		- if (minweight == 0)
5522		- break;
	5763	+ break;
	5764	+ }
	5765	+ else
	5766	+ {
	5767	+ double K = 1; // 0.01; // .25;
	5768	+
	5769	+ double factor = (1-K)face.nbiterations + K; //face.weight;
	5770	+
	5771	+ double weight = FaceWeight(face); // Math.pow(PerimeterMax(face),0.25)factor;
	5772	+
	5773	+ if (minweight > weight)
	5774	+ {
	5775	+ minweight = weight;
	5776	+ chosen = i;
	5777	+ if (minweight == 0)
	5778	+ break;
	5779	+ }
5523	5780	}
5524	5781	}
5525	5782
5526	5783	return chosen;
	5784	+ }
	5785	+
	5786	+ private boolean OneFaceUsed(Vector<Face> faces)
	5787	+ {
	5788	+ if (faces.size() != 6)
	5789	+ return true;
	5790	+
	5791	+ for (int i=0; i<6; i+=1)
	5792	+ {
	5793	+ if (faces.get(i).used)
	5794	+ {
	5795	+ return true;
	5796	+ }
	5797	+ }
	5798	+
	5799	+ return false;
5527	5800	}
5528	5801
5529	5802	static boolean remove3valence = true;
..	..	@@ -5559,7 +5832,7 @@
5559	5832	}
5560	5833	else
5561	5834	{
5562		- assert(links.size() == vertices.size());
	5835	+ // TODO Grafreed.Assert(links.size() == vertices.size());
5563	5836
5564	5837	links.setSize(vertices.size());
5565	5838	for (int i=vertices.size(); --i>=0;)
..	..	@@ -5567,6 +5840,7 @@
5567	5840	// linkstouched[i] = false;
5568	5841	if (links.get(i) == null) // ??
5569	5842	{
	5843	+ new Exception().printStackTrace();
5570	5844	links.set(i, new Vector(8));
5571	5845	// linkstouched[i] = true;
5572	5846	}
..	..	@@ -5577,6 +5851,8 @@
5577	5851	}
5578	5852	}
5579	5853
	5854	+ boolean once = false;
	5855	+
5580	5856	for (int i=faces.size(); --i>=0;)
5581	5857	{
5582	5858	Face face = (Face) faces.get(i);
..	..	@@ -5588,6 +5864,9 @@
5588	5864	//if (linkstouched[face.r])
5589	5865	links.get(face.r).add(face);
5590	5866
	5867	+ if (face.used)
	5868	+ once = true;
	5869	+
5591	5870	face.good = 1;
5592	5871	face.boundary = -1;
5593	5872	}
..	..	@@ -6953,6 +7232,10 @@
6953	7232	return (face.boundary = 1) == 1;
6954	7233	}
6955	7234
	7235	+ // June 2019
	7236	+ if (true)
	7237	+ return (face.boundary = 0) == 1;
	7238	+
6956	7239	// reverse triangle test
6957	7240	q1.set(p);
6958	7241	q2.set(q);
..	..	@@ -7402,7 +7685,7 @@
7402	7685	//InitWeights();
7403	7686	}
7404	7687
7405		- int chosen = ChooseTriangle(); // Best is slow and not really better
	7688	+ int chosen = ChooseTriangle(true); // Best is slow and not really better
7406	7689
7407	7690	if (chosen == -1)
7408	7691	{
..	..	@@ -7416,7 +7699,7 @@
7416	7699	//remove3valence = false;
7417	7700	// InitWeights();
7418	7701
7419		- chosen = ChooseTriangle();
	7702	+ chosen = ChooseTriangle(true);
7420	7703	}
7421	7704	}
7422	7705
..	..	@@ -7692,7 +7975,7 @@
7692	7975
7693	7976	// boolean lock;
7694	7977
7695		- void SplitInTwo(boolean reduction34, boolean onlyone)
	7978	+ boolean SplitInTwo(boolean reduction34, boolean onlyone)
7696	7979	{
7697	7980	if (stripified)
7698	7981	{
..	..	@@ -7729,12 +8012,12 @@
7729	8012	{
7730	8013	System.err.println("EXCEPTION CAUGHT");
7731	8014	e.printStackTrace();
7732		- return;
	8015	+ return false;
7733	8016	} catch (Error e)
7734	8017	{
7735	8018	System.err.println("ERROR CAUGHT");
7736	8019	e.printStackTrace();
7737		- return;
	8020	+ return false;
7738	8021	}
7739	8022
7740	8023	System.out.println("# faces = " + faces.size());
..	..	@@ -7744,6 +8027,7 @@
7744	8027	{
7745	8028	Face face = (Face) faces.get(i);
7746	8029
	8030	+ face.used = false;
7747	8031	face.nbiterations = 1;
7748	8032	face.weight = -1;
7749	8033	face.boundary = -1;
..	..	@@ -7795,6 +8079,11 @@
7795	8079	nbbadfaces = faces.size();
7796	8080	//remove3valence = true;
7797	8081
	8082	+ int count = 2;
	8083	+
	8084	+ if (onlyone)
	8085	+ count = 1;
	8086	+
7798	8087	firstpass = true;
7799	8088
7800	8089	int n = faces.size();
..	..	@@ -7810,8 +8099,9 @@
7810	8099	System.out.print('.');
7811	8100	}
7812	8101	System.out.println();
	8102	+ boolean atleastone = false;
7813	8103	int i = 0;
7814		- while (reduction34 \|\| faces.size() > n/2)
	8104	+ while (true) // reduction34 \|\| faces.size() > n/2)
7815	8105	{
7816	8106	if (i++%100 == 0)
7817	8107	{
..	..	@@ -7833,6 +8123,8 @@
7833	8123	{
7834	8124	if (!RemoveOneTriangle())
7835	8125	break;
	8126	+
	8127	+ atleastone = true;
7836	8128	}
7837	8129	// if (iterationcount == 0)
7838	8130	// break;
..	..	@@ -7843,8 +8135,8 @@
7843	8135	break;
7844	8136	}
7845	8137	firstpass = false;
7846		- if (onlyone)
7847		- break; // one triangle only
	8138	+// if (--count<0 && !reduction34)
	8139	+// break; // one triangle only
7848	8140	}
7849	8141
7850	8142	InitLinks(false); // for further display
..	..	@@ -7860,6 +8152,8 @@
7860	8152	Trim(true,false,false,false,false);
7861	8153
7862	8154	Globals.theRenderer.setCursor(java.awt.Cursor.getPredefinedCursor(java.awt.Cursor.DEFAULT_CURSOR));
	8155	+
	8156	+ return atleastone;
7863	8157	}
7864	8158
7865	8159	void UpdateIndices(Face face, Face minface)
..	..	@@ -7872,18 +8166,21 @@
7872	8166	face.p = minface.p;
7873	8167	//if (leafweights)
7874	8168	face.good = 0; // false;
	8169	+ face.used = true;
7875	8170	}
7876	8171	if (face.q == minface.p \|\| face.q == minface.q \|\| face.q == minface.r)
7877	8172	{
7878	8173	face.q = minface.p;
7879	8174	//if (leafweights)
7880	8175	face.good = 0; // false;
	8176	+ face.used = true;
7881	8177	}
7882	8178	if (face.r == minface.p \|\| face.r == minface.q \|\| face.r == minface.r)
7883	8179	{
7884	8180	face.r = minface.p;
7885	8181	//if (leafweights)
7886	8182	face.good = 0; // false;
	8183	+ face.used = true;
7887	8184	}
7888	8185
7889	8186	if (face.p >/=/ minface.q && face.p < minface.r)
..	..	@@ -7943,50 +8240,50 @@
7943	8240	if (v == 2)
7944	8241	vert = minface.r;
7945	8242	// 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)
	8243	+ Vector<Face> vertfaces = links.get(vert);
	8244	+ for (int i=vertfaces.size(); --i>=0;)
7957	8245	{
7958		- if (!leafweights)
	8246	+ Face face = (Face) vertfaces.get(i);
	8247	+
	8248	+ // if (face.weight == 10000)
	8249	+ // continue;
	8250	+
	8251	+ if (face.p == minface.p \|\| face.q == minface.p \|\| face.r == minface.p \|\|
	8252	+ face.p == minface.q \|\| face.q == minface.q \|\| face.r == minface.q \|\|
	8253	+ face.p == minface.r \|\| face.q == minface.r \|\| face.r == minface.r)
7959	8254	{
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);
	8255	+ if (!leafweights)
	8256	+ {
	8257	+ // if(minfaceweight <= 0)
	8258	+ // assert(minfaceweight > 0);
	8259	+ //
	8260	+ // //FaceWeight(face);
	8261	+ // if(face.weight < 0)
	8262	+ // assert(face.weight >= 0);
	8263	+
	8264	+ face.weight += minfaceweight;
	8265	+
	8266	+ // if (face.weight >= 10000)
	8267	+ // assert(face.weight < 10000);
	8268	+ }
	8269	+ else
	8270	+ face.weight = -1;
	8271	+
	8272	+ face.nbiterations += 1;
	8273	+ face.boundary = -1;
	8274	+
	8275	+ Vertex p = (Vertex)vertices.get(face.p);
	8276	+ Vertex q = (Vertex)vertices.get(face.q);
	8277	+ Vertex r = (Vertex)vertices.get(face.r);
	8278	+
	8279	+ p.boundary = -1;
	8280	+ q.boundary = -1;
	8281	+ r.boundary = -1;
7971	8282	}
7972	8283	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;
	8284	+ assert(false);
7985	8285	}
7986		- else
7987		- assert(false);
7988	8286	}
7989		- }
7990	8287
7991	8288	// TouchVertex(minface.p);
7992	8289	// TouchVertex(minface.q);
..	..	@@ -8187,6 +8484,7 @@
8187	8484	for (int i=vertfaces.size(); --i>=0;)
8188	8485	{
8189	8486	Face face = (Face) vertfaces.get(i);
	8487	+ face.used = true;
8190	8488	face.good = 0; // false;
8191	8489	if (leafweights)
8192	8490	face.weight = -1;
..	..	@@ -8465,7 +8763,8 @@
8465	8763	int[] startvertices;
8466	8764	float[] averagepoints;
8467	8765	float[] extremepoints;
8468		- float[] supportsizes; // distance of closest point
	8766	+ float[] supportminsize; // distance of closest point
	8767	+ float[] supportmaxsize; // distance of fartest point
8469	8768
8470	8769	transient Hashtable vertextable;
8471	8770	/transient/ private Vertex[] verticesCopy;