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

I

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
index - Variable in class Jcg.polyhedron.Halfedge
 
index - Variable in class Jcg.polyhedron.Vertex
 
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
 
insertAfter(DListNode<X>, X) - Method in class Jcg.util.DLinkedList
Insert a new element after a given node in the list
insertBefore(DListNode<X>, X) - Method in class Jcg.util.DLinkedList
Insert a new element before a given node in the list
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
IO - Class in Jcg.io
 
IO() - Constructor for class Jcg.io.IO
 
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
isEdge(int) - Method in class compactTriangulations.CompactTriangleMesh_6nNew
Check whether an edge e=(u, color) is valid (useful for checking correctness of the data structure)
isEmpty() - Method in class arrays.ArrayBasedStack
Check whether the stack is empty
isEmpty() - Method in class arrays.ColumnArrayBasedStack
Check whether the stack is empty
isEmpty() - Method in interface arrays.StackInterface
Check whether the stack is empty
isEmpty() - Method in class Jcg.util.DLinkedList
Check whether the list is empty
isOutgoing(int, int) - Method in class arraybasedDS.ArrayBasedWingededge
Check whether edge e is outgoing from vertex v
isOutgoing(int, int) - Method in interface arraybasedDS.WingededgeInterface
Check whether edge e is outgoing from vertex v
isOutgoing(int, int) - Method in class compactTriangulations.CompactTriangleMesh
Check whether the edge 'e' is outgoing from vertex 'v'
isOutgoing(int, int) - Method in class compactTriangulations.CompactTriangleMesh_4n
Check whether edge e is outgoing from vertex v
isOutgoing(int, int) - Method in class compactTriangulations.CompactTriangleMesh_5n
Check whether edge e is outgoing from vertex v
isOutgoing(int, int) - Method in class compactTriangulations.CompactTriangleMesh_6n
Check whether edge e is outgoing from vertex v
isOutgoing(int, int) - Method in class compactTriangulations.CompactTriangleMesh_6nNew
Check whether the edge 'e' is outgoing from vertex 'v'
isPureBivalent() - Method in class Jcg.polyhedron.Polyhedron_3
returns true if all vertices have exactly two incident edges
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
isSelected(String) - Method in class Jcg.io.options.ProcessInputParameters
Check whether a given option has been selected
isValid(boolean) - Method in class Jcg.polyhedron.Polyhedron_3
returns true if the polyhedral surface is combinatorially consistent.
isWellOriented - Variable in class Jcg.schnyderwoods.EdgeOrientation
 
A B C D E F G H I J L M N O P Q R S T V W X Y Z 
Skip navigation links