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

I

incidentCells(TriangulationDSVertex_3<Point_3>) - Method in class Jcg.triangulations3D.Delaunay_3
Outputs the collection of all cells incident to vertex v.
incidentCells(TriangulationDSCell_3<Point_3>, int, int) - Method in class Jcg.triangulations3D.Delaunay_3
Returns the collection of all cells incident to edge (c,i,j).
incidentCells(TriangulationDSVertex_3<Point_3>, TriangulationDSVertex_3<Point_3>) - Method in class Jcg.triangulations3D.Delaunay_3
Returns the collection of all cells incident to edge (u,v).
incidentCells(TriangulationDSVertex_3<Point_3>) - Method in class Jcg.triangulations3D.TriangulationDS_3
Returns the collection of all triangulation cells incident to vertex v.
incidentCells(TriangulationDSCell_3<Point_3>, int, int) - Method in class Jcg.triangulations3D.TriangulationDS_3
Returns the collection of all triangulation cells incident to edge (c,i,j).
incidentCells(TriangulationDSVertex_3<Point_3>, TriangulationDSVertex_3<Point_3>) - Method in class Jcg.triangulations3D.TriangulationDS_3
Returns the collection of all triangulation cells incident to edge (u,v).
incidentFaces(TriangulationDSVertex_2<X>) - Method in class Jcg.triangulations2D.TriangulationDS_2
Returns the collection of all faces incident to vertex v.
incidentFiniteCells(TriangulationDSVertex_3<Point_3>) - Method in class Jcg.triangulations3D.Delaunay_3
Outputs the collection of all finite cells incident to vertex v.
incidentFiniteCells(TriangulationDSCell_3<Point_3>, int, int) - Method in class Jcg.triangulations3D.Delaunay_3
Returns the collection of all finite cells incident to edge (c,i,j).
incidentFiniteCells(TriangulationDSVertex_3<Point_3>, TriangulationDSVertex_3<Point_3>) - Method in class Jcg.triangulations3D.Delaunay_3
Returns the collection of all finite cells incident to edge (u,v).
inCircle(Point_2, Point_2, Point_2, Point_2) - Static method in class Jcg.geometry.GeometricOperations_2
Deprecated.
Tests if point p lies inside the circumcircle of triangle a,b,c
inCircle(Point_2, Point_2, Point_2, Point_2) - Method in class Jcg.geometry.kernel.ApproximatePredicates_2
Tests if point p lies inside the circumcircle of triangle a,b,c
inCircle(Point_2, Point_2, Point_2, Point_2) - Method in class Jcg.geometry.kernel.ExactPredicates_2
Tests if point p lies inside the circumcircle of triangle a,b,c
inCircle(Point_2, Point_2, Point_2, Point_2) - Method in class Jcg.geometry.kernel.FilteredPredicates_2
Tests if point p lies inside the circumcircle of triangle a,b,c
inCircle(Point_2, Point_2, Point_2, Point_2) - Method in interface Jcg.geometry.kernel.GeometricPredicates_2
Tests if point p lies inside the circumcircle of triangle a,b,c
increaseZoomFactor() - Method in class Jcg.viewer.processing3d.DrawPolyhedronProcessing
Increase the zoom factor by factor 2
index - Variable in class Jcg.polyhedron.Halfedge
 
index - Variable in class Jcg.polyhedron.Vertex
 
index() - Method in class Jcg.triangulations2D.HalfedgeHandle
returns the index of the vertex opposite of the current edge in the corresponding incident face.
index(TriangulationDSVertex_2<X>) - Method in class Jcg.triangulations2D.HalfedgeHandle
returns the index of v in the current edge.
index - Variable in class Jcg.triangulations2D.TriangulationDSFace_2
 
index(TriangulationDSVertex_2<X>) - Method in class Jcg.triangulations2D.TriangulationDSFace_2
returns the index of vertex v in the cell, and throws an Error if v is no vertex of the cell.
index(TriangulationDSFace_2<X>) - Method in class Jcg.triangulations2D.TriangulationDSFace_2
returns the index of the neighboring face c, and throws an Error if c is no neighbor of the face.
index(X) - Method in class Jcg.triangulations2D.TriangulationDSFace_2
returns the index of the vertex of the face associated with x, and throws an Error if x is associated with no vertex of the face.
index - Variable in class Jcg.triangulations2D.TriangulationDSVertex_2
 
index() - Method in class Jcg.triangulations3D.FacetHandle
returns the index of the vertex opposite of the current fact in cell().
index(TriangulationDSVertex_3<X>) - Method in class Jcg.triangulations3D.FacetHandle
returns the index of v in the current facet.
index(TriangulationDSVertex_3<X>) - Method in class Jcg.triangulations3D.TriangulationDSCell_3
returns the index of vertex v in the cell, and throws an Error if v is no vertex of the cell.
index(TriangulationDSCell_3<X>) - Method in class Jcg.triangulations3D.TriangulationDSCell_3
returns the index of the neighboring cell c, and throws an Error if c is no neighbor of the cell.
index(X) - Method in class Jcg.triangulations3D.TriangulationDSCell_3
returns the index of the vertex of the cell associated with x, and throws an Error if x is associated with no vertex of the cell.
infiniteCell() - Method in class Jcg.triangulations3D.Delaunay_3
returns an infinite cell of the triangulation.
infiniteVertex() - Method in class Jcg.triangulations3D.Delaunay_3
returns an infinite vertex of the triangulation.
init() - Method in class Jcg.viewer.editor2d.Editor2D
 
init() - Method in class Jcg.viewer.j3d.MeshViewer
 
initRenderedObjects() - Method in class Jcg.viewer.editor2d.Canvas2D
Clear all rendered objects (geometric data are not deleted)
innerProduct(Vector_) - Method in interface Jcg.geometry.Vector_
Return the inner product of two vectors
innerProduct(Vector_) - Method in class Jcg.geometry.Vector_2
 
innerProduct(Vector_) - Method in class Jcg.geometry.Vector_3
 
insert(Point_2) - Method in class Jcg.triangulations2D.Delaunay_2
Inserts point p in the Delaunay triangulation and returns the newly created vertex
insert(Point_2, Point_2) - Method in class Jcg.triangulations2D.Delaunay_2
Inserts a constraint edge in the Delaunay triangulation.
insert(Point_2) - Method in class Jcg.triangulations2D.Triangulation_2
Inserts point p in the triangulation and returns the newly created vertex
insert(Point_3, TriangulationDSCell_3<Point_3>) - Method in class Jcg.triangulations3D.Delaunay_3
Inserts point p in the triangulation, using cell cstart to initiate the conflicts zone computation.
insert(Point_3) - Method in class Jcg.triangulations3D.Delaunay_3
Inserts point p in the triangulation, using a random cell to locate p then the output of the locate to compute the conflicts zone of p.
insertAfter(DListNode<X>, X) - Method in class Jcg.util.DLinkedList
Insert a new element after a given node in the list
insertBarycenter(TriangulationDSFace_2<X>) - Method in class Jcg.triangulations2D.TriangulationDS_2
insert in a triangle the barycenter point of its incident vertices
insertBefore(DListNode<X>, X) - Method in class Jcg.util.DLinkedList
Insert a new element before a given node in the list
insertInCell(X, TriangulationDSCell_3<X>) - Method in class Jcg.triangulations3D.TriangulationDS_3
Inserts point p in cell c.
insertInTriangle(X, TriangulationDSFace_2<X>) - Method in class Jcg.triangulations2D.TriangulationDS_2
Inserts point p in face c.
insertOutside(X, TriangulationDSFace_2<X>, int) - Method in class Jcg.triangulations2D.TriangulationDS_2
Inserts point p outside the triangulation.
insertOutside(X, TriangulationDSCell_3<X>, int) - Method in class Jcg.triangulations3D.TriangulationDS_3
Inserts point p outside the triangulation.
intersect(Segment_2, Segment_2) - Static method in class Jcg.geometry.GeometricOperations_2
Deprecated.
Returns approximate intersection between segments
intersect(Segment_2, Ray_2) - Static method in class Jcg.geometry.GeometricOperations_2
Deprecated.
Returns approximate intersection between segment s and ray r
intersect(Segment_2, Segment_2) - Method in class Jcg.geometry.kernel.ApproximateConstructions_2
Returns approximate intersection between segments
intersect(Segment_2, Ray_2) - Method in class Jcg.geometry.kernel.ApproximateConstructions_2
Return approximate intersection between segment s and ray r
intersect(Segment_2, Segment_2) - Method in interface Jcg.geometry.kernel.GeometricConstructions_2
Returns approximate intersection between segments
intersect(Segment_2, Ray_2) - Method in interface Jcg.geometry.kernel.GeometricConstructions_2
Returns approximate intersection between segment s and ray r
invertMark() - Method in class Jcg.triangulations2D.HalfedgeHandle
inverts the mark of the edge (the mark of the opposite edge remains unchanged)
invertMark(int) - Method in class Jcg.triangulations2D.TriangulationDSFace_2
inverts the mark of the index-th edge
IO - Class in Jcg.io
 
IO() - Constructor for class Jcg.io.IO
 
IO - Class in Jcg.mesh
 
IO() - Constructor for class Jcg.mesh.IO
 
isClosed() - Method in class Jcg.polyhedron.Polyhedron_3
returns true if there are no border edges
isCounterClockwise(Point_2, Point_2, Point_2) - Static method in class Jcg.geometry.GeometricOperations_2
Deprecated.
Returns true if a, b and c turn in counter-clockwise direction
isCounterClockwise(Point_2, Point_2, Point_2) - Method in class Jcg.geometry.kernel.ApproximatePredicates_2
Returns true if a, b and c turn in counter-clockwise direction
isCounterClockwise(Point_2, Point_2, Point_2) - Method in class Jcg.geometry.kernel.ExactPredicates_2
Returns true if a, b and c turn in counter-clockwise direction
isCounterClockwise(Point_2, Point_2, Point_2) - Method in class Jcg.geometry.kernel.FilteredPredicates_2
Returns true if a, b and c turn in counter-clockwise direction
isCounterClockwise(Point_2, Point_2, Point_2) - Method in interface Jcg.geometry.kernel.GeometricPredicates_2
Returns true if a, b and c turn in counter-clockwise direction
isDecorated(K) - Method in class Jcg.polyhedron.Decorator
 
isDegenerate() - Method in class Jcg.geometry.Segment_2
segment s is degenerate, if source and target fall together
isDegenerate() - Method in class Jcg.geometry.Segment_3
segment s is degenerate, if source and target fall together
isEmpty() - Method in class Jcg.util.DLinkedList
Check whether the list is empty
isInfinite(Point_2) - Method in class Jcg.triangulations2D.Triangulation_2
Returns true if Point p is infinite, i.e.
isInfinite(TriangulationDSVertex_2<Point_2>) - Method in class Jcg.triangulations2D.Triangulation_2
Returns true if Vertex v is infinite, i.e.
isInfinite(TriangulationDSFace_2<Point_2>) - Method in class Jcg.triangulations2D.Triangulation_2
Returns true if Face f is infinite, i.e.
isInfinite(HalfedgeHandle<Point_2>) - Method in class Jcg.triangulations2D.Triangulation_2
Returns true if Edge e is infinite, i.e.
isInfinite(Point_3) - Method in class Jcg.triangulations3D.Delaunay_3
returns the status of a 3D point: infinite if it is a bounding box vertex, finite otherwise.
isInfinite(TriangulationDSVertex_3) - Method in class Jcg.triangulations3D.Delaunay_3
returns the status of a triangulation vertex: infinite if it is a vertex of the bounding box, finite otherwise.
isInfinite(TriangulationDSCell_3) - Method in class Jcg.triangulations3D.Delaunay_3
returns the status of a triangulation cell: infinite if it is incident to at least one infinite vertex, and finite otherwise.
isInfinite(FacetHandle) - Method in class Jcg.triangulations3D.Delaunay_3
returns the status of a triangulation facet: infinite if it is incident to at least one infinite vertex, and finite otherwise.
isMarked() - Method in class Jcg.triangulations2D.HalfedgeHandle
returns the mark of the edge
isMarked(int) - Method in class Jcg.triangulations2D.TriangulationDSFace_2
returns the mark of the index-th edge
isPureBivalent() - Method in class Jcg.polyhedron.Polyhedron_3
returns true if all vertices have exactly two incident edges
isPureQuad() - Method in class Jcg.polyhedron.Polyhedron_3
true iff the every face is a quadrangle
isPureTriangle() - Method in class Jcg.polyhedron.Polyhedron_3
true iff the every face is a triangle
isPureTrivalent() - Method in class Jcg.polyhedron.Polyhedron_3
returns true if all vertices have exactly three incident edges
isQuad() - Method in class Jcg.polyhedron.Face
true iff the face is a quad
isSelected(String) - Method in class Jcg.io.options.ProcessInputParameters
Check whether a given option has been selected
isTriangle() - Method in class Jcg.polyhedron.Face
true iff the face is a triangle
isTriangle(Halfedge<X>) - Method in class Jcg.polyhedron.Polyhedron_3
true iff the connected component denoted by h is a triangle
isValid(boolean) - Method in class Jcg.polyhedron.Polyhedron_3
returns true if the polyhedral surface is combinatorially consistent.
isValid() - Method in class Jcg.triangulations2D.Triangulation_2
checks the combinatorial validity of the triangulation.
isValid() - Method in class Jcg.triangulations2D.TriangulationDS_2
checks the combinatorial validity of the triangulation.
isValid() - Method in class Jcg.triangulations3D.Delaunay_3
checks the combinatorial validity of the Delaunay triangulation.
isValid() - Method in class Jcg.triangulations3D.TriangulationDS_3
checks the combinatorial validity of the triangulation.
isWellOriented - Variable in class Jcg.schnyderwoods.EdgeOrientation
 
IterativeTutteDrawing<X extends Point_> - Class in Jcg.graph.drawing
Provides methods for drawing graphs in 2D using iterative Tutte barycentric method
IterativeTutteDrawing() - Constructor for class Jcg.graph.drawing.IterativeTutteDrawing
 
IterativeTutteDrawing(ArrayBasedGraph, Point_2[]) - Constructor for class Jcg.graph.drawing.IterativeTutteDrawing
 
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
Skip navigation links