Uses of Interface
Jcg.geometry.Point_

Packages that use Point_

Package	Description
Jcg.geometry
Jcg.mesh
Jcg.polyhedron
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	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	Description
class	GridPoint_2	A class for representing a 2D point on an integer grid.
class	Point_2	A class for representing a 2D point with real coordinates.
class	Point_3
class	Point_d	Class for representing a point in d-dimensional space R^d
class	RationalPoint_2	A class for representing a 2D points with rational coordinates

Subinterfaces with type arguments of type Point_ in Jcg.geometry

Modifier and Type	Interface	Description
interface	Point_	An interface defining geometric primitives and operations on points in euclidean space

Methods in Jcg.geometry that return Point_

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

Methods in Jcg.geometry with parameters of type Point_

Modifier and Type	Method	Description
void	GridPoint_2.barycenter(Point_[] points)	Set the current point as the barycenter of an array of points
void	Point_.barycenter(Point_[] points)	Set the current point as the barycenter of an array of points
void	Point_2.barycenter(Point_[] points)	Set the current point as the barycenter of an array of points
void	Point_3.barycenter(Point_[] points)	Set the current point as the barycenter of an array of points
void	Point_d.barycenter(Point_[] points)
void	RationalPoint_2.barycenter(Point_[] points)	Set the current point as the barycenter of an array of points
int	GridPoint_2.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_2.compareCartesian(Point_ o, int i)	Compare 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_d.compareCartesian(Point_ o, int i)	Compare the i-th coordinate of two points
int	RationalPoint_2.compareCartesian(Point_ o, int i)	Compare the i-th coordinate of two points
int	GridPoint_2.compareTo(Point_ q)	Compare two points (lexicographic order on coordinates)
int	Point_2.compareTo(Point_ o)	Compare two points (lexicographic order on coordinates)
int	Point_3.compareTo(Point_ o)	Compare two points (lexicographic order on coordinates)
int	Point_d.compareTo(Point_ o)
int	RationalPoint_2.compareTo(Point_ q)	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	GridPoint_2.linearCombination(Point_[] points, Number[] coefficients)	Set the current point to be the linear combination of the input points, with respect to the given input coefficients
void	Point_.linearCombination(Point_[] points, Number[] coefficients)	Set the current point a linear combination of an array of points.
void	Point_2.linearCombination(Point_[] points, Number[] coefficients)
void	Point_3.linearCombination(Point_[] points, Number[] coefficients)
void	Point_d.linearCombination(Point_[] points, Number[] coefficients)
void	RationalPoint_2.linearCombination(Point_[] points, Number[] coefficients)	Set the current point to be the linear combination of the input points, with respect to the given input coefficients
GridVector_2	GridPoint_2.minus(Point_ q)	Return the integer grid vector (p-q), where q is the current point Warning: q is assumed to be an integer GridPoint_2
Vector_	Point_.minus(Point_ p)	Return the vector (p-q), where q is the current point
Vector_2	Point_2.minus(Point_ b)
Vector_	Point_3.minus(Point_ b)
Vector_	Point_d.minus(Point_ b)
Vector_	RationalPoint_2.minus(Point_ q)	Return the integer grid vector (p-q), where q is the current point Warning: q is assumed to be an integer GridPoint_2
Integer	GridPoint_2.squareDistance(Point_ p)	Return the square of the Euclidean distance between the current point 'this' and a point p
Number	Point_.squareDistance(Point_ p)	Return the square distance ||p-q||^2, where q is the current point
Number	Point_2.squareDistance(Point_ p)
Number	Point_3.squareDistance(Point_ p)
Number	Point_d.squareDistance(Point_ p)
Rational	RationalPoint_2.squareDistance(Point_ o)	Return the square of the Euclidean distance between the current point 'this' and a point o

Constructors in Jcg.geometry with parameters of type Point_

Modifier	Constructor	Description
	Point_2(Point_ p)	Initialize a 2D point having real coordinates (0.0, 0.0).
	Point_3(Point_ p)
	Point_d(Point_ p)
	RationalPoint_2(Point_ p)	Make a copy of the input point p Warning: p must be a Rational_2 point

Uses of Point_ in Jcg.mesh

Classes in Jcg.mesh with type parameters of type Point_

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

Methods in Jcg.mesh with parameters of type Point_

Modifier and Type	Method	Description
Polyhedron_3<X>	MeshBuilder.createMesh(X[] points, int[] faceDegrees, int[][] faces)	Efficient construction of a Polyhedron (Half-edge DS) for a surface mesh (from a share vertex representation) Remark: it works for arbitrary polygonal meshes,possibly having boundaries
(package private) Polyhedron_3<X>	MeshBuilder.createMeshOld(X[] points, int[] faceDegrees, int[][] faces)	Efficient construction of a polyhedral mesh (Half-edge DS) (from a share vertex representation)

Uses of Point_ in Jcg.polyhedron

Classes in Jcg.polyhedron with type parameters of type Point_

Modifier and Type	Class	Description
class	Face<X extends Point_>	A class representing a face of a polyhedral (surface or planar) mesh (Half-edge data structure)
class	Halfedge<X extends Point_>	Class for representing half-edges (half-edge representation of a surface mesh)
class	Polyhedron_3<X extends Point_>	Pointer-based implementation of the Half-edge data structure for polyhedral meshes (for representing planar and surface orientable meshes).
class	Vertex<X extends Point_>

Fields in Jcg.polyhedron declared as Point_

Modifier and Type	Field	Description
(package private) X	Vertex.point

Methods in Jcg.polyhedron that return Point_

Modifier and Type	Method	Description
Point_	Face.getBarycenter()	Compute and return the barycenter (2d or 3d) of the vertices of the face
Point_[]	Face.getVertexCoordinates()	Return an array storing the geometric coordinates of the vertices of the face

Uses of Point_ in Jcg.triangulations2D

Classes in Jcg.triangulations2D with type parameters of type Point_

Modifier and Type	Class	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 represents a vertex of a 2D triangulation.

Fields in Jcg.triangulations2D declared as Point_

Modifier and Type	Field	Description
X	TriangulationDSVertex_2.point	Geometric coordinates of the vertex

Methods in Jcg.triangulations2D that return Point_

Modifier and Type	Method	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_

Modifier	Constructor	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	Description
void	Fenetre.addGenericPoints(Collection<Point_> points)	Add a collection of (generic) points