Skip navigation links
A B C D E F G H I J L M N O P R S T U V W 

C

C(int, int) - Method in class scarst.SQUAD
Return the i-th quad-corner of a given quad 'q'
C(int) - Method in class scarst.SQUAD
Return the quad corner matched with quad (or vertex) 'Q'
cds5 - Variable in class RuntimeBenchmark
 
checkAdjacent(WingededgeInterface) - Static method in class scarst.bench.CheckCorrectness
Check the correctness of adjacency method
CheckCorrectness - Class in scarst.bench
 
CheckCorrectness() - Constructor for class scarst.bench.CheckCorrectness
 
checkListing(NavigationInterface) - Static method in class scarst.bench.CheckCorrectness
Check the correctness of the vertex normal computation
checkMatching(CornerTableInterface, int[]) - Static method in class scarst.SOTBuilder
Check the validity of the matching between triangles and faces computed by the Matching & pairing procedure.
checkMatchingAndPairing(CornerTable) - Method in class scarst.SQUADBuilder
Check the validity of the matching between triangles and faces computed by the Matching & pairing procedure.
checkOrientation() - Method in class scarst.CompactMeshBuilder
Check the edge orientations and vertex labels
checkOrientation() - Method in class scarst.EfficientCompactMeshBuilder
Check the edge orientations and vertex labels
checkPermutation(int[]) - Static method in class scarst.ArrayBasedMeshBuilder
Check whether a table of n integers encode a permutation of order n Every integer between 0 and N-1 must appear exactly once in table t
checkTriangleQuadCorners(CornerTable) - Method in class scarst.SQUADBuilder
Check the correctness of the correspondence between triangle and quad corners

Only useful for debugging
checkValidity() - Method in class scarst.CompactHalfedge
Check the combinatorial validity of the data structure
checkValidity() - Method in class scarst.CornerTable
Check the combinatorial validity of the data structure
checkValidity() - Method in interface scarst.CornerTableInterface
Check the combinatorial validity of the data structure
checkValidity() - Method in class scarst.SOT
Check the combinatorial validity of the data structure
checkValidity() - Method in class scarst.SQUAD
Check the combinatorial validity of the data structure
checkValidity(SQUAD) - Method in class scarst.SQUADBuilder
Given the Vertex Table and the triangle/vertex Matching compute and return the Sorted Opposite Table.
checkVertexAdjacency(NavigationInterface) - Static method in class scarst.bench.EvaluateAdjacent
Check the correctness of adjacency method
checkVertexAdjacency(WingededgeInterface) - Static method in class scarst.bench.EvaluateNavigationalOperations
Check the correctness of adjacency method
checkVertexDegree(NavigationInterface) - Static method in class scarst.bench.CheckCorrectness
Check the correctness of the vertex degree computation
checkVertexNormals(CompactTriangleMesh, CompactTriangleMesh) - Static method in class scarst.bench.CheckCorrectness
Check the correctness of the vertex normal computation
cheds - Variable in class RuntimeBenchmark
 
colors - Variable in class scarst.SQUADBuilder
store the color for each face (useful for rendering)
ColumnArrayBasedStack - Class in scarst.util
 
ColumnArrayBasedStack(int[], int, int, int) - Constructor for class scarst.util.ColumnArrayBasedStack
Initialize a stack using an existing T: the elements will be stored in the i-th column of the array
CompactHalfedge - Class in scarst
Compact Half-edge data structure for triangle meshes.
CompactHalfedge(int, int[], int[], float[]) - Constructor for class scarst.CompactHalfedge
Create a Compact Halfedge representation of a (closed) triangle mesh.
CompactHalfedge(int, int) - Constructor for class scarst.CompactHalfedge
Initialize the data structure
CompactHalfedgeBuilder - Class in scarst
This class provides functions for the construction of the Compact Half-edge representation for triangle meshes.
CompactHalfedgeBuilder() - Constructor for class scarst.CompactHalfedgeBuilder
 
CompactMeshBuilder - Class in scarst
 
CompactMeshBuilder(MinPlanarTriSchnyderWood) - Constructor for class scarst.CompactMeshBuilder
 
CompactMeshBuilder_5n - Class in scarst
Deprecated.
This class is not memory efficient and thus deprecated.
This class should be replaced by the class #EfficientCompactMeshBuilder_5n which is faster and consumes less memory (using array-based implementations of Half-edge representations).
CompactMeshBuilder_5n(MinPlanarTriSchnyderWood) - Constructor for class scarst.CompactMeshBuilder_5n
Deprecated.
 
CompactMeshBuilder_6n - Class in scarst
 
CompactMeshBuilder_6n(MinPlanarTriSchnyderWood) - Constructor for class scarst.CompactMeshBuilder_6n
 
CompactTriangleMesh - Class in scarst
Abstract class defining the methods provided by the Compact Data Structures for triangle meshes making of Schnyder woods and implementing the Winged Edge interface.
CompactTriangleMesh() - Constructor for class scarst.CompactTriangleMesh
 
CompactTriangleMesh_5n - Class in scarst
 
CompactTriangleMesh_5n(int) - Constructor for class scarst.CompactTriangleMesh_5n
 
CompactTriangleMesh_6n - Class in scarst
 
CompactTriangleMesh_6n(int) - Constructor for class scarst.CompactTriangleMesh_6n
 
computeAdditionalReferences(FastMinimalSchnyderWood) - Static method in class scarst.ScarstOtBuilder
Compute all additional references (only for 'special' edges).
computeAdditionalReferences(MinPlanarTriSchnyderWood) - Static method in class scarst.ScarstOtBuilder_old
Deprecated.
Compute all additional references (only for 'special' edges).
computeAdditionalReferences2n(MinPlanarTriSchnyderWood) - Static method in class scarst.ScarstOtBuilder_old
Deprecated.
Preliminary version, for estimating the size of the adaptive compact data structure with vertex reordering.
computeEdgeRankAndIndegrees(FastMinimalSchnyderWood, int[]) - Static method in class scarst.ScarstOtBuilder
Given a planar triangulation endowed with a Schnyder wood, it computes:
-) the edge rank, for each edge: the rank of an edge 'e=(u, v)' of color 'c', among all edges incoming at 'v', of color 'c'.
computeEdgeRankAndIndegrees(MinPlanarTriSchnyderWood, int[][]) - Static method in class scarst.ScarstOtBuilder_old
Deprecated.
Given a planar triangulation endowed with a Schnyder wood, it computes:
-) the edge rank, for each edge: the rank of an edge 'e=(u, v)' of color 'c', among all edges incoming at 'v', of color 'c'.
computeIndegrees(FastMinimalSchnyderWood) - Method in class scarst.ScarstOtBuilder
Return an array of '3*n' booleans having an entry for each edge 'e=(u, v)'.
computeIndegrees(MinPlanarTriSchnyderWood) - Method in class scarst.ScarstOtBuilder_old
Deprecated.
Return an array of '3*n' booleans having an entry for each edge 'e=(u, v)'.
computeLRStorageCost(String, int) - Static method in class StorageBenchmark
Compute the storage cost of LR data structure
coordF - Variable in class jcgminimal.polyhedron.MinPolyhedron_3
 
coordF - Variable in class scarst.CompactHalfedge
a table of size 3*V storing geometric coordinates of vertices
coordF - Variable in class scarst.CompactTriangleMesh
 
coordF - Variable in class scarst.CornerTable
a table of size 3*V storing geometric coordinates of vertices
CornerTable - Class in scarst
Array-based implementation of the Corner Table data structure for triangle meshes.
CornerTable(int, int[], int[], float[]) - Constructor for class scarst.CornerTable
Create a Corner Table representation of a (closed) triangle mesh.
CornerTableBuilder - Class in scarst
This class provides functions for creating an array based implementations of the Corner Table representation of (closed) triangle meshes.
CornerTableBuilder() - Constructor for class scarst.CornerTableBuilder
 
CornerTableFromSharedVertexRepresentation(Point_[], int[][]) - Static method in class scarst.CornerTableBuilder
Deprecated.
This method is not memory efficient (it makes use of an intermediate Shared Vertex Represention).
CornerTableFromVertexTable(int, int[], float[]) - Static method in class scarst.CornerTableBuilder
Construct an array based implementation of the Corner Table data structure.
CornerTableInterface - Interface in scarst
Interface defining the methods provided by the Corner Table representation
createLRFromHalfedge(CompactHalfedge, int) - Static method in class scarst.LRBuilder
Compute the storage cost of LR
createMesh(X[], int[], int[][]) - Method in class jcgminimal.mesh.MinMeshBuilder
Efficient construction of a Polyhedron (Half-edge DS) for a triangle mesh (from a share vertex representation) Warning: old version, it works only for triangle meshes
createMesh(String) - Method in class jcgminimal.mesh.MinMeshBuilder
Memory efficient construction of a Polyhedron (Half-edge DS) for a triangle mesh (no use of a share vertex representation).
createMeshEfficiently(String, boolean) - Static method in class scarst.CompactHalfedgeBuilder
Memory efficient construction of the Compact Half-edge representation for closed triangle meshes.
createMeshEfficiently(String, boolean) - Static method in class scarst.CornerTableBuilder
Memory efficient construction of the Corner Table representation for closed triangle meshes.
createOppositeTable(int[], int[]) - Static method in class scarst.CornerTableBuilder
Given the input vertex table 'V', compute the 'opposite' corners and store them in table 'O'.
createSortedTable(int[], int[]) - Static method in class scarst.SOTBuilder
Deprecated.
createSOTFromCornerTable(CornerTable, float[], int, boolean) - Static method in class scarst.SOTBuilder
Construct the SOT data structure.
createSwingTable(CornerTable) - Method in class scarst.SQUADBuilder
Given the Vertex Table and the triangle/vertex Matching compute and return the Sorted Opposite Table.
crossProduct(float[], float[]) - Static method in class scarst.CompactHalfedge
 
crossProduct(float[], float[]) - Static method in class scarst.CornerTable
 
ct - Variable in class RuntimeBenchmark
 
A B C D E F G H I J L M N O P R S T U V W 
Skip navigation links