- R - Variable in class RuntimeBenchmark
-
- r(int) - Method in class scarst.CornerTable
-
"Tip on right": return the corner opposite to n(c) in the triangle at the right
- r(int) - Method in interface scarst.CornerTableInterface
-
"Tip on right": return the corner opposite to n(c) in the triangle at the right
- r(int) - Method in class scarst.SOT
-
"Tip on right": return the corner opposite to n(c) in the triangle at the right
- r(int) - Method in class scarst.SQUAD
-
"Tip on right": return the corner opposite to n(c) in the triangle at the right
- readLine() - Static method in class jcgminimal.io.MinIO
-
- readStandardInput() - Static method in class jcgminimal.io.MinIO
-
- readTextFile(String) - Static method in class jcgminimal.io.MinIO
-
- repeat - Variable in class RuntimeBenchmark
-
- repeat - Static variable in class scarst.bench.EvaluateNavigationalOperations
-
- repeat - Static variable in class scarst.bench.EvaluateTimings
-
Number of Runs
- repeatWarmingPhase - Static variable in class scarst.bench.EvaluateNavigationalOperations
-
- repeatWarmingPhase - Static variable in class scarst.bench.EvaluateTimings
-
- reset() - Method in class scarst.util.ArrayBasedStack
-
Reset the array: all elements are removed (set to 0)
- reset() - Method in class scarst.util.ColumnArrayBasedStack
-
Reset the array: all elements are removed (set to 0)
- reset() - Method in class scarst.util.IntegerArrayBasedQueue
-
Reset the array: all elements are removed (set to 0)
- reset() - Method in interface scarst.util.StackInterface
-
Reset the array: all elements are removed (set to 0)
- resetMeshIndices() - Method in class jcgminimal.polyhedron.MinPolyhedron_3
-
Reset indices for all: vertices, faces and halfedges.
- rightBack(int) - Method in class scarst.CompactTriangleMesh
-
Return the 'RightBack' edge, neighbor of 'e'
- rightBack(int) - Method in class scarst.CompactTriangleMesh_5n
-
- rightBack(int) - Method in class scarst.CompactTriangleMesh_6n
-
- rightBack(int) - Method in class scarst.Scarst_os
-
- rightBack(int) - Method in class scarst.Scarst_ot
-
- rightBack(int) - Method in class scarst.Scarst_rs
-
- rightFront(int) - Method in class scarst.CompactTriangleMesh
-
Return the 'RightFront' edge, neighbor of 'e'
- rightFront(int) - Method in class scarst.CompactTriangleMesh_5n
-
- rightFront(int) - Method in class scarst.CompactTriangleMesh_6n
-
- rightFront(int) - Method in class scarst.Scarst_os
-
- rightFront(int) - Method in class scarst.Scarst_ot
-
- rightFront(int) - Method in class scarst.Scarst_rs
-
- rootEdge - Variable in class jcgminimal.schnyderwoods.MinPlanarTriSchnyderWood
-
half-edge (v_0, v_1) oriented toward v_1, assuming the ccw orientation of faces
- rootEdge - Variable in class RuntimeBenchmark
-
- runTest(NavigationInterface, int, int, boolean) - Static method in class scarst.bench.EvaluateAdjacent
-
Timings for the computation of vertex adjacency (time per query), expressed in nanoseconds
- runTest(HalfedgeInterface) - Static method in class scarst.bench.EvaluateListing
-
Evaluate the runtime performance of the 'listing' computation (data structure implementing the Half-edge interface)
- runTest(WingededgeInterface) - Static method in class scarst.bench.EvaluateListing
-
Evaluate the runtime performance of the 'vertex degree' computation (data structure implementing the Winged-edge interface)
- runTest(CornerTableInterface) - Static method in class scarst.bench.EvaluateListing
-
Evaluate the runtime performance of the 'listing' computation (data structure implementing the Corner Table interface)
- runTest(HalfedgeInterface) - Static method in class scarst.bench.EvaluateNormal
-
Evaluate the runtime performance of the 'normal' computation (data structure implementing the Winged-edge interface)
- runTest(WingededgeInterface) - Static method in class scarst.bench.EvaluateNormal
-
Evaluate the runtime performance of the 'normal' computation (data structure implementing the Winged-edge interface)
- runTest(CornerTableInterface) - Static method in class scarst.bench.EvaluateNormal
-
Evaluate the runtime performance of the 'vertex normal' computation (data structure implementing the Corner Table interface)
- runTest(NavigationInterface) - Static method in class scarst.bench.EvaluateTraversal
-
Timings for the computation of vertex adjacency (time per query), expressed in nanoseconds
- RuntimeBenchmark - Class in <Unnamed>
-
- RuntimeBenchmark(String[]) - Constructor for class RuntimeBenchmark
-
Initialize input parameters