Uses of Interface
Jcg.geometry.Point_

Packages that use Point_

Package	Description
Jcg.geometry
Jcg.graph
Jcg.graph.arraybased
Jcg.graph.arraybased.drawing
Jcg.graph.drawing
Jcg.mesh
Jcg.polyhedron
Jcg.schnyderwoods
Jcg.triangulations2D
Jcg.viewer.old

Uses of Point_ in Jcg.geometry

Classes in Jcg.geometry with type parameters of type Point_

Modifier and Type	Class and Description
class	CoordinateComparator<X extends Point_> Class allowing to compare two points according to a given coordinate
class	PointCloud<X extends Point_> Class representing a collection of points (in arbitrary dimension)
interface	PolyLine_<X extends Point_> Class representing a polyline in arbitrary dimension (ordered sequence of points)

Classes in Jcg.geometry that implement Point_

Modifier and Type	Class and Description
class	Point_2
class	Point_3
class	Point_d Class for representing a point in d-dimensional space

Methods in Jcg.geometry that return Point_

Modifier and Type	Method and Description
abstract X[]	PointCloud.boundingBox() Compute the bounding box (enclosing all points)
Point_	Segment_.source()
Point_	Segment_2.source()
Point_	Segment_3.source()
Point_	Segment_.target()
Point_	Segment_2.target()
Point_	Segment_3.target()
Point_	Transformation_.transform(Point_ p) Compute and return the image of p
Point_	Segment_.vertex(int i)
Point_	Segment_2.vertex(int i)
Point_	Segment_3.vertex(int i)

Methods in Jcg.geometry with parameters of type Point_

Modifier and Type	Method and Description
void	Point_2.barycenter(Point_[] points)
void	Point_d.barycenter(Point_[] points)
void	Point_.barycenter(Point_[] points) Set the current point as the barycenter of an array of points
void	Point_3.barycenter(Point_[] points)
int	Point_2.compareCartesian(Point_ o, int i) Compare the i-th coordinate of two points
int	Point_d.compareCartesian(Point_ o, int i) Compare the i-th coordinate of two points
int	Point_.compareCartesian(Point_ o, int i) Perform the comparison between the i-th coordinate of two points
int	Point_3.compareCartesian(Point_ o, int i) Compare the i-th coordinate of two points
int	Point_2.compareTo(Point_ o) Compare two points (lexicographic order on coordinates)
int	Point_d.compareTo(Point_ o)
int	Point_3.compareTo(Point_ o) Compare two points (lexicographic order on coordinates)
boolean	Segment_2.hasOn(Point_ p) A point is on s, iff it is equal to the source or target of s, or if it is in the interior of s
boolean	Segment_3.hasOn(Point_ p) A point is on s, iff it is equal to the source or target of s, or if it is in the interior of s
void	Point_2.linearCombination(Point_[] points, java.lang.Number[] coefficients)
void	Point_d.linearCombination(Point_[] points, java.lang.Number[] coefficients)
void	Point_.linearCombination(Point_[] points, java.lang.Number[] coefficients) Set the current point a linear combination of an array of points.
void	Point_3.linearCombination(Point_[] points, java.lang.Number[] coefficients)
Vector_	Point_2.minus(Point_ b)
Vector_	Point_d.minus(Point_ b)
Vector_	Point_.minus(Point_ p) Return the vector (p-q), where q is the current point
Vector_	Point_3.minus(Point_ b)
java.lang.Number	Point_2.squareDistance(Point_ p)
java.lang.Number	Point_d.squareDistance(Point_ p)
java.lang.Number	Point_.squareDistance(Point_ p) Return the square distance ||p-q||^2, where q is the current point
java.lang.Number	Point_3.squareDistance(Point_ p)
Point_	Transformation_.transform(Point_ p) Compute and return the image of p

Constructors in Jcg.geometry with parameters of type Point_

Constructor and Description
Point_2(Point_ p)
Point_3(Point_ p)
Point_d(Point_ p)

Uses of Point_ in Jcg.graph

Classes in Jcg.graph with type parameters of type Point_

Modifier and Type	Interface and Description
interface	GeometricGraph<X extends Point_> Implementation of a geometric graph (generic and undirected)

Methods in Jcg.graph that return Point_

Modifier and Type	Method and Description
X[]	GeometricGraph.boundingBox() Compute the bounding box (enclosing the vertices of the graph)

Uses of Point_ in Jcg.graph.arraybased

Method parameters in Jcg.graph.arraybased with type arguments of type Point_

Modifier and Type	Method and Description
static ArrayBasedGraph	ArrayBasedGraphLoader.constructFromPolyhedron(Polyhedron_3<Point_> polyhedron) Construct the graph corresponding to the 1-skeleton of a 3D surface.

Uses of Point_ in Jcg.graph.arraybased.drawing

Classes in Jcg.graph.arraybased.drawing with type parameters of type Point_

Modifier and Type	Class and Description
class	ArrayBasedGraphDrawing<X extends Point_> Provides methods for computing drawings of graphs (using an array based representation of the graph)

Uses of Point_ in Jcg.graph.drawing

Classes in Jcg.graph.drawing with type parameters of type Point_

Modifier and Type	Class and Description
class	BarycentricDrawing<X extends Point_> Provides methods for drawing graphs in 2D using Schnyder barycentic drawing
class	GraphDrawing<X extends Point_> Provides methods for drawing graphs
class	IterativeTutteDrawing<X extends Point_> Provides methods for drawing graphs in 2D using iterative Tutte barycentric method
class	SpectralDrawing_2<X extends Point_> Provides methods for drawing graphs in 2D using spectral based methods
class	SpectralDrawing_3<X extends Point_> Provides methods for drawing graphs in 3D using spectral based methods
class	SphericalDrawing<X extends Point_> Geodesic spherical drawing of a planar graph.
class	SpringDrawing_2<X extends Point_>
class	SpringDrawing_3<X extends Point_>
class	TutteDrawing<X extends Point_>

Constructors in Jcg.graph.drawing with parameters of type Point_

Constructor and Description
BarycentricDrawing(ArrayBasedGraph g, X[] extP, int[] extV, java.lang.Number[][] barCoeff)

Uses of Point_ in Jcg.mesh

Classes in Jcg.mesh with type parameters of type Point_

Modifier and Type	Class and Description
class	MeshBuilder<X extends Point_>

Methods in Jcg.mesh with parameters of type Point_

Modifier and Type	Method and Description
Polyhedron_3<X>	MeshBuilder.createMesh(X[] points, int[] faceDegrees, int[][] faces) 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

Uses of Point_ in Jcg.polyhedron

Classes in Jcg.polyhedron with type parameters of type Point_

Modifier and Type	Class and Description
class	Face<X extends Point_>
class	Halfedge<X extends Point_> Class for representing half-edges
class	Polyhedron_3<X extends Point_> Half-Edge data structure for polyhedral meshes (allowing to represent planar and surface orientable meshes)
class	Vertex<X extends Point_>

Uses of Point_ in Jcg.schnyderwoods

Fields in Jcg.schnyderwoods with type parameters of type Point_

Modifier and Type	Field and Description
Polyhedron_3<Point_>	EdgeOrientation.polyhedron
Halfedge<Point_>	PlanarTriSchnyderWood.rootEdge half-edge (v_0, v_1) oriented toward v_1, assuming the ccw orientation of faces
Vertex<Point_>	PlanarTriSchnyderWood.v0
Vertex<Point_>	PlanarTriSchnyderWood.v1
Vertex<Point_>	PlanarTriSchnyderWood.v2

Methods in Jcg.schnyderwoods that return types with arguments of type Point_

Modifier and Type	Method and Description
Halfedge<Point_>	PlanarTriSchnyderWood.getFirstIncomingRedEdge(Vertex<Point_> v) Return the first (half)edge oriented toward vertex v and having color 0 (red) Edges (v0, v1) and (v2, v0) are assumed to be red colored Return null, if such an edge does not exist
Halfedge<Point_>	PlanarTriSchnyderWood.getNextIncomingRedEdge(Halfedge<Point_> e) Return the next edge of color 0, after edge e (turning in ccw direction), oriented toward its target vertex (denoted by v).
DListNode<Halfedge<Point_>>	PlanarTriSchnyderWood.vertexRemoval(DListNode<Halfedge<Point_>> node) It removes a vertex from the cut-border (vertex conquest) It updates the cut-border, assigning color and orientation to edges

Method parameters in Jcg.schnyderwoods with type arguments of type Point_

Modifier and Type	Method and Description
void	PlanarTriSchnyderWood.addToCutBorder(Halfedge<Point_> e, DListNode<Halfedge<Point_>> node) Add a half-edge to the cut-border, at a given position (in the cut-border) Update all concerned information (colors, existent chords, boundary vertices, ...)
void	PlanarTriSchnyderWood.addToCutBorder(Halfedge<Point_> e, DListNode<Halfedge<Point_>> node) Add a half-edge to the cut-border, at a given position (in the cut-border) Update all concerned information (colors, existent chords, boundary vertices, ...)
Halfedge<Point_>	PlanarTriSchnyderWood.getFirstIncomingRedEdge(Vertex<Point_> v) Return the first (half)edge oriented toward vertex v and having color 0 (red) Edges (v0, v1) and (v2, v0) are assumed to be red colored Return null, if such an edge does not exist
Halfedge<Point_>	PlanarTriSchnyderWood.getNextIncomingRedEdge(Halfedge<Point_> e) Return the next edge of color 0, after edge e (turning in ccw direction), oriented toward its target vertex (denoted by v).
void	PlanarTriSchnyderWood.setToCutBorder(Halfedge<Point_> e) Add a half-edge to the cut-border, at a given position (in the cut-border) Update all concerned information (colors, existent chords, boundary vertices, ...)
DListNode<Halfedge<Point_>>	PlanarTriSchnyderWood.vertexRemoval(DListNode<Halfedge<Point_>> node) It removes a vertex from the cut-border (vertex conquest) It updates the cut-border, assigning color and orientation to edges

Constructor parameters in Jcg.schnyderwoods with type arguments of type Point_

Constructor and Description
PlanarTriSchnyderWood(Polyhedron_3<Point_> polyhedron, Halfedge<Point_> rootEdge) Construct the cut-border starting from the root edge (v0, v1) At the beginning the cut-border contains edges (v2, v0) and (v1, v2) Edges are ccw oriented around faces
PlanarTriSchnyderWood(Polyhedron_3<Point_> polyhedron, Halfedge<Point_> rootEdge) Construct the cut-border starting from the root edge (v0, v1) At the beginning the cut-border contains edges (v2, v0) and (v1, v2) Edges are ccw oriented around faces

Uses of Point_ in Jcg.triangulations2D

Classes in Jcg.triangulations2D with type parameters of type Point_

Modifier and Type	Class and Description
class	HalfedgeHandle<X extends Point_> A dummy class used to represent a triangulation edge as a pair (TriangulationDSFace_2, int).
class	TriangulationDS_2<X extends Point_> Data structure for representing 2D triangulations that uses the standard face/vertex encoding, represented by classes TriangulationDSFace_2 and TriangulationDSVertex_2 respectively.
class	TriangulationDSFace_2<X extends Point_> The class used to encode a face of a triangulation.
class	TriangulationDSVertex_2<X extends Point_> The class used to encode a vertex of a triangulation.

Methods in Jcg.triangulations2D that return Point_

Modifier and Type	Method and Description
Point_[]	TriangulationDSFace_2.verticesPoints() returns an array containing the geometric points associated with the vertices of the triangle

Constructors in Jcg.triangulations2D with parameters of type Point_

Constructor and Description
TriangulationDS_2(X[] points, int[][] neighbors) Create a triangulation DS from a vertex shared mesh representation It takes linear space and linear time.

Uses of Point_ in Jcg.viewer.old

Method parameters in Jcg.viewer.old with type arguments of type Point_

Modifier and Type	Method and Description
void	Fenetre.addGenericPoints(java.util.Collection<Point_> points) Add a collection of (generic) points