TriMeshSimplifier.java
| Index Score | ||
|---|---|---|
 |
 |
artofillusion |
 |
|
Art of Illusion |
View: Reasons, Metrics, Source Code
These are the metrics that contribute to the Enerjy Score for this file, ranked by impact. So the metrics listed at the top influence the score to a greater extent that the metrics listed at the bottom.
| Metric | Description | |
|---|---|---|
| LOOPS | Number of loops |  |
| JAVA0034 | JAVA0034 Missing braces in if statement | |
| JAVA0177 | JAVA0177 Variable declaration missing initializer | |
| OPERANDS | Number of operands | |
| JAVA0035 | JAVA0035 Missing braces in for statement | |
| COMPARISONS | Number of comparison operators | |
| JAVA0285 | JAVA0285 Dereference of potentially null variable | |
| PROGRAM_LENGTH | Halstead program length | |
| JAVA0067 | JAVA0067 Array descriptor on identifier name | |
| LOGICAL_LINES | Number of statements | |
| OPERATORS | Number of operators | |
| CYCLOMATIC | Cyclomatic complexity | |
| EXEC_COMMENTS | Comments in executable code | |
| LOC | Lines of code | |
| ELOC | Effective lines of code | |
| LINE_COMMENT | Number of line comments | |
| SIZE | Size of the file in bytes | |
| LINES | Number of lines in the source file | |
| JAVA0043 | JAVA0043 Inner class does not use outer class | |
| JAVA0137 | JAVA0137 Non-abstract class missing constructor | |
| JAVA0270 | JAVA0270 Use Java 5.0 enhanced for loop construct to iterate over all elements in an array | |
| BLOCKS | Number of blocks | |
| PROGRAM_VOCAB | Halstead program vocabulary | |
| JAVA0273 | JAVA0273 Non-final derivative of Thread calls start() in constructor | |
| UNIQUE_OPERANDS | Number of unique operands | |
| JAVA0096 | JAVA0096 Field in nested class hides outer field | |
| JAVA0036 | JAVA0036 Missing braces in while statement | |
| EXITS | Procedure exits | |
| UNIQUE_OPERATORS | Number of unique operators | |
| PROGRAM_VOLUME | Halstead program volume | |
| JAVA0126 | JAVA0126 Method declares unchecked exception in throws | |
| JAVA0110 | JAVA0110 Incorrect javadoc: no @return tag | |
| JAVA0087 | JAVA0087 Use of Thread.sleep() | |
| JAVA0117 | JAVA0117 Missing javadoc: method 'method' | |
| JAVA0100 | JAVA0100 Class contains N non-final fields (maximum: M) | |
| JAVA0098 | JAVA0098 Minimize use of implicit field initializers | |
| JAVA0108 | JAVA0108 Incorrect javadoc: no @param tag for 'parameter' | |
| DOC_COMMENT | Number of javadoc comment lines | |
| JAVA0003 | JAVA0003 Minimize use of on-demand (.*) imports | |
| RETURNS | Number of return points from functions | |
| NEST_DEPTH | Maximum nesting depth | |
| FUNCTIONS | Number of function declarations | |
| INTERFACE_COMPLEXITY | Interface complexity | |
| JAVA0145 | JAVA0145 Tab character used in source file | |
/* Copyright (C) 1999-2005 by Peter Eastman
This program is free software; you can redistribute it and/or modify it under the
terms of the GNU General Public License as published by the Free Software
Foundation; either version 2 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
PARTICULAR PURPOSE. See the GNU General Public License for more details. */
package artofillusion;
import artofillusion.math.*;
import artofillusion.object.*;
import artofillusion.object.TriangleMesh.*;
import artofillusion.ui.*;
import artofillusion.texture.*;
import buoy.widget.*;
/** TriMeshSimplifier defines methods for simplifying a TriangleMesh. The algorithm
is based on
<p>
R. Ronfard and J. Rossignac, "Full-range Approximation of Triangulated Polyhedra."
Computer Graphics Forum, vol. 15, no. 3, 1996.
<p>
I have made the following modifications to their algorithm:
<p>
1. When calculating the cost for an edge collapse, they arbitrarily choose which direction
to collapse it in. This results in meshes not being simplified as far as they could be.
Instead, I always test both collapse directions to see which one has the lower cost.
<p>
2. After collapsing vertex v1 to v2, they state that it is only necessary to recalculate
costs for edges which have been modified, that is, those edges in the star of v1 or v2.
This is incorrect. It is also necessary to recalculate the cost for any edge which shares
a vertex with an edge in v1's star.
<p>
3. They define the local tesselation error for a face as being proportional to its angle
of rotation. I replace the angle by 1-cos(angle). This has the same effect, and saves
the need to evalate an acos.
<p>
4. Rather than always simplifying the entire mesh, I allow the user to select only a
subset of the mesh to be simplified.
<p>
5. Their algorithm only works for closed meshes (meshes without a boundary). I have
modified it to also work for open meshes.
<p>
6. I omit the relaxation step, since this would produce bad results for smoothed
meshes. */
public class TriMeshSimplifier implements Runnable
{
private class Constraint
{
double a, b, c, d;
}
private class Zone
{
int constraints;
Constraint con[];
Zone next;
}
private class MeshEdge
{
int v1, v2;
MeshFace f1, f2;
float smoothness;
double cost;
boolean selected;
}
private class MeshFace
{
int v1, v2, v3, index, origIndex;
MeshEdge e1, e2, e3;
Vec3 normal;
}
private class VertexInfo
{
Vertex theVert;
Vec3 pos;
int faces, edges;
float smoothness;
MeshEdge star[];
MeshFace crown[];
Zone zone;
}
private TriangleMesh mesh;
private VertexInfo vertex[];
private MeshEdge edge[];
private MeshFace face[];
private Vec3 temp1, temp2, temp3;
private int faces;
private BDialog dial;
private BButton cancelButton;
private BLabel status, numLabel;
private boolean cancel;
private double tol;
public TriMeshSimplifier(TriangleMesh theMesh, boolean selection[], double tolerance, BFrame fr)
{
mesh = theMesh;
tol = tolerance*tolerance;
buildDataStructures(selection);
if (fr == null)
run();
else
{
createDialog(fr);
new Thread(this).start();
Thread update = new Thread() {
public void run()
{
try
{
while (!cancel)
{
sleep(200);
status.setText(String.valueOf(faces));
}
}
catch (InterruptedException ex)
{
}
}
};
update.start();
dial.setVisible(true);
}
}
public void run()
{
doSimplification();
if (!cancel)
buildMesh();
cancel = true;
if (numLabel != null)
{
numLabel.setText(Translate.text("Final")+":");
status.setText(String.valueOf(faces));
cancelButton.setText(Translate.text("Done"));
}
}
/* Put up a status dialog. */
private void createDialog(BFrame fr)
{
dial = new BDialog(fr, true);
BorderContainer content = new BorderContainer();
dial.setContent(BOutline.createEmptyBorder(content, UIUtilities.getStandardDialogInsets()));
content.add(Translate.label("numTrianglesInMesh"), BorderContainer.NORTH);
GridContainer grid = new GridContainer(2, 2);
grid.add(new BLabel(Translate.text("Original")+":"), 0, 0);
grid.add(numLabel = new BLabel(Translate.text("Current")+":"), 0, 1);
grid.add(new BLabel(String.valueOf(faces)), 1, 0);
grid.add(status = new BLabel(String.valueOf(faces)), 1, 1);
content.add(grid, BorderContainer.CENTER);
content.add(cancelButton = Translate.button("cancel", new Object() {
void processEvent()
{
cancel = true;
dial.dispose();
}
}, "processEvent"), BorderContainer.SOUTH, new LayoutInfo());
dial.pack();
dial.setResizable(false);
UIUtilities.centerDialog(dial, fr);
}
/* Build the new TriangleMesh. */
private void buildMesh()
{
int index[] = new int [vertex.length], f[][] = new int [faces][];
Vertex vert[];
Edge ed[];
// Find the indices of all unique vertices.
int k = 0;
for (int i = 0; i < vertex.length; i++)
{
index[i] = k++;
for (int j = 0; j < i; j++)
if (vertex[i] == vertex[j])
{
index[i] = index[j];
k--;
break;
}
}
// Update the mesh shape.
vert = new Vertex [k];
for (int i = 0; i < vertex.length; i++)
{
vert[index[i]] = mesh.new Vertex(vertex[i].theVert);
vert[index[i]].r = new Vec3(vertex[i].pos);
vert[index[i]].smoothness = vertex[i].smoothness;
vert[index[i]].edges = 0;
vert[index[i]].firstEdge = -1;
}
for (int i = 0; i < faces; i++)
f[i] = new int [] {index[face[i].v1], index[face[i].v2], index[face[i].v3]};
mesh.setShape(vert, f);
// Set the smoothness values for edges.
ed = mesh.getEdges();
for (int i = 0; i < ed.length; i++)
for (int j = 0; j < edge.length; j++)
if ((index[edge[j].v1] == ed[i].v1 && index[edge[j].v2] == ed[i].v2) ||
(index[edge[j].v2] == ed[i].v1 && index[edge[j].v1] == ed[i].v2))
{
ed[i].smoothness = edge[j].smoothness;
break;
}
// Update surface parameters.
ParameterValue paramValue[] = mesh.getParameterValues();
for (int i = 0; i < paramValue.length; i++)
{
if (paramValue[i] instanceof VertexParameterValue)
{
VertexParameterValue value = (VertexParameterValue) paramValue[i];
double oldValue[] = value.getValue();
double newValue[] = new double [vertex.length];
for (int j = 0; j < newValue.length; j++)
newValue[index[j]] = oldValue[j];
value.setValue(newValue);
}
else if (paramValue[i] instanceof FaceParameterValue)
{
FaceParameterValue value = (FaceParameterValue) paramValue[i];
double oldValue[] = value.getValue();
double newValue[] = new double [faces];
for (int j = 0; j < newValue.length; j++)
newValue[j] = oldValue[face[j].origIndex];
value.setValue(newValue);
}
else if (paramValue[i] instanceof FaceVertexParameterValue)
{
FaceVertexParameterValue value = (FaceVertexParameterValue) paramValue[i];
double newValue[][] = new double [faces][3];
for (int j = 0; j < newValue.length; j++)
{
newValue[j][0] = value.getValue(face[j].origIndex, 0);
newValue[j][1] = value.getValue(face[j].origIndex, 1);
newValue[j][2] = value.getValue(face[j].origIndex, 2);
}
value.setValue(newValue);
}
}
mesh.setParameterValues(paramValue);
}
/* Build the data structures necessary for simplifying the mesh. */
private void buildDataStructures(boolean selection[])
{
TriangleMesh.Vertex v[] = (Vertex []) mesh.getVertices();
TriangleMesh.Edge e[] = mesh.getEdges();
TriangleMesh.Face f[] = mesh.getFaces();
int i, j, edgeCount[], faceCount[];
MeshEdge tempEdge;
VertexInfo v1, v2;
Constraint con;
vertex = new VertexInfo [v.length];
edge = new MeshEdge [e.length];
face = new MeshFace [f.length];
edgeCount = new int [v.length];
faceCount = new int [v.length];
faces = f.length;
// Create temporary vectors for later use.
temp1 = new Vec3();
temp2 = new Vec3();
temp3 = new Vec3();
// Count the edges and faces touching each vertex, and build the list of vertices.
for (i = 0; i < e.length; i++)
{
edgeCount[e[i].v1]++;
edgeCount[e[i].v2]++;
}
for (i = 0; i < f.length; i++)
{
faceCount[f[i].v1]++;
faceCount[f[i].v2]++;
faceCount[f[i].v3]++;
}
for (i = 0; i < v.length; i++)
{
vertex[i] = new VertexInfo();
vertex[i].theVert = v[i];
vertex[i].pos = v[i].r;
vertex[i].smoothness = v[i].smoothness;
vertex[i].star = new MeshEdge [edgeCount[i]];
vertex[i].crown = new MeshFace [faceCount[i]];
vertex[i].zone = new Zone();
if (faceCount[i] == edgeCount[i])
vertex[i].zone.con = new Constraint [faceCount[i]];
else
vertex[i].zone.con = new Constraint [faceCount[i]+2];
}
// Build the list of edges.
for (i = 0; i < e.length; i++)
{
edge[i] = new MeshEdge();
edge[i].v1 = e[i].v1;
edge[i].v2 = e[i].v2;
edge[i].smoothness = e[i].smoothness;
v1 = vertex[e[i].v1];
v2 = vertex[e[i].v2];
v1.star[v1.edges++] = edge[i];
v2.star[v2.edges++] = edge[i];
edge[i].selected = selection[i];
}
// Build the list of faces, and record the constraint associated with each one.
for (i = 0; i < f.length; i++)
{
face[i] = new MeshFace();
face[i].v1 = f[i].v1;
face[i].v2 = f[i].v2;
face[i].v3 = f[i].v3;
face[i].e1 = edge[f[i].e1];
face[i].e2 = edge[f[i].e2];
face[i].e3 = edge[f[i].e3];
face[i].index = i;
face[i].origIndex = i;
face[i].normal = new Vec3();
findNormal(vertex[f[i].v1].pos, vertex[f[i].v2].pos, vertex[f[i].v3].pos, face[i].normal);
vertex[f[i].v1].crown[vertex[f[i].v1].faces++] = face[i];
vertex[f[i].v2].crown[vertex[f[i].v2].faces++] = face[i];
vertex[f[i].v3].crown[vertex[f[i].v3].faces++] = face[i];
con = new Constraint();
con.a = face[i].normal.x;
con.b = face[i].normal.y;
con.c = face[i].normal.z;
con.d = -(con.a*v[f[i].v1].r.x + con.b*v[f[i].v1].r.y + con.c*v[f[i].v1].r.z);
vertex[f[i].v1].zone.con[vertex[f[i].v1].zone.constraints++] = con;
vertex[f[i].v2].zone.con[vertex[f[i].v2].zone.constraints++] = con;
vertex[f[i].v3].zone.con[vertex[f[i].v3].zone.constraints++] = con;
if (edge[f[i].e1].f1 == null)
edge[f[i].e1].f1 = face[i];
else
edge[f[i].e1].f2 = face[i];
if (edge[f[i].e2].f1 == null)
edge[f[i].e2].f1 = face[i];
else
edge[f[i].e2].f2 = face[i];
if (edge[f[i].e3].f1 == null)
edge[f[i].e3].f1 = face[i];
else
edge[f[i].e3].f2 = face[i];
}
// Record additional constraints for boundary edges.
for (i = 0; i < e.length; i++)
if (edge[i].f2 == null)
{
temp1.set(v[edge[i].v1].r);
temp1.subtract(v[edge[i].v2].r);
temp2.set(edge[i].f1.normal);
con = new Constraint();
con.a = temp1.y*temp2.z - temp1.z*temp2.y;
con.b = temp1.z*temp2.x - temp1.x*temp2.z;
con.c = temp1.x*temp2.y - temp1.y*temp2.x;
con.d = -(con.a*v[edge[i].v1].r.x + con.b*v[edge[i].v1].r.y + con.c*v[edge[i].v1].r.z);
vertex[edge[i].v1].zone.con[vertex[edge[i].v1].zone.constraints++] = con;
vertex[edge[i].v2].zone.con[vertex[edge[i].v2].zone.constraints++] = con;
}
// Record the initial cost associated with each edge, and bring the lowest cost edge
// to the front of the list.
for (i = 0; i < e.length; i++)
updateCost(edge[i]);
j = 0;
for (i = 0; i < e.length; i++)
if (edge[i].cost < edge[j].cost)
j = i;
tempEdge = edge[j];
edge[j] = edge[0];
edge[0] = tempEdge;
}
/** Simplify the mesh! */
private void doSimplification()
{
int i, j, k, skip;
MeshEdge rem1, rem2, rep1, rep2;
MeshEdge e, star[], tempEdge;
MeshFace tempCrown[];
VertexInfo v1, v2, v3, v4, tempVert;
Zone zone1, zone2;
boolean boundary;
for (i = 0; i < edge.length; i += skip)
{
e = edge[i];
if (e.cost >= tol || cancel)
return;
v1 = vertex[e.v1];
v2 = vertex[e.v2];
boundary = (e.f2 == null);
// Move v1 to v2.
v2.pos = v1.pos;
// Flag all the edges whose costs must be updated. This includes all edges in v1's
// star or v2's star, and all edges which share a vertex with an edge in v1's star.
star = v1.star;
for (j = 0; j < v1.edges; j++)
{
if (vertex[star[j].v1] == v1)
tempVert = vertex[star[j].v2];
else
tempVert = vertex[star[j].v1];
for (k = 0; k < tempVert.edges; k++)
tempVert.star[k].cost = -1.0;
}
star = v2.star;
for (j = 0; j < v2.edges; j++)
star[j].cost = -1.0;
// Find the two extra edges to remove, and the ones to replace them with.
if (e.f1.e1 == e)
{
if (vertex[e.f1.e2.v1] == v2 || vertex[e.f1.e2.v2] == v2)
{
rem1 = e.f1.e2;
rep1 = e.f1.e3;
}
else
{
rem1 = e.f1.e3;
rep1 = e.f1.e2;
}
}
else if (e.f1.e2 == e)
{
if (vertex[e.f1.e3.v1] == v2 || vertex[e.f1.e3.v2] == v2)
{
rem1 = e.f1.e3;
rep1 = e.f1.e1;
}
else
{
rem1 = e.f1.e1;
rep1 = e.f1.e3;
}
}
else
{
if (vertex[e.f1.e1.v1] == v2 || vertex[e.f1.e1.v2] == v2)
{
rem1 = e.f1.e1;
rep1 = e.f1.e2;
}
else
{
rem1 = e.f1.e2;
rep1 = e.f1.e1;
}
}
if (boundary)
rem2 = rep2 = null;
else
{
if (e.f2.e1 == e)
{
if (vertex[e.f2.e2.v1] == v2 || vertex[e.f2.e2.v2] == v2)
{
rem2 = e.f2.e2;
rep2 = e.f2.e3;
}
else
{
rem2 = e.f2.e3;
rep2 = e.f2.e2;
}
}
else if (e.f2.e2 == e)
{
if (vertex[e.f2.e3.v1] == v2 || vertex[e.f2.e3.v2] == v2)
{
rem2 = e.f2.e3;
rep2 = e.f2.e1;
}
else
{
rem2 = e.f2.e1;
rep2 = e.f2.e3;
}
}
else
{
if (vertex[e.f2.e1.v1] == v2 || vertex[e.f2.e1.v2] == v2)
{
rem2 = e.f2.e1;
rep2 = e.f2.e2;
}
else
{
rem2 = e.f2.e2;
rep2 = e.f2.e1;
}
}
}
// Identify the other two points whose stars and crowns must be modified.
if (vertex[rep1.v1] == v1)
v3 = vertex[rep1.v2];
else
v3 = vertex[rep1.v1];
if (boundary)
v4 = null;
else
{
if (vertex[rep2.v1] == v1)
v4 = vertex[rep2.v2];
else
v4 = vertex[rep2.v1];
}
// Update v1's crown.
if (boundary && v1.faces+v2.faces-2 > v1.crown.length)
tempCrown = new MeshFace [v1.faces+v2.faces-2];
else if (v1.faces+v2.faces-4 > v1.crown.length)
tempCrown = new MeshFace [v1.faces+v2.faces-4];
else
tempCrown = v1.crown;
for (j = 0, k = 0; k < v1.faces; k++)
if (v1.crown[k] != e.f1 && v1.crown[k] != e.f2)
tempCrown[j++] = v1.crown[k];
for (k = 0; k < v2.faces; k++)
if (v2.crown[k] != e.f1 && v2.crown[k] != e.f2)
tempCrown[j++] = v2.crown[k];
v1.crown = tempCrown;
if (boundary)
v1.faces = v1.faces+v2.faces-2;
else
v1.faces = v1.faces+v2.faces-4;
// Update v1's star.
if (v1.edges+v2.edges-2 > v1.star.length)
star = new MeshEdge [v1.edges+v2.edges-2];
else
star = v1.star;
for (j = 0, k = 0; k < v1.edges; k++)
if (v1.star[k] != e)
star[j++] = v1.star[k];
for (k = 0; k < v2.edges; k++)
if (v2.star[k] != e)
star[j++] = v2.star[k];
v1.star = star;
v1.edges = v1.edges+v2.edges-2;
// Update v3 and v4's crowns.
for (j = 0, k = 0; k < v3.faces; k++)
if (v3.crown[k] != e.f1)
v3.crown[j++] = v3.crown[k];
v3.faces--;
if (!boundary)
{
for (j = 0, k = 0; k < v4.faces; k++)
if (v4.crown[k] != e.f2)
v4.crown[j++] = v4.crown[k];
v4.faces--;
}
// Update v3 and v4's stars.
for (j = 0, k = 0; k < v3.edges; k++)
if (v3.star[k] != rem1)
v3.star[j++] = v3.star[k];
v3.edges--;
if (!boundary)
{
for (j = 0, k = 0; k < v4.edges; k++)
if (v4.star[k] != rem2)
v4.star[j++] = v4.star[k];
v4.edges--;
}
// Eliminate the faces which share this edge.
if (boundary)
{
j = e.f1.index;
face[j] = face[faces-1];
face[j].index = j;
faces--;
}
else
{
j = e.f1.index;
k = e.f2.index;
if (j < faces-2 && k < faces-2)
{
face[j] = face[faces-1];
face[k] = face[faces-2];
}
else
{
if (j != faces-1 && k != faces-1)
face[Math.min(j,k)] = face[faces-1];
else
face[Math.min(j,k)] = face[faces-2];
}
face[j].index = j;
face[k].index = k;
faces -= 2;
}
// Add the constraints from v2 to v1. We do this by removing any duplicate
// constraints, then appending v2's zone to v1's zone.
zone2 = v2.zone;
while (zone2 != null)
{
zone1 = v1.zone;
while (zone1 != null)
{
for (j = 0; j < zone2.constraints; j++)
for (k = 0; k < zone1.constraints; k++)
if (zone2.con[j] == zone1.con[k])
zone2.con[j] = zone2.con[--zone2.constraints];
zone1 = zone1.next;
}
zone2 = zone2.next;
}
// Eliminate any zones which are completely free of constraints.
zone2 = v2.zone;
while (zone2.next != null)
{
if (zone2.next.constraints == 0)
zone2.next = zone2.next.next;
else
zone2 = zone2.next;
}
// Add v2's zone to v1's zone.
zone2 = v2.zone;
zone1 = v1.zone;
while (zone1.next != null)
zone1 = zone1.next;
if (zone2.constraints == 0)
zone1.next = zone2.next;
else
zone1.next = zone2;
// Go through the faces in v2's crown, and replace references to rem1 and rem2
// by rep1 and rep2.
for (j = 0; j < v2.faces; j++)
{
if (v2.crown[j].e1 == rem1)
v2.crown[j].e1 = rep1;
else if (v2.crown[j].e2 == rem1)
v2.crown[j].e2 = rep1;
else if (v2.crown[j].e3 == rem1)
v2.crown[j].e3 = rep1;
}
if (!boundary)
for (j = 0; j < v2.faces; j++)
{
if (v2.crown[j].e1 == rem2)
v2.crown[j].e1 = rep2;
else if (v2.crown[j].e2 == rem2)
v2.crown[j].e2 = rep2;
else if (v2.crown[j].e3 == rem2)
v2.crown[j].e3 = rep2;
}
// Similarly, go through the edges adjacent to the faces being removed, and
// replace references.
if (rem1.f1 == e.f1)
{
if (rep1.f1 == e.f1)
rep1.f1 = rem1.f2;
else
rep1.f2 = rem1.f2;
}
else
{
if (rep1.f1 == e.f1)
rep1.f1 = rem1.f1;
else
rep1.f2 = rem1.f1;
}
if (rep1.f1 == null)
{
rep1.f1 = rep1.f2;
rep1.f2 = null;
}
if (!boundary)
{
if (rem2.f1 == e.f2)
{
if (rep2.f1 == e.f2)
rep2.f1 = rem2.f2;
else
rep2.f2 = rem2.f2;
}
else
{
if (rep2.f1 == e.f2)
rep2.f1 = rem2.f1;
else
rep2.f2 = rem2.f1;
}
if (rep2.f1 == null)
{
rep2.f1 = rep2.f2;
rep2.f2 = null;
}
}
// Replace all references to v2 by v1.
for (j = 0; j < vertex.length; j++)
if (vertex[j] == v2)
vertex[j] = v1;
// Update smoothness values for vertices and edges.
v1.smoothness = Math.min(v1.smoothness, v2.smoothness);
rep1.smoothness = Math.min(rep1.smoothness, rem1.smoothness);
if (!boundary)
rep2.smoothness = Math.min(rep2.smoothness, rem2.smoothness);
// Remove rem1 and rem2 from the list, then resort it.
for (j = edge.length-1, k = edge.length-1; j > i; j--)
if (edge[j] != rem1 && edge[j] != rem2)
edge[k--] = edge[j];
// Update the cost for edges which need it.
if (boundary)
skip = 2;
else
skip = 3;
k = i+skip;
for (j = i+skip; j < edge.length; j++)
{
if (edge[j].cost == -1.0)
updateCost(edge[j]);
if (edge[j].cost < edge[k].cost)
k = j;
}
tempEdge = edge[i+skip];
edge[i+skip] = edge[k];
edge[k] = tempEdge;
}
}
/* Update the cost for an edge. Try both directions to see which gives a lower cost. */
private void updateCost(MeshEdge ed)
{
double cost = findCost(ed);
int i = ed.v1;
ed.v1 = ed.v2;
ed.v2 = i;
ed.cost = findCost(ed);
if (ed.cost > cost)
{
ed.v2 = ed.v1;
ed.v1 = i;
ed.cost = cost;
}
}
/* Find the cost associated with contracting a given edge. If the cost is determined
to be greater than tol, the method simply returns tol. This allows findCost() to
return as soon as it determines the edge will never be contracted, and also speeds
up the sorting of edges (since many edges will have identical costs). */
private double findCost(MeshEdge ed)
{
VertexInfo v1 = vertex[ed.v1], v2 = vertex[ed.v2];
MeshFace f;
Zone zone = v2.zone;
double cost, max = 0.0;
int i;
if (!ed.selected)
return tol;
// First calculate the local tesselation error.
for (i = 0; i < v2.faces; i++)
if (v2.crown[i] != ed.f1 && v2.crown[i] != ed.f2)
{
f = v2.crown[i];
if (vertex[f.v1] == v2)
findNormal(v1.pos, vertex[f.v2].pos, vertex[f.v3].pos, temp3);
else if (vertex[f.v2] == v2)
findNormal(vertex[f.v1].pos, v1.pos, vertex[f.v3].pos, temp3);
else
findNormal(vertex[f.v1].pos, vertex[f.v2].pos, v1.pos, temp3);
cost = tol*(1.0-temp3.dot(f.normal));
if (cost >= tol || Double.isNaN(cost))
return tol;
if (cost > max)
max = cost;
}
// Now calculate the local geometric error.
while (zone != null)
{
for (i = 0; i < zone.constraints; i++)
{
cost = zone.con[i].a*v1.pos.x + zone.con[i].b*v1.pos.y + zone.con[i].c*v1.pos.z + zone.con[i].d;
cost *= cost;
if (cost >= tol)
return tol;
if (cost > max)
max = cost;
}
zone = zone.next;
}
// If this edge is adjacent to a face whose other edges are both boundaries, then
// collapsing this edge would leave a dangling edge. This should not be allowed.
f = ed.f1;
if ((f.e1 == ed || f.e1.f2 == null) && (f.e2 == ed || f.e2.f2 == null) && (f.e3 == ed || f.e3.f2 == null))
return tol;
f = ed.f2;
if (f != null)
if ((f.e1 == ed || f.e1.f2 == null) && (f.e2 == ed || f.e2.f2 == null) && (f.e3 == ed || f.e3.f2 == null))
return tol;
return max;
}
/* Given three points which define a face, find the normal vector. */
private void findNormal(Vec3 v1, Vec3 v2, Vec3 v3, Vec3 normal)
{
temp1.set(v2.x, v2.y, v2.z);
temp1.subtract(v1);
temp2.set(v3.x, v3.y, v3.z);
temp2.subtract(v1);
normal.set(temp1.y*temp2.z-temp1.z*temp2.y, temp1.z*temp2.x-temp1.x*temp2.z, temp1.x*temp2.y-temp1.y*temp2.x);
normal.normalize();
}
}
The table below shows all metrics for TriMeshSimplifier.java.
| Metric | Value | Description | |
|---|---|---|---|
| BLOCKS | 76.00 | Number of blocks | |
| BLOCK_COMMENT | 18.00 | Number of block comment lines | |
| COMMENTS | 85.00 | Comment lines | |
| COMMENT_DENSITY | 0.16 | Comment density | |
| COMPARISONS | 144.00 | Number of comparison operators | |
| CYCLOMATIC | 167.00 | Cyclomatic complexity | |
| DECL_COMMENTS | 9.00 | Comments in declarations | |
| DOC_COMMENT | 30.00 | Number of javadoc comment lines | |
| ELOC | 541.00 | Effective lines of code | |
| EXEC_COMMENTS | 31.00 | Comments in executable code | |
| EXITS | 47.00 | Procedure exits | |
| FUNCTIONS | 11.00 | Number of function declarations | |
| HALSTEAD_DIFFICULTY | 239.50 | Halstead difficulty | |
| HALSTEAD_EFFORT | 0.00 | Halstead effort | |
| INTERFACE_COMPLEXITY | 29.00 | Interface complexity | |
| JAVA0001 | 0.00 | JAVA0001 Package name does not contain only lower case letters | |
| JAVA0002 | 1.00 | JAVA0002 Package name does not begin with a top level domain name or country code | |
| JAVA0003 | 1.00 | JAVA0003 Minimize use of on-demand (.*) imports | |
| JAVA0004 | 0.00 | JAVA0004 Unnecessary import from java.lang | |
| JAVA0005 | 1.00 | JAVA0005 Imports not in specified order | |
| JAVA0006 | 0.00 | JAVA0006 Empty finally block | |
| JAVA0007 | 0.00 | JAVA0007 Should not declare public field | |
| JAVA0008 | 1.00 | JAVA0008 Empty catch block | |
| JAVA0009 | 0.00 | JAVA0009 Protected member in final class | |
| JAVA0010 | 0.00 | JAVA0010 Non-instantiable class does not contain a non-private static member | |
| JAVA0011 | 0.00 | JAVA0011 Abstract class does not contain an abstract method | |
| JAVA0012 | 0.00 | JAVA0012 Non-constructor method with same name as declaring class | |
| JAVA0013 | 0.00 | JAVA0013 Non-blank final field is not static | |
| JAVA0014 | 0.00 | JAVA0014 Class with only static members has non-private constructor | |
| JAVA0015 | 0.00 | JAVA0015 Package class contains public nested type | |
| JAVA0016 | 0.00 | JAVA0016 Abstract class contains public constructor | |
| JAVA0017 | 0.00 | JAVA0017 Class name does not have required form | |
| JAVA0018 | 0.00 | JAVA0018 Method name does not have required form | |
| JAVA0019 | 0.00 | JAVA0019 Interface name does not have required form | |
| JAVA0020 | 0.00 | JAVA0020 Field name does not have required form | |
| JAVA0021 | 0.00 | JAVA0021 Interface method name does not have required form | |
| JAVA0022 | 0.00 | JAVA0022 Static final field name does not have required form | |
| JAVA0023 | 0.00 | JAVA0023 Empty finalize method | |
| JAVA0024 | 0.00 | JAVA0024 Empty class | |
| JAVA0025 | 0.00 | JAVA0025 Method override is empty | |
| JAVA0026 | 0.00 | JAVA0026 Finalize method with parameters | |
| JAVA0029 | 0.00 | JAVA0029 Private method not used | |
| JAVA0030 | 0.00 | JAVA0030 Private field not used | |
| JAVA0031 | 0.00 | JAVA0031 Case statement not properly closed | |
| JAVA0032 | 0.00 | JAVA0032 Switch statement missing default | |
| JAVA0033 | 0.00 | JAVA0033 default: not last case in switch statement | |
| JAVA0034 | 75.00 | JAVA0034 Missing braces in if statement | |
| JAVA0035 | 24.00 | JAVA0035 Missing braces in for statement | |
| JAVA0036 | 1.00 | JAVA0036 Missing braces in while statement | |
| JAVA0038 | 0.00 | JAVA0038 Non-case label in switch statement | |
| JAVA0039 | 0.00 | JAVA0039 Break statement with label | |
| JAVA0040 | 0.00 | JAVA0040 Switch statement contains N cases (maximum: M) | |
| JAVA0041 | 0.00 | JAVA0041 Nested synchronized block | |
| JAVA0042 | 0.00 | JAVA0042 Empty synchronized statement | |
| JAVA0043 | 5.00 | JAVA0043 Inner class does not use outer class | |
| JAVA0044 | 0.00 | JAVA0044 Serializable class with no instance variables | |
| JAVA0045 | 0.00 | JAVA0045 Serializable class with only transient fields | |
| JAVA0046 | 0.00 | JAVA0046 Name of class not derived from Exception ends with 'Exception' | |
| JAVA0047 | 0.00 | JAVA0047 Serializable class derives from invalid base class | |
| JAVA0048 | 0.00 | JAVA0048 Name of class derived from Exception does not end with 'Exception' | |
| JAVA0049 | 0.00 | JAVA0049 Nested block at depth N (maximum: M) | |
| JAVA0050 | 0.00 | JAVA0050 Class derives from java.lang.Error | |
| JAVA0051 | 0.00 | JAVA0051 Class derives from java.lang.RuntimeException | |
| JAVA0052 | 0.00 | JAVA0052 Class derives from java.lang.Throwable | |
| JAVA0053 | 0.00 | JAVA0053 Unused label | |
| JAVA0054 | 0.00 | JAVA0054 Inheritance depth N exceeds maximum M | |
| JAVA0055 | 0.00 | JAVA0055 Class should be interface | |
| JAVA0056 | 0.00 | JAVA0056 Unnecessary abstract modifier for interface or annotation | |
| JAVA0057 | 0.00 | JAVA0057 Unnecessary default constructor | |
| JAVA0058 | 0.00 | JAVA0058 Constructor calls super() | |
| JAVA0059 | 0.00 | JAVA0059 Method override only calls super() | |
| JAVA0061 | 1.00 | JAVA0061 Inaccessible member in anonymous class | |
| JAVA0062 | 0.00 | JAVA0062 Public class missing public member or protected constructor | |
| JAVA0063 | 0.00 | JAVA0063 Identifier name should not contain '$' | |
| JAVA0064 | 0.00 | JAVA0064 N variations of identifier name (maximum: M) | |
| JAVA0065 | 0.00 | JAVA0065 Unnecessary final modifier for method in final class | |
| JAVA0066 | 0.00 | JAVA0066 Unnecessary modifier for interface nested type | |
| JAVA0067 | 23.00 | JAVA0067 Array descriptor on identifier name | |
| JAVA0068 | 0.00 | JAVA0068 Modifiers not declared in recommended order | |
| JAVA0071 | 0.00 | JAVA0071 Strings compared with == | |
| JAVA0073 | 0.00 | JAVA0073 Integer division in floating-point context | |
| JAVA0074 | 0.00 | JAVA0074 Use of Object.notify() | |
| JAVA0075 | 0.00 | JAVA0075 Method parameter hides field | |
| JAVA0076 | 0.00 | JAVA0076 Use of magic number | |
| JAVA0077 | 0.00 | JAVA0077 Private field not used in declaring class | |
| JAVA0078 | 1.00 | JAVA0078 Floating point values compared with == | |
| JAVA0079 | 0.00 | JAVA0079 Use of instance to reference static member | |
| JAVA0080 | 0.00 | JAVA0080 Import declaration not used | |
| JAVA0081 | 0.00 | JAVA0081 Boolean literal in comparison | |
| JAVA0082 | 0.00 | JAVA0082 Unnecessary widening cast | |
| JAVA0083 | 0.00 | JAVA0083 Unnecessary instanceof test | |
| JAVA0084 | 0.00 | JAVA0084 Should use compound assignment operator | |
| JAVA0085 | 0.00 | JAVA0085 Use of sun.* class | |
| JAVA0087 | 1.00 | JAVA0087 Use of Thread.sleep() | |
| JAVA0089 | 0.00 | JAVA0089 Use of restricted package | |
| JAVA0092 | 0.00 | JAVA0092 Use of restricted type | |
| JAVA0093 | 0.00 | JAVA0093 Redundant assignment | |
| JAVA0094 | 0.00 | JAVA0094 Field hides a superclass field | |
| JAVA0095 | 0.00 | JAVA0095 Uninitialized private field | |
| JAVA0096 | 1.00 | JAVA0096 Field in nested class hides outer field | |
| JAVA0098 | 5.00 | JAVA0098 Minimize use of implicit field initializers | |
| JAVA0100 | 1.00 | JAVA0100 Class contains N non-final fields (maximum: M) | |
| JAVA0101 | 0.00 | JAVA0101 Unnecessary modifier for field in interface | |
| JAVA0102 | 0.00 | JAVA0102 Last statement in finalize() not super.finalize() | |
| JAVA0103 | 0.00 | JAVA0103 Explicit call to finalize() | |
| JAVA0104 | 0.00 | JAVA0104 finalize() only calls super.finalize() | |
| JAVA0105 | 0.00 | JAVA0105 Duplicate import declaration | |
| JAVA0106 | 0.00 | JAVA0106 Unnecessary import from current package | |
| JAVA0108 | 0.00 | JAVA0108 Incorrect javadoc: no @param tag for 'parameter' | |
| JAVA0109 | 0.00 | JAVA0109 Incorrect javadoc: no parameter 'parameter' | |
| JAVA0110 | 0.00 | JAVA0110 Incorrect javadoc: no @return tag | |
| JAVA0111 | 0.00 | JAVA0111 Incorrect javadoc: @return tag for void method | |
| JAVA0112 | 0.00 | JAVA0112 Incorrect javadoc: no exception 'exception' in throws | |
| JAVA0113 | 1.00 | JAVA0113 Incorrect javadoc: no @author tag | |
| JAVA0114 | 1.00 | JAVA0114 Incorrect javadoc: no @version tag | |
| JAVA0115 | 0.00 | JAVA0115 Incorrect javadoc: no @throws or @exception tag for 'exception' | |
| JAVA0116 | 0.00 | JAVA0116 Missing javadoc: field 'field' | |
| JAVA0117 | 1.00 | JAVA0117 Missing javadoc: method 'method' | |
| JAVA0118 | 0.00 | JAVA0118 Missing javadoc: type 'type' | |
| JAVA0119 | 0.00 | JAVA0119 Control variable changed within body of for loop | |
| JAVA0123 | 0.00 | JAVA0123 Use all three components of for loop | |
| JAVA0125 | 0.00 | JAVA0125 Continue statement with label | |
| JAVA0126 | 0.00 | JAVA0126 Method declares unchecked exception in throws | |
| JAVA0128 | 0.00 | JAVA0128 Public constructor in non-public class | |
| JAVA0130 | 0.00 | JAVA0130 Non-static method does not use instance fields | |
| JAVA0131 | 0.00 | JAVA0131 Compatible method does not override base | |
| JAVA0132 | 0.00 | JAVA0132 Method overload with compatible signature | |
| JAVA0133 | 0.00 | JAVA0133 Non-synchronized method overrides synchronized method | |
| JAVA0135 | 0.00 | JAVA0135 Only one of Object.equals and Object.hashCode defined: missing 'method' | |
| JAVA0136 | 0.00 | JAVA0136 N methods defined in class (maximum: M) | |
| JAVA0137 | 5.00 | JAVA0137 Non-abstract class missing constructor | |
| JAVA0138 | 0.00 | JAVA0138 N parameters defined for method (maximum: M) | |
| JAVA0139 | 0.00 | JAVA0139 Definition of main other than public static void main(java.lang.String[]) | |
| JAVA0141 | 0.00 | JAVA0141 Unnecessary modifier for method in interface | |
| JAVA0143 | 0.00 | JAVA0143 Synchronized method | |
| JAVA0144 | 0.00 | JAVA0144 Line exceeds maximum M characters | |
| JAVA0145 | 0.00 | JAVA0145 Tab character used in source file | |
| JAVA0150 | 0.00 | JAVA0150 java.lang.Error (or subclass) thrown | |
| JAVA0153 | 0.00 | JAVA0153 Inefficient conversion of integer to string | |
| JAVA0159 | 0.00 | JAVA0159 Inefficient conversion of string to integer | |
| JAVA0160 | 0.00 | JAVA0160 Method does not throw specified exception | |
| JAVA0161 | 0.00 | JAVA0161 Conditional wait() not in loop | |
| JAVA0163 | 0.00 | JAVA0163 Empty statement | |
| JAVA0165 | 0.00 | JAVA0165 Conflicting return statement in finally block | |
| JAVA0166 | 0.00 | JAVA0166 Generic exception caught | |
| JAVA0167 | 0.00 | JAVA0167 ThreadDeath not rethrown | |
| JAVA0169 | 0.00 | JAVA0169 Unnecessary catch block: exception 'exception' | |
| JAVA0170 | 0.00 | JAVA0170 Caught exception not derived from java.lang.Exception | |
| JAVA0171 | 0.00 | JAVA0171 Unused local variable | |
| JAVA0173 | 0.00 | JAVA0173 Unused method parameter | |
| JAVA0174 | 0.00 | JAVA0174 Assigned local variable never used | |
| JAVA0175 | 0.00 | JAVA0175 Successive assignment to variable | |
| JAVA0176 | 0.00 | JAVA0176 Local variable name does not have required form | |
| JAVA0177 | 33.00 | JAVA0177 Variable declaration missing initializer | |
| JAVA0179 | 0.00 | JAVA0179 Local variable hides visible field | |
| JAVA0233 | 0.00 | JAVA0233 Definition of serialVersionUID other than 'private static final long serialVersionUID' | |
| JAVA0234 | 0.00 | JAVA0234 Class is Serializable but does not define serialVersionUID | |
| JAVA0235 | 0.00 | JAVA0235 Class defines serialVersionUID but does not implement Serializable | |
| JAVA0236 | 0.00 | JAVA0236 Attempt to clone an object which does not implement Cloneable | |
| JAVA0237 | 0.00 | JAVA0237 Class implements Cloneable but does not have public clone method | |
| JAVA0238 | 0.00 | JAVA0238 Clone method does not call super.clone() | |
| JAVA0239 | 0.00 | JAVA0239 Class declares 'readObject' or 'writeObject' but does not implement Serializable | |
| JAVA0240 | 0.00 | JAVA0240 Serializable class which declares readObject or writeObject but not both | |
| JAVA0241 | 0.00 | JAVA0241 'readObject' or 'writeObject' should be declared private in Serializable class | |
| JAVA0242 | 0.00 | JAVA0242 Transient field in non-Serializable class | |
| JAVA0243 | 0.00 | JAVA0243 'readResolve' or 'writeReplace' should be declared private or protected | |
| JAVA0244 | 0.00 | JAVA0244 Field or method name in subclass differs only by case from inherited field or method | |
| JAVA0245 | 0.00 | JAVA0245 JUnit TestCase with non-trivial constructor | |
| JAVA0246 | 0.00 | JAVA0246 JUnit assertXXX statement missing message parameter | |
| JAVA0247 | 0.00 | JAVA0247 JUnit 'setUp()' and 'tearDown()' should call super method | |
| JAVA0248 | 0.00 | JAVA0248 JUnit method 'setUp' or 'tearDown' with incorrect signature | |
| JAVA0249 | 0.00 | JAVA0249 JUnit TestCase 'suite()' should be declared static | |
| JAVA0250 | 0.00 | JAVA0250 JUnit TestCase declares testXXX method with incorrect signature | |
| JAVA0251 | 0.00 | JAVA0251 Use '%n' for line breaks in printf/format for platform independence | |
| JAVA0252 | 0.00 | JAVA0252 'enum' is a Java 1.5 reserved word | |
| JAVA0253 | 0.00 | JAVA0253 Not all enum constants consumed in switch statement | |
| JAVA0254 | 0.00 | JAVA0254 Use enhanced for loop construct instead of Iterator | |
| JAVA0255 | 0.00 | JAVA0255 Result of method invocation not used | |
| JAVA0256 | 0.00 | JAVA0256 Assignment of external collection/array to field | |
| JAVA0257 | 0.00 | JAVA0257 Use of 'Constant Interface' anti-pattern | |
| JAVA0258 | 0.00 | JAVA0258 Implement Iterable for foreach compatibility | |
| JAVA0259 | 0.00 | JAVA0259 Return of collection/array field | |
| JAVA0260 | 0.00 | JAVA0260 Use 'enum' instead of Enumerated Type pattern | |
| JAVA0261 | 0.00 | JAVA0261 Use specialized Enum collection types | |
| JAVA0262 | 0.00 | JAVA0262 Use of char in integer context | |
| JAVA0263 | 0.00 | JAVA0263 Long literal ends with 'l' instead of 'L' | |
| JAVA0264 | 0.00 | JAVA0264 Integer math in long context - check for overflow | |
| JAVA0265 | 0.00 | JAVA0265 Use of Throwable.printStackTrace() | |
| JAVA0266 | 0.00 | JAVA0266 Use of System.out | |
| JAVA0267 | 0.00 | JAVA0267 Use of System.err | |
| JAVA0269 | 0.00 | JAVA0269 Contents of StringBuffer never used | |
| JAVA0270 | 3.00 | JAVA0270 Use Java 5.0 enhanced for loop construct to iterate over all elements in an array | |
| JAVA0271 | 0.00 | JAVA0271 Minimize use of on-demand (.*) static imports | |
| JAVA0272 | 0.00 | JAVA0272 Thread.run() called | |
| JAVA0273 | 2.00 | JAVA0273 Non-final derivative of Thread calls start() in constructor | |
| JAVA0274 | 0.00 | JAVA0274 Serializable class has a synchronized readObject() | |
| JAVA0275 | 0.00 | JAVA0275 Serializable class has a synchronized writeObject() and no other synchronized methods | |
| JAVA0276 | 0.00 | JAVA0276 Unnecessary use of String constructor | |
| JAVA0277 | 0.00 | JAVA0277 Iterator.next() implementation does not throw NoSuchElementException | |
| JAVA0278 | 0.00 | JAVA0278 Unnecessary use of Boolean constructor | |
| JAVA0279 | 0.00 | JAVA0279 Serialization method readObject or readObjectNoData calls an overridable method | |
| JAVA0280 | 0.00 | JAVA0280 IllegalMonitorStateException caught | |
| JAVA0281 | 0.00 | JAVA0281 Iterator.next() not called in loop | |
| JAVA0282 | 0.00 | JAVA0282 Call to Iterator.next() in loop which does not test Iterator.hasNext() | |
| JAVA0283 | 0.00 | JAVA0283 Control variable not updated in loop body | |
| JAVA0284 | 0.00 | JAVA0284 Explicit garbage collection | |
| JAVA0285 | 25.00 | JAVA0285 Dereference of potentially null variable | |
| JAVA0286 | 0.00 | JAVA0286 Dereference of null variable | |
| JAVA0287 | 0.00 | JAVA0287 Unnecessary null check | |
| JAVA0288 | 0.00 | JAVA0288 Inconsistent null check | |
| LINES | 880.00 | Number of lines in the source file | |
| LINE_COMMENT | 37.00 | Number of line comments | |
| LOC | 704.00 | Lines of code | |
| LOGICAL_LINES | 433.00 | Number of statements | |
| LOOPS | 45.00 | Number of loops | |
| NEST_DEPTH | 5.00 | Maximum nesting depth | |
| OPERANDS | 2348.00 | Number of operands | |
| OPERATORS | 3664.00 | Number of operators | |
| PARAMS | 12.00 | Number of formal parameter declarations | |
| PROGRAM_LENGTH | 6012.00 | Halstead program length | |
| PROGRAM_VOCAB | 301.00 | Halstead program vocabulary | |
| PROGRAM_VOLUME | 0.00 | Halstead program volume | |
| RETURNS | 17.00 | Number of return points from functions | |
| SIZE | 26741.00 | Size of the file in bytes | |
| UNIQUE_OPERANDS | 250.00 | Number of unique operands | |
| UNIQUE_OPERATORS | 51.00 | Number of unique operators | |
| WHITESPACE | 91.00 | Number of whitespace lines | |