Package | Description |
---|---|
<Unnamed> | |
scarst | |
scarst.bench |
Modifier and Type | Method and Description |
---|---|
static void |
RuntimeBenchmark.printMessage(CornerTableInterface ds)
Print informations about the data structure to test
|
Modifier and Type | Class and Description |
---|---|
class |
CornerTable
Array-based implementation of the Corner Table data structure for triangle meshes.
|
class |
SOT
Sorted Opposite Table (SOT) data structure for triangle meshes.
|
class |
SQUAD
SQUAD (Sorted SQUAD) data structure for triangle meshes.
|
Modifier and Type | Method and Description |
---|---|
static boolean |
SOTBuilder.checkMatching(CornerTableInterface ds,
int[] M)
Check the validity of the matching between triangles and faces computed by the
Matching & pairing procedure.
|
static int[] |
SOTBuilder.getFacePermutation(CornerTableInterface ds,
int[] M)
Given the matching between vertices and faces, return an array storing the face re-ordering.
|
static void |
SOTBuilder.matchVerticesToFaces(CornerTableInterface ds,
int c,
int[] M,
int[] colors)
Perform the Matching & pairing procedure described in Gurung et al.
|
Modifier and Type | Method and Description |
---|---|
static double |
EvaluateListing.runTest(CornerTableInterface ds)
Evaluate the runtime performance of the 'listing' computation (data structure implementing the Corner Table interface)
|
static double |
EvaluateNormal.runTest(CornerTableInterface ds)
Evaluate the runtime performance of the 'vertex normal' computation (data structure implementing the Corner Table interface)
|
static double |
EvaluateAdjacent.testVertexAdjacency(CornerTableInterface ds,
int k,
int seed)
Timings for the computation of vertex adjacency (time per query), expressed in nanoseconds
|
static double |
EvaluateDegree.testVertexDegreeGeneric(CornerTableInterface ds)
Evaluate the runtime performance of the 'vertex degree' computation (data structure implementing the Corner Table interface)
|