public class EvaluateNavigationalOperations
extends java.lang.Object
Modifier and Type | Field and Description |
---|---|
static int |
repeat |
static int |
repeatWarmingPhase |
Constructor and Description |
---|
EvaluateNavigationalOperations() |
Modifier and Type | Method and Description |
---|---|
static boolean |
checkVertexAdjacency(Jcg.mesh.arraybased.WingededgeInterface ds)
Check the correctness of adjacency method
|
static int[] |
getRealEdges(Jcg.mesh.arraybased.WingededgeInterface ds,
int k,
int seed)
Return an array of size 2k, containing k "real" (belonging to the graph).
|
static double |
mean(double[] a) |
static double |
median(double[] a) |
static java.lang.String |
performancesToString(java.lang.String[] operators,
double[] timings) |
static void |
showMemory() |
static double |
testVertexDegree(Jcg.mesh.arraybased.ArrayBasedHalfedge ds)
Evaluating the performance of array based implementation of half edge DS
|
static double |
testVertexDegree(Jcg.mesh.arraybased.ArrayBasedWingededge ds)
Evaluating array based Winged-edge DS (vertex degree operator)
|
static double |
testVertexDegree(CompactHalfedge ds)
Evaluating the performance of array based implementation of Compact half edge DS
|
static double |
testVertexDegree(CompactTriangleMesh_5n ds)
Evaluating Compact triangle DS (using 5 references per vertex)
|
static double |
testVertexDegree(CompactTriangleMesh_6n ds)
Evaluating Compact triangle DS (using 6 references per vertex)
|
static double |
testVertexDegree(CornerTable ds)
Evaluating the performance of array based implementation of half edge DS
|
static double |
testVertexDegree(Scarst_os ds)
Evaluating Compact triangle DS (using 3 references per vertex)
|
static double |
testVertexDegree(Scarst_ot ds)
Evaluating Adaptive Compact triangle DS (using 3-5 references per vertex)
|
static double |
testVertexDegree(Scarst_rs ds)
Evaluating Sorted Compact triangle DS (using 3 references per vertex)
|
static double |
testVertexDegree(SOT ds)
Evaluating the performance of array based implementation of half edge DS
|
public static int repeat
public static int repeatWarmingPhase
public static double testVertexDegree(CornerTable ds)
public static double testVertexDegree(SOT ds)
public static double testVertexDegree(Jcg.mesh.arraybased.ArrayBasedHalfedge ds)
public static double testVertexDegree(CompactHalfedge ds)
public static double testVertexDegree(CompactTriangleMesh_6n ds)
public static double testVertexDegree(Scarst_ot ds)
public static double testVertexDegree(Scarst_os ds)
public static double testVertexDegree(Scarst_rs ds)
public static double testVertexDegree(CompactTriangleMesh_5n ds)
public static double testVertexDegree(Jcg.mesh.arraybased.ArrayBasedWingededge ds)
public static void showMemory()
public static java.lang.String performancesToString(java.lang.String[] operators, double[] timings)
public static int[] getRealEdges(Jcg.mesh.arraybased.WingededgeInterface ds, int k, int seed)
public static boolean checkVertexAdjacency(Jcg.mesh.arraybased.WingededgeInterface ds)
Remark: the sum of all vertex degrees must match 2e (twice the number of edges)
public static double mean(double[] a)
public static double median(double[] a)