- c - Variable in class Jcg.geometry.Line_2
-
- c - Variable in class Jcg.geometry.Plane_3
-
- canvas - Variable in class Jcg.viewer.editor2d.AlgorithmList
-
- canvas - Variable in class Jcg.viewer.editor2d.Editor2D
-
- Canvas2D - Class in Jcg.viewer.editor2d
-
Simple class for visualizing planar graphs and plane objects (points, segments, ...)
- Canvas2D() - Constructor for class Jcg.viewer.editor2d.Canvas2D
-
Create a 2D window for drawing 2D objects
- Canvas2DProcessing - Class in Jcg.viewer.processing2d
-
A class for drawing 2D objects (points, segments, ...) in a 2D Processing frame
- Canvas2DProcessing() - Constructor for class Jcg.viewer.processing2d.Canvas2DProcessing
-
- cell() - Method in class Jcg.triangulations3D.FacetHandle
-
returns a cell containing the facet.
- cells() - Method in class Jcg.triangulations3D.Delaunay_3
-
returns the collection of all cells of the triangulation.
- cells - Variable in class Jcg.triangulations3D.TriangulationDS_3
-
- cellsCollection - Variable in class Jcg.viewer.j3d.MeshViewer
-
A field in which to store collections of 3D triangulation cells to be shown in the scene.
- checkCombinatorics() - Method in class Jcg.graph.arraybased.ArrayBasedAdjacencyListGraph
-
Check whether the graph is combinatorially consistent
- circumCenter(Point_2, Point_2, Point_2) - Static method in class Jcg.geometry.GeometricOperations_2
-
Deprecated.
Returns the (approximate) circumcenter of input triangle
- circumCenter(Point_3, Point_3, Point_3, Point_3) - Static method in class Jcg.geometry.GeometricOperations_3
-
Deprecated.
- circumCenter(Point_2, Point_2, Point_2) - Method in class Jcg.geometry.kernel.ApproximateConstructions_2
-
Returns the (approximate) circumcenter of input triangle
- circumCenter(Point_3, Point_3, Point_3, Point_3) - Method in class Jcg.geometry.kernel.ApproximateConstructions_3
-
Returns the (approximate) circumcenter of four points
- circumCenter(Point_2, Point_2, Point_2) - Method in interface Jcg.geometry.kernel.GeometricConstructions_2
-
Returns the (approximate) circumcenter of input triangle
- circumCenter(Point_3, Point_3, Point_3, Point_3) - Method in interface Jcg.geometry.kernel.GeometricConstructions_3
-
Returns the (approximate) circumcenter of four points
- clear() - Method in class Jcg.polyhedron.Decorator
-
- clear(int) - Method in class Jcg.util.BitSet32
-
Clears a bit.
- clear(int) - Method in class Jcg.util.BitSet64
-
Clears a bit.
- clear(int) - Method in interface Jcg.util.BitSetInterface
-
- clearWindow() - Method in class Jcg.viewer.old.Fenetre
-
Remove all points and segments from the window
- ClosestPair - Interface in Jcg.closestpair
-
Interface for closest pair algorithms
- cMark - Variable in class Jcg.triangulations2D.QuadEdge
-
- collinear(Point_2, Point_2, Point_2) - Static method in class Jcg.geometry.GeometricOperations_2
-
Deprecated.
Returns true if a, b and c lie on a same line
- collinear(Point_2, Point_2, Point_2) - Method in class Jcg.geometry.kernel.ApproximatePredicates_2
-
Returns true if a, b and c lie on a same line
- collinear(Point_2, Point_2, Point_2) - Method in class Jcg.geometry.kernel.ExactPredicates_2
-
Returns true if a, b and c lie on a same line
- collinear(Point_2, Point_2, Point_2) - Method in class Jcg.geometry.kernel.FilteredPredicates_2
-
Returns true if a, b and c lie on a same line
- collinear(Point_2, Point_2, Point_2) - Method in interface Jcg.geometry.kernel.GeometricPredicates_2
-
Returns true if a, b and c lie on a same line
- compare(X, X) - Method in class Jcg.geometry.CoordinateComparator
-
Compare two points according to their i-th coordinate (where i=direction)
- compareCartesian(Point_, int) - Method in interface Jcg.geometry.Point_
-
Perform the comparison between the i-th coordinate of two points
- compareCartesian(Point_, int) - Method in class Jcg.geometry.Point_2
-
Compare the i-th coordinate of two points
- compareCartesian(Point_, int) - Method in class Jcg.geometry.Point_3
-
Compare the i-th coordinate of two points
- compareCartesian(Point_, int) - Method in class Jcg.geometry.Point_d
-
Compare the i-th coordinate of two points
- compareTo(Point_) - Method in class Jcg.geometry.Point_2
-
Compare two points (lexicographic order on coordinates)
- compareTo(Point_) - Method in class Jcg.geometry.Point_3
-
Compare two points (lexicographic order on coordinates)
- compareTo(Point_) - Method in class Jcg.geometry.Point_d
-
- compareTo(TriangulationDSFace_2<X>) - Method in class Jcg.triangulations2D.TriangulationDSFace_2
-
compares the face to another face using a clockwise order on their vertices
- compareTo(TriangulationDSVertex_2<X>) - Method in class Jcg.triangulations2D.TriangulationDSVertex_2
-
- compareTo(Object) - Method in class Jcg.triangulations3D.TriangulationDSCell_3
-
compares the cell to another cell using a lexicographical order on their sorted vertices
(treated as 3D points).
- compose(Transformation_2) - Method in class Jcg.geometry.Transformation_2
-
Compose two transformations
- computeAttractiveForce(int) - Method in class Jcg.graph.drawing.SpringDrawing_2
-
- computeAttractiveForce(int) - Method in class Jcg.graph.drawing.SpringDrawing_3
-
- computeBoundingBox() - Method in class Jcg.viewer.Draw2D
-
Compute the scale factor (depending on the max distance of the point set)
- computeBoundingBox() - Method in class Jcg.viewer.DrawSkeleton
-
Compute the scale factor (depending on the max distance of the point set)
- computeBx() - Method in class Jcg.graph.drawing.TutteDrawing
-
return the column vector Bx
- computeBy() - Method in class Jcg.graph.drawing.TutteDrawing
-
return the column vector By
- computeConvexHull(PointCloud_2) - Method in class Jcg.convexhull2d.AndrewConvexHull
-
- computeConvexHull(PointCloud_2) - Method in interface Jcg.convexhull2d.ConvexHull_2
-
Computation of 2D convex hull
- computeConvexHull(PointCloud_3) - Method in interface Jcg.convexhull3d.ConvexHull_3
-
Computation of 3D convex hull
- computeConvexHull(PointCloud_3) - Method in class Jcg.convexhull3d.SlowConvexHull_3
-
Compute the 3D convex hull by checking all triangles
Warning: to be completed
- computeCoordinates_2(int, double[], double[][]) - Method in class Jcg.graph.drawing.SpectralDrawing_2
-
- computeCoordinates_3(int, double[], double[][]) - Method in class Jcg.graph.drawing.SpectralDrawing_3
-
- computeDrawing() - Method in class Jcg.graph.arraybased.drawing.ArrayBasedGraphDrawing
-
(abstract method) compute the geometric representation of the graph
- computeDrawing() - Method in class Jcg.graph.drawing.BarycentricDrawing
-
compute the barycentric drawing of a planar graph
exterior face points must be given, as well as barycentric coefficients
- computeDrawing() - Method in class Jcg.graph.drawing.GraphDrawing
-
(abstract method) compute the geometric representation of the graph
- computeDrawing() - Method in class Jcg.graph.drawing.GraphDrawing_2
-
(abstract method) Compute the geometric representation of the graph
- computeDrawing() - Method in class Jcg.graph.drawing.IterativeTutteDrawing
-
compute the Tutte drawing of a planar graph iteratively
using the Force-Directed paradigm
The first k vertices are assumed to be fixed on the outer face
- computeDrawing() - Method in class Jcg.graph.drawing.SpectralDrawing_2
-
- computeDrawing() - Method in class Jcg.graph.drawing.SpectralDrawing_3
-
- computeDrawing() - Method in class Jcg.graph.drawing.SphericalCentralProjection
-
Project a polyhedron on the unit sphere.
- computeDrawing() - Method in class Jcg.graph.drawing.SpringDrawing_2
-
compute the drawing of a planar graph iteratively
using the Force-Directed paradigm.
- computeDrawing() - Method in class Jcg.graph.drawing.SpringDrawing_3
-
compute the drawing of a planar graph iteratively
using the Force-Directed paradigm.
- computeDrawing() - Method in class Jcg.graph.drawing.TutteDrawing
-
compute the Tutte drawing of a planar 3-connected graph
solving two systems of linear equations
- computeEdgePoint(Halfedge<Point_3>) - Method in class Jcg.subdivision.LoopSubdivision
-
Compute a new edge point (given the half-edge h)
- computeEdgePoints() - Method in class Jcg.subdivision.LoopSubdivision
-
Compute all new edge points and store the result in an HashMap
- computeEdges() - Method in class Jcg.graph.GeometricGraph_2
-
Return the list of edges of the graph (their corresponding segments)
- computeEdges() - Method in class Jcg.graph.GeometricGraph_3
-
Return the list of edges of the graph (their corresponding segments)
- computeLaplacianG_F() - Method in class Jcg.graph.drawing.TutteDrawing
-
return the laplacian matrix of the graph G-F
where F is a peripherical cycle.
- computeLowerHull(ArrayList<Point_2>) - Method in class Jcg.convexhull2d.AndrewConvexHull
-
- computeNewVertexLocation(Vertex<Point_3>) - Method in class Jcg.subdivision.LoopSubdivision
-
Compute the new coordinates for a vertex (already existing in the initial mesh)
- computeNewVertexLocations() - Method in class Jcg.subdivision.LoopSubdivision
-
Compute the new coordinates for all vertices of the initial mesh
- computeRepulsiveForce(int) - Method in class Jcg.graph.drawing.SpringDrawing_2
-
- computeRepulsiveForce(int) - Method in class Jcg.graph.drawing.SpringDrawing_3
-
- computeScaleFactor(Collection<Point_3>) - Method in class Jcg.viewer.j3d.MeshViewer
-
Compute the scale factor in order to adjust the 3D view (from a Collection)
- computeScaleFactor(Point_3[]) - Method in class Jcg.viewer.j3d.MeshViewer
-
Compute the scale factor in order to adjust the 3D view
- computeScaleFactor() - Method in class Jcg.viewer.processing3d.DrawPolyhedronProcessing
-
Compute the scale factor (depending on the max distance of the point set)
- computeSegments() - Method in class Jcg.geometry.PolyLine_2
-
Compute and return the list of segments defining the polyline
- computeUpperHull(ArrayList<Point_2>) - Method in class Jcg.convexhull2d.AndrewConvexHull
-
- connect(QuadEdge, QuadEdge) - Static method in class Jcg.triangulations2D.QuadEdge
-
Creates a new QuadEdge that connects e1.dest() to e2.orig()
- constraintEdges() - Method in class Jcg.triangulations2D.Delaunay_2
-
Computes and returns the list of constraint edges.
- constructFromPolyhedron(Polyhedron_3<Point_>) - Static method in class Jcg.graph.arraybased.ArrayBasedGraphLoader
-
Construct the graph corresponding to the 1-skeleton of a 3D surface.
- ControlBar - Class in Jcg.viewer.editor2d
-
A class defining a tool bar (providing buttons)
- ControlBar(Canvas2D) - Constructor for class Jcg.viewer.editor2d.ControlBar
-
- controlBar - Variable in class Jcg.viewer.editor2d.Editor2D
-
- CONVEX_HULL_2 - Static variable in class Jcg.viewer.editor2d.AlgorithmList
-
- ConvexHull_2 - Interface in Jcg.convexhull2d
-
Interface defining methods for the computation of the convex hull of points on the plane
- convexHull_2 - Variable in class Jcg.viewer.editor2d.AlgorithmList
-
- ConvexHull_3 - Interface in Jcg.convexhull3d
-
Interface defining methods for the computation of the convex hull of points in 3D space
- convexHullEdges() - Method in class Jcg.triangulations2D.Triangulation_2
-
Computes and returns the collection of all edges on the convex hull (collects only one HalfedgeHandle per geometric edge).
- convexHullFacets() - Method in class Jcg.triangulations3D.Delaunay_3
-
Outputs the collection of all facets of the boundary of the convex hull.
- CoordinateComparator<X extends Point_> - Class in Jcg.geometry
-
Class allowing to compare two points according to a given coordinate
- CoordinateComparator(int) - Constructor for class Jcg.geometry.CoordinateComparator
-
- coordinates - Variable in class Jcg.geometry.Point_d
-
- coplanarExact(Point_3, Point_3, Point_3, Point_3) - Static method in class Jcg.geometry.GeometricOperations_3
-
Deprecated.
Test whether four 3D points are coplanar (test is filtered)
- createCell() - Method in class Jcg.triangulations3D.TriangulationDS_3
-
creates a new cell and adds it to the cells container of the triangulation data structure.
- createCell(TriangulationDSVertex_3<X>, TriangulationDSVertex_3<X>, TriangulationDSVertex_3<X>, TriangulationDSVertex_3<X>, TriangulationDSCell_3<X>, TriangulationDSCell_3<X>, TriangulationDSCell_3<X>, TriangulationDSCell_3<X>) - Method in class Jcg.triangulations3D.TriangulationDS_3
-
creates a new cell in the triangulation,
with the given incident vertices and adjacent cells.
- createCenterVertex(Face<X>) - Method in class Jcg.polyhedron.Polyhedron_3
-
Split a face by inserting a new vertex
- createFace() - Method in class Jcg.triangulations2D.TriangulationDS_2
-
creates a new face and adds it to the faces container of the triangulation data structure.
- createFace(TriangulationDSVertex_2<X>, TriangulationDSVertex_2<X>, TriangulationDSVertex_2<X>, TriangulationDSFace_2<X>, TriangulationDSFace_2<X>, TriangulationDSFace_2<X>) - Method in class Jcg.triangulations2D.TriangulationDS_2
-
creates a new face in the triangulation,
with the given incident vertices and adjacent triangles.
- createMesh(X[], int[], int[][]) - Method in class Jcg.mesh.MeshBuilder
-
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
- createSceneGraph() - Method in class Jcg.viewer.j3d.MeshViewer
-
Create and initialize the scene graph
- createVertex(X, TriangulationDSFace_2<X>) - Method in class Jcg.triangulations2D.TriangulationDS_2
-
creates a new vertex in the triangulation,
with the given incident triangle.
- crossProduct(Vector_) - Method in class Jcg.geometry.Vector_3
-
- CylindricalCanvas2D - Class in Jcg.viewer.editor2d
-
Simple class for visualizing planar graphs and plane objects (points, segments, ...)