- t(int) - Method in class scarst.CornerTable
-
Return the triangle containing corner 'c'
- t(int) - Method in interface scarst.CornerTableInterface
-
Return the triangle containing corner 'c'
- t(int) - Method in class scarst.SOT
-
Return the triangle containing corner 'c'
- t(int) - Method in class scarst.SQUAD
-
Return the triangle containing corner 'c'
- table - Variable in class scarst.Scarst_os
-
Table storing the 'first references' and the service bits, for each edge
- table - Variable in class scarst.Scarst_ot
-
Table storing the 'first references' and the service bits, for each edge
- table - Variable in class scarst.Scarst_rs
-
Table storing the 'first references' and the service bits, for each edge
- TableNoAdditionalServiceBits - Class in scarst.util
-
Implementation of an array storing (32 bits) integer references
Service bits are encoded within integer values (no need of auxiliary information)
- TableNoAdditionalServiceBits(int) - Constructor for class scarst.util.TableNoAdditionalServiceBits
-
- TableWithFiveServiceBits - Class in scarst.util
-
- TableWithFiveServiceBits(int) - Constructor for class scarst.util.TableWithFiveServiceBits
-
- TableWithFourServiceBits - Class in scarst.util
-
- TableWithFourServiceBits(int) - Constructor for class scarst.util.TableWithFourServiceBits
-
- TableWithSixServiceBits - Class in scarst.util
-
- TableWithSixServiceBits(int) - Constructor for class scarst.util.TableWithSixServiceBits
-
- TableWithTwoServiceBits - Class in scarst.util
-
- TableWithTwoServiceBits(int) - Constructor for class scarst.util.TableWithTwoServiceBits
-
Initialize the array (static array with 'nElements')
- testVertexAdjacency(CornerTableInterface, int, int) - Static method in class scarst.bench.EvaluateAdjacent
-
Timings for the computation of vertex adjacency (time per query), expressed in nanoseconds
- testVertexAdjacency(NavigationInterface, int, int) - Static method in class scarst.bench.EvaluateAdjacent
-
Timings for the computation of vertex adjacency (time per query), expressed in nanoseconds
- testVertexDegree(CornerTable) - Static method in class scarst.bench.EvaluateDegree
-
Evaluating the performance of array based implementation of half edge DS
- testVertexDegree(SOT) - Static method in class scarst.bench.EvaluateDegree
-
Evaluating the performance of array based implementation of half edge DS
- testVertexDegree(ArrayBasedHalfedge) - Static method in class scarst.bench.EvaluateDegree
-
Evaluating the performance of array based implementation of half edge DS
- testVertexDegree(CompactHalfedge) - Static method in class scarst.bench.EvaluateDegree
-
Evaluating the performance of array based implementation of Compact half edge DS
- testVertexDegree(CompactTriangleMesh_6n) - Static method in class scarst.bench.EvaluateDegree
-
Evaluating Compact triangle DS (using 6 references per vertex)
- testVertexDegree(Scarst_ot) - Static method in class scarst.bench.EvaluateDegree
-
Evaluating Adaptive Compact triangle DS (using 3-5 references per vertex)
- testVertexDegree(Scarst_os) - Static method in class scarst.bench.EvaluateDegree
-
Evaluating Compact triangle DS (using 3 references per vertex)
- testVertexDegree(Scarst_rs) - Static method in class scarst.bench.EvaluateDegree
-
Evaluating Sorted Compact triangle DS (using 3 references per vertex)
- testVertexDegree(CompactTriangleMesh_5n) - Static method in class scarst.bench.EvaluateDegree
-
Evaluating Compact triangle DS (using 5 references per vertex)
- testVertexDegree(ArrayBasedWingededge) - Static method in class scarst.bench.EvaluateDegree
-
Evaluating array based Winged-edge DS (vertex degree operator)
- testVertexDegree(CornerTable) - Static method in class scarst.bench.EvaluateNavigationalOperations
-
Evaluating the performance of array based implementation of half edge DS
- testVertexDegree(SOT) - Static method in class scarst.bench.EvaluateNavigationalOperations
-
Evaluating the performance of array based implementation of half edge DS
- testVertexDegree(ArrayBasedHalfedge) - Static method in class scarst.bench.EvaluateNavigationalOperations
-
Evaluating the performance of array based implementation of half edge DS
- testVertexDegree(CompactHalfedge) - Static method in class scarst.bench.EvaluateNavigationalOperations
-
Evaluating the performance of array based implementation of Compact half edge DS
- testVertexDegree(CompactTriangleMesh_6n) - Static method in class scarst.bench.EvaluateNavigationalOperations
-
Evaluating Compact triangle DS (using 6 references per vertex)
- testVertexDegree(Scarst_ot) - Static method in class scarst.bench.EvaluateNavigationalOperations
-
Evaluating Adaptive Compact triangle DS (using 3-5 references per vertex)
- testVertexDegree(Scarst_os) - Static method in class scarst.bench.EvaluateNavigationalOperations
-
Evaluating Compact triangle DS (using 3 references per vertex)
- testVertexDegree(Scarst_rs) - Static method in class scarst.bench.EvaluateNavigationalOperations
-
Evaluating Sorted Compact triangle DS (using 3 references per vertex)
- testVertexDegree(CompactTriangleMesh_5n) - Static method in class scarst.bench.EvaluateNavigationalOperations
-
Evaluating Compact triangle DS (using 5 references per vertex)
- testVertexDegree(ArrayBasedWingededge) - Static method in class scarst.bench.EvaluateNavigationalOperations
-
Evaluating array based Winged-edge DS (vertex degree operator)
- testVertexDegreeCCWGeneric(WingededgeInterface) - Static method in class scarst.bench.EvaluateDegree
-
Evaluate the runtime performance of the 'vertex degree (CW)' computation (data structure implementing the Winged-edge interface)
- testVertexDegreeCWGeneric(WingededgeInterface) - Static method in class scarst.bench.EvaluateDegree
-
Evaluate the runtime performance of the 'vertex degree (CW)' computation (data structure implementing the Winged-edge interface)
- testVertexDegreeGeneric(HalfedgeInterface) - Static method in class scarst.bench.EvaluateDegree
-
Evaluate the runtime performance of the 'degree' computation (data structure implementing the Half-edge interface)
- testVertexDegreeGeneric(CornerTableInterface) - Static method in class scarst.bench.EvaluateDegree
-
Evaluate the runtime performance of the 'vertex degree' computation (data structure implementing the Corner Table interface)
- testVertexNormal(CornerTable) - Static method in class scarst.bench.EvaluateNormal
-
Evaluating the performance of array based implementation of half edge DS
- testVertexNormal(ArrayBasedWingededge) - Static method in class scarst.bench.EvaluateNormal
-
Benchmarking the vertex normal operator, for array based Winged-edge (for 3D meshes)
- testVertexNormal(ArrayBasedHalfedge) - Static method in class scarst.bench.EvaluateNormal
-
Benchmarking the vertex normal operator, for array based half-edge (for 3D meshes)
- testVertexNormal(Scarst_ot) - Static method in class scarst.bench.EvaluateNormal
-
Evaluating Adaptive Compact triangle DS (using 3-5 references per vertex)
- testVertexNormal(Scarst_os) - Static method in class scarst.bench.EvaluateNormal
-
Evaluating Adaptive Compact triangle DS (using 3-5 references per vertex)
- testVertexNormal(Scarst_rs) - Static method in class scarst.bench.EvaluateNormal
-
Evaluating Adaptive Compact triangle DS (using 3-5 references per vertex)
- testVertexNormal(CompactTriangleMesh_6n) - Static method in class scarst.bench.EvaluateNormal
-
Performance of vertex normal (simple float precision) for Compact 6n
- top() - Method in class scarst.util.ArrayBasedStack
-
Returns the value at the top of this stack (with deletion).
- top() - Method in class scarst.util.ColumnArrayBasedStack
-
Returns the value at the top of this stack (with deletion).
- top() - Method in interface scarst.util.StackInterface
-
Returns the value at the top of this stack (with deletion).
- toQuadCorner(int) - Static method in class scarst.SQUAD
-
Convert a triangle corner to a quad corner (as defined in Gurung et al.
- toString() - Method in class jcgminimal.polyhedron.MinHalfedge
-
- toString() - Method in class jcgminimal.polyhedron.MinVertex
-
- toString() - Method in class jcgminimal.schnyderwoods.MinPlanarTriSchnyderWood
-
- toString() - Method in class scarst.CompactHalfedge
-
Return a String describing the data structure references
- toString() - Method in class scarst.CompactTriangleMesh_5n
-
Return a String which represents the reference table encoding the data structure
- toString() - Method in class scarst.CompactTriangleMesh_6n
-
Return a String which represents the reference table encoding of the data structure
- toString() - Method in class scarst.CornerTable
-
Return a String describing the data structure references
- toString() - Method in interface scarst.CornerTableInterface
-
Return a String describing the data structure references
- toString() - Method in class scarst.Scarst_os
-
Return a String which represents the reference table encoding of the data structure
- toString() - Method in class scarst.Scarst_ot
-
Return a String which represents the reference table encoding of the data structure
- toString() - Method in class scarst.Scarst_rs
-
Return a String which represents the reference table encoding of the data structure
- toString() - Method in class scarst.SOT
-
Return a String describing the data structure references
- toString() - Method in class scarst.SQUAD
-
Return a String describing the data structure references
- toString() - Method in class scarst.util.ArrayBasedStack
-
Returns a string representing the elements stored in the stack
- toString() - Method in class scarst.util.ColumnArrayBasedStack
-
Returns a string representing the elements stored in the stack
- toString() - Method in class scarst.util.IntegerArrayBasedQueue
-
Returns a string representing the elements stored in the queue
- toTriangleCorner(int) - Method in class scarst.SQUAD
-
Convert a quad corner to a triangle corner (as defined in Gurung et al.