| Modifier and Type | Method and Description | 
|---|---|
| PointPair_2 | ClosestPair. findClosestPair(Point_2[] points)Compute the closest pair of a set of points in the plane | 
| PointPair_2 | SlowClosestPair. findClosestPair(Point_2[] points) | 
| Constructor and Description | 
|---|
| PointPair_2(Point_2 a,
           Point_2 b)Construct a pair of points | 
| Modifier and Type | Method and Description | 
|---|---|
| java.util.ArrayList<Point_2> | AndrewConvexHull. computeLowerHull(java.util.ArrayList<Point_2> sortedPoints) | 
| java.util.ArrayList<Point_2> | AndrewConvexHull. computeUpperHull(java.util.ArrayList<Point_2> sortedPoints) | 
| Modifier and Type | Method and Description | 
|---|---|
| java.util.ArrayList<Point_2> | AndrewConvexHull. computeLowerHull(java.util.ArrayList<Point_2> sortedPoints) | 
| java.util.ArrayList<Point_2> | AndrewConvexHull. computeUpperHull(java.util.ArrayList<Point_2> sortedPoints) | 
| Modifier and Type | Field and Description | 
|---|---|
| Point_2 | Segment_2. p | 
| Point_2 | Segment_2. q | 
| Modifier and Type | Method and Description | 
|---|---|
| Point_2[] | PointCloud_2. boundingBox()Compute the bounding box (enclosing all points) | 
| static Point_2 | GeometricOperations_2. circumCenter(Point_2 p0,
            Point_2 p1,
            Point_2 p2)Deprecated.  Returns the (approximate) circumcenter of input triangle | 
| static Point_2 | GeometricOperations_2. intersect(Segment_2 s,
         Ray_2 r)Deprecated.  Returns approximate intersection between segment s and ray r | 
| static Point_2 | GeometricOperations_2. intersect(Segment_2 s,
         Segment_2 t)Deprecated.  Returns approximate intersection between segments | 
| static Point_2 | Point_2. linearCombination(Point_2[] points,
                 java.lang.Number[] coefficients) | 
| Point_2 | PointCloud_2. max(int d)Return the point with greatest coordinate value (in direction d) | 
| static Point_2 | Point_2. midPoint(Point_2 p,
        Point_2 q) | 
| static Point_2 | MesherOperations. midpointOnUnitCircle(Point_2[] e)Computes the points of the bisector of edge e that lie on 
 the unit circle, and returns the one closest to e | 
| Point_2 | PointCloud_2. min(int d)Return the point with smallest coordinate value (in direction d) | 
| Point_2 | Ray_2. source() | 
| Point_2 | Point_2. sum(Vector_ v) | 
| Point_2 | Transformation_2. transform(Point_2 p)Apply the transformation to point p (given in cartesian coordinates) | 
| Modifier and Type | Method and Description | 
|---|---|
| void | PolyLine_2. addFirst(Point_2 p) | 
| void | PolyLine_2. addLast(Point_2 p) | 
| static Point_2 | GeometricOperations_2. circumCenter(Point_2 p0,
            Point_2 p1,
            Point_2 p2)Deprecated.  Returns the (approximate) circumcenter of input triangle | 
| static boolean | GeometricOperations_2. collinear(Point_2 a,
         Point_2 b,
         Point_2 c)Deprecated.  Returns true if a, b and c lie on a same line | 
| java.lang.Number | Point_2. distanceFrom(Point_2 p) | 
| static java.lang.Number | GeometricOperations_2. distanceToSegment(Point_2 ps,
                 Point_2 pe,
                 Point_2 p)Deprecated.  Returns the distance (non exact computation) of a point to a segment | 
| static boolean | MesherOperations. encroachesEdge(Point_2 p,
              Point_2[] e)Tests whether point p lies in the diametral circle of edge e | 
| static boolean | MesherOperations. encroachesEdge(Point_2 p,
              Point_2[] e)Tests whether point p lies in the diametral circle of edge e | 
| boolean | Line_2. hasOn(Point_2 p) | 
| boolean | Line_2. hasOnNegativeSide(Point_2 p) | 
| boolean | Line_2. hasOnPositiveSide(Point_2 p) | 
| static boolean | GeometricOperations_2. inCircle(Point_2 p,
        Point_2 a,
        Point_2 b,
        Point_2 c)Deprecated.  Tests if point p lies inside the circumcircle of triangle a,b,c | 
| static boolean | GeometricOperations_2. isCounterClockwise(Point_2 a,
                  Point_2 b,
                  Point_2 c)Deprecated.  Returns true if a, b and c turn in counter-clockwise direction | 
| static boolean | GeometricOperations_2. liesOn(Point_2 p,
      Point_2 a,
      Point_2 b)Deprecated.  Returns true if point p lies on segment ab | 
| static Point_2 | Point_2. linearCombination(Point_2[] points,
                 java.lang.Number[] coefficients) | 
| static Point_2 | Point_2. midPoint(Point_2 p,
        Point_2 q) | 
| static Point_2 | MesherOperations. midpointOnUnitCircle(Point_2[] e)Computes the points of the bisector of edge e that lie on 
 the unit circle, and returns the one closest to e | 
| static int | GeometricOperations_2. orientation(Point_2 a,
           Point_2 b,
           Point_2 c)Deprecated.  Returns the orientation of a, b and c | 
| Point_2 | Transformation_2. transform(Point_2 p)Apply the transformation to point p (given in cartesian coordinates) | 
| Constructor and Description | 
|---|
| Ray_2(Point_2 p,
     Vector_2 v) | 
| Segment_2(Point_2 p,
         Point_2 q) | 
| Vector_2(Point_2 a,
        Point_2 b) | 
| Constructor and Description | 
|---|
| PointCloud_2(java.util.ArrayList<Point_2> points)Create a new point cloud (a copy) from a collection of points | 
| PolyLine_2(java.util.ArrayList<Point_2> points)Create a new polyline (a copy of the list is created) from a collection of points | 
| Modifier and Type | Method and Description | 
|---|---|
| Point_2 | GeometricConstructions_2. circumCenter(Point_2 p0,
            Point_2 p1,
            Point_2 p2)Returns the (approximate) circumcenter of input triangle | 
| Point_2 | ApproximateConstructions_2. circumCenter(Point_2 p0,
            Point_2 p1,
            Point_2 p2)Returns the (approximate) circumcenter of input triangle | 
| Point_2 | GeometricConstructions_2. intersect(Segment_2 s,
         Ray_2 r)Returns approximate intersection between segment s and ray r | 
| Point_2 | ApproximateConstructions_2. intersect(Segment_2 s,
         Ray_2 r)Return approximate intersection between segment s and ray r | 
| Point_2 | GeometricConstructions_2. intersect(Segment_2 s,
         Segment_2 t)Returns approximate intersection between segments | 
| Point_2 | ApproximateConstructions_2. intersect(Segment_2 s,
         Segment_2 t)Returns approximate intersection between segments | 
| Modifier and Type | Method and Description | 
|---|---|
| Point_2 | GeometricConstructions_2. circumCenter(Point_2 p0,
            Point_2 p1,
            Point_2 p2)Returns the (approximate) circumcenter of input triangle | 
| Point_2 | ApproximateConstructions_2. circumCenter(Point_2 p0,
            Point_2 p1,
            Point_2 p2)Returns the (approximate) circumcenter of input triangle | 
| boolean | GeometricPredicates_2. collinear(Point_2 a,
         Point_2 b,
         Point_2 c)Returns true if a, b and c lie on a same line | 
| boolean | ExactPredicates_2. collinear(Point_2 a,
         Point_2 b,
         Point_2 c)Returns true if a, b and c lie on a same line | 
| boolean | ApproximatePredicates_2. collinear(Point_2 a,
         Point_2 b,
         Point_2 c)Returns true if a, b and c lie on a same line | 
| boolean | FilteredPredicates_2. collinear(Point_2 a,
         Point_2 b,
         Point_2 c)Returns true if a, b and c lie on a same line | 
| java.lang.Number | GeometricConstructions_2. distanceToSegment(Point_2 ps,
                 Point_2 pe,
                 Point_2 p)Returns the distance (non exact computation) of a point to a segment | 
| java.lang.Number | ApproximateConstructions_2. distanceToSegment(Point_2 ps,
                 Point_2 pe,
                 Point_2 p)Returns the distance (non exact computation) of a point to a segment | 
| boolean | GeometricPredicates_2. inCircle(Point_2 p,
        Point_2 a,
        Point_2 b,
        Point_2 c)Tests if point p lies inside the circumcircle of triangle a,b,c | 
| boolean | ExactPredicates_2. inCircle(Point_2 p,
        Point_2 a,
        Point_2 b,
        Point_2 c)Tests if point p lies inside the circumcircle of triangle a,b,c | 
| boolean | ApproximatePredicates_2. inCircle(Point_2 p,
        Point_2 a,
        Point_2 b,
        Point_2 c)Tests if point p lies inside the circumcircle of triangle a,b,c | 
| boolean | FilteredPredicates_2. inCircle(Point_2 p,
        Point_2 a,
        Point_2 b,
        Point_2 c)Tests if point p lies inside the circumcircle of triangle a,b,c | 
| boolean | GeometricPredicates_2. isCounterClockwise(Point_2 a,
                  Point_2 b,
                  Point_2 c)Returns true if a, b and c turn in counter-clockwise direction | 
| boolean | ExactPredicates_2. isCounterClockwise(Point_2 a,
                  Point_2 b,
                  Point_2 c)Returns true if a, b and c turn in counter-clockwise direction | 
| boolean | ApproximatePredicates_2. isCounterClockwise(Point_2 a,
                  Point_2 b,
                  Point_2 c)Returns true if a, b and c turn in counter-clockwise direction | 
| boolean | FilteredPredicates_2. isCounterClockwise(Point_2 a,
                  Point_2 b,
                  Point_2 c)Returns true if a, b and c turn in counter-clockwise direction | 
| boolean | GeometricPredicates_2. liesOn(Point_2 p,
      Point_2 a,
      Point_2 b)Returns true if point p lies on segment ab | 
| boolean | ExactPredicates_2. liesOn(Point_2 p,
      Point_2 a,
      Point_2 b)Returns true if point p lies on segment ab | 
| boolean | ApproximatePredicates_2. liesOn(Point_2 p,
      Point_2 a,
      Point_2 b)Returns true if point p lies on segment ab | 
| boolean | FilteredPredicates_2. liesOn(Point_2 p,
      Point_2 a,
      Point_2 b)Returns true if point p lies on segment ab | 
| int | GeometricPredicates_2. orientation(Point_2 a,
           Point_2 b,
           Point_2 c)Returns the orientation of a, b and c | 
| int | ExactPredicates_2. orientation(Point_2 a,
           Point_2 b,
           Point_2 c)Returns the orientation of a, b and c | 
| int | ApproximatePredicates_2. orientation(Point_2 a,
           Point_2 b,
           Point_2 c)Returns the orientation of a, b and c | 
| int | FilteredPredicates_2. orientation(Point_2 a,
           Point_2 b,
           Point_2 c)Returns the orientation of a, b and c | 
| Modifier and Type | Method and Description | 
|---|---|
| Point_2[] | GeometricGraph_2. boundingBox()compute and return the bounding box for the points set. | 
| Point_2 | GeometricGraph_2. getPoint(Node<Point_2> v)Return the geometric coordinates of a vertex | 
| Point_2[] | GeometricGraph_2. getSegment(Node<Point_2> u,
          Node<Point_2> v)Return the straight-line segment having as extremities two given vertices of the graph | 
| Modifier and Type | Method and Description | 
|---|---|
| java.util.ArrayList<Point_2> | GeometricGraph_2. listOfPoints()Return the list of vertex points of the graph | 
| Modifier and Type | Method and Description | 
|---|---|
| void | GeometricGraph_2. addNode(Point_2 p)Add a new vertex to the graph (with its geometric coordinates) | 
| void | GeometricGraph_2. setPoint(Node<Point_2> v,
        Point_2 p)Set the geometric coordinates of a vertex | 
| Modifier and Type | Method and Description | 
|---|---|
| static GeometricGraph_2 | GraphBuilder. getGraphFrom2DTriangulation(java.util.List<Point_2> vertices,
                           java.util.List<Point_2[]> faces)Construct the graph corresponding to a 2D triangulation. | 
| Point_2 | GeometricGraph_2. getPoint(Node<Point_2> v)Return the geometric coordinates of a vertex | 
| Point_2[] | GeometricGraph_2. getSegment(Node<Point_2> u,
          Node<Point_2> v)Return the straight-line segment having as extremities two given vertices of the graph | 
| Point_2[] | GeometricGraph_2. getSegment(Node<Point_2> u,
          Node<Point_2> v)Return the straight-line segment having as extremities two given vertices of the graph | 
| void | GeometricGraph_2. setPoint(Node<Point_2> v,
        Point_2 p)Set the geometric coordinates of a vertex | 
| Modifier and Type | Method and Description | 
|---|---|
| Point_2 | ArrayBasedGraphDrawing. getPoint2(int i) | 
| Modifier and Type | Method and Description | 
|---|---|
| Point_2 | SpectralDrawing_2. computeCoordinates_2(int i,
                    double[] eigenvalues,
                    double[][] eigenvectors) | 
| Point_2 | GraphDrawing. getPoint2(int i) | 
| Constructor and Description | 
|---|
| IterativeTutteDrawing(ArrayBasedGraph g,
                     Point_2[] exteriorPoints) | 
| TutteDrawing(ArrayBasedGraph g,
            Point_2[] exteriorPoints) | 
| Modifier and Type | Field and Description | 
|---|---|
| Polyhedron_3<Point_2> | RandomSamplingTriangulations. poly | 
| Modifier and Type | Method and Description | 
|---|---|
| static Point_2[] | MeshBuilder. Point3DToPoint2D(Point_3[] points)Convert an array of 3D points to an array of 2D points (by orthogonal projection on the z=0 hyperplane) | 
| Modifier and Type | Method and Description | 
|---|---|
| static Polyhedron_3<Point_2> | MeshLoader. getPlanarMesh(java.lang.String filename)Load a planar mesh embedded in 2D (Polyhedron_3 | 
| static TriangulationDS_2<Point_2> | Triangulations_IO. getPlaneTriangulationFromFile(java.lang.String filename)Create a Triangle Data Structure for a given plane triangulation (from a file). | 
| static Polyhedron_3<Point_2> | MeshLoader. getRandomPlanarTriangulation(int n)Generating a random planar triangulation of size n+2 (with uniform distribution) | 
| Modifier and Type | Method and Description | 
|---|---|
| static java.util.Collection<Point_2[]> | Triangulations_IO. getTriangles(TriangulationDS_2<Point_2> mesh)Return the (geometric) triangles of a 2D triangulation (useful for 2D rendering) | 
| static void | Triangulations_IO. writeToFile(java.util.Collection<Point_2> vertices,
           java.util.Collection<Point_2[]> faces,
           java.lang.String filename)Output triangulation (edges or triangles) to OFF file | 
| Modifier and Type | Method and Description | 
|---|---|
| Halfedge<Point_2> | PlanarPointLocation. locatePoint(Polyhedron_3<Point_2> triangulation,
           Point_2 queryPoint)Compute and return the face (an incident half-edge) containing the query point | 
| Modifier and Type | Method and Description | 
|---|---|
| Halfedge<Point_2> | PlanarPointLocation. locatePoint(Polyhedron_3<Point_2> triangulation,
           Point_2 queryPoint)Compute and return the face (an incident half-edge) containing the query point | 
| Modifier and Type | Method and Description | 
|---|---|
| Halfedge<Point_2> | PlanarPointLocation. locatePoint(Polyhedron_3<Point_2> triangulation,
           Point_2 queryPoint)Compute and return the face (an incident half-edge) containing the query point | 
| Modifier and Type | Method and Description | 
|---|---|
| Point_2 | QuadEdge. dest()Returns the destination vertex of the QuadEdge. | 
| Point_2 | Delaunay_2. dual(TriangulationDSFace_2<Point_2> f)Outputs the Voronoi vertex dual to face f. | 
| Point_2 | QuadEdge. orig()Returns the origin vertex of the QuadEdge. | 
| Modifier and Type | Method and Description | 
|---|---|
| java.util.Collection<HalfedgeHandle<Point_2>> | Delaunay_2. constraintEdges()Computes and returns the list of constraint edges. | 
| java.util.Collection<HalfedgeHandle<Point_2>> | Triangulation_2. convexHullEdges()Computes and returns the collection of all edges on the convex hull (collects only one HalfedgeHandle per geometric edge). | 
| java.util.Collection<HalfedgeHandle<Point_2>> | Triangulation_2. finiteEdges()Computes and returns the collection of all finite edges in the triangulation 
  (that is, all edges connecting vertices in the interior of the bounding box). | 
| java.util.Collection<TriangulationDSFace_2<Point_2>> | Triangulation_2. finiteFaces()Computes and returns the collection of all finite faces of the triangulation 
  (that is, faces lying in the interior of the bounding box). | 
| java.util.Collection<TriangulationDSVertex_2<Point_2>> | Triangulation_2. finiteVertices()Computes and returns the collection of all finite vertices of the triangulation 
  (that is, vertices lying in the interior of the bounding box). | 
| TriangulationDSVertex_2<Point_2> | Triangulation_2. insert(Point_2 p)Inserts point p in the triangulation and returns the newly created vertex | 
| TriangulationDSVertex_2<Point_2> | Delaunay_2. insert(Point_2 p)Inserts point p in the Delaunay triangulation and returns the newly created vertex | 
| HalfedgeHandle<Point_2> | Delaunay_2. insert(Point_2 p,
      Point_2 q)Inserts a constraint edge in the Delaunay triangulation. | 
| TriangulationDSFace_2<Point_2> | Triangulation_2. locate(Point_2 p)Locates point p in the triangulation and returns a triangle containing p. | 
| Modifier and Type | Method and Description | 
|---|---|
| TriangulationDSVertex_2<Point_2> | Triangulation_2. insert(Point_2 p)Inserts point p in the triangulation and returns the newly created vertex | 
| TriangulationDSVertex_2<Point_2> | Delaunay_2. insert(Point_2 p)Inserts point p in the Delaunay triangulation and returns the newly created vertex | 
| HalfedgeHandle<Point_2> | Delaunay_2. insert(Point_2 p,
      Point_2 q)Inserts a constraint edge in the Delaunay triangulation. | 
| boolean | Triangulation_2. isInfinite(Point_2 p)Returns true if Point p is infinite, i.e. | 
| TriangulationDSFace_2<Point_2> | Triangulation_2. locate(Point_2 p)Locates point p in the triangulation and returns a triangle containing p. | 
| static QuadEdge | QuadEdge. makeEdge(Point_2 orig,
        Point_2 dest)Creates a new QuadEdge, setting next and dual fields to default null values. | 
| void | QuadEdge. setOrig(Point_2 p)Sets origin vertex of QuadEdge. | 
| Modifier and Type | Method and Description | 
|---|---|
| Point_2 | Delaunay_2. dual(TriangulationDSFace_2<Point_2> f)Outputs the Voronoi vertex dual to face f. | 
| boolean | Triangulation_2. isInfinite(HalfedgeHandle<Point_2> e)Returns true if Edge e is infinite, i.e. | 
| boolean | Triangulation_2. isInfinite(TriangulationDSFace_2<Point_2> f)Returns true if Face f is infinite, i.e. | 
| boolean | Triangulation_2. isInfinite(TriangulationDSVertex_2<Point_2> v)Returns true if Vertex v is infinite, i.e. | 
| Constructor and Description | 
|---|
| Delaunay_2(Point_2 a,
          Point_2 b,
          Point_2 c) | 
| Triangulation_2(Point_2 a,
               Point_2 b,
               Point_2 c)Constuctor: builds a triangulation consisting of a triangle. | 
| Modifier and Type | Method and Description | 
|---|---|
| Point_2[] | Draw2D. computeBoundingBox()Compute the scale factor (depending on the max distance of the point set) | 
| Modifier and Type | Method and Description | 
|---|---|
| void | Draw2D. drawBoundingBox(Point_2[] box)Draw a bounding box (a rectangle) | 
| abstract void | Draw2D. drawPoint(Point_2 p)Draw a vertex | 
| abstract void | Draw2D. drawSegment(Point_2 p,
           Point_2 q)Draw a segment between two points | 
| abstract void | Draw2D. resize(Point_2 leftBottom,
      Point_2 rightTop)Resize the frame according to the window coordinates
 Input points are the left bottom and right top points of the window | 
| Modifier and Type | Field and Description | 
|---|---|
| Point_2 | Canvas2D. p1 | 
| Point_2 | Canvas2D. p2 | 
| Modifier and Type | Field and Description | 
|---|---|
| Polyhedron_3<Point_2> | Canvas2D. mesh | 
| Modifier and Type | Method and Description | 
|---|---|
| Point_2 | Draw. getPoint(int i,
        int j)Return a point corresponding to a given position in the window
 The input are the integer coordinates of the pixel | 
| Modifier and Type | Method and Description | 
|---|---|
| static Node<Point_2> | Canvas2D. findClosestVertex(GeometricGraph_2 graph,
                 Point_2 p,
                 double epsilon)Return the list of vertices which are at distance at most epsilon from point p | 
| static java.util.Collection<Node<Point_2>> | Canvas2D. findCloseVertices(GeometricGraph_2 graph,
                 Point_2 p,
                 double epsilon)Return the list of vertices which are at distance at most epsilon from point p | 
| Modifier and Type | Method and Description | 
|---|---|
| void | Canvas2D. addLabel(Point_2 p,
        java.lang.String label) | 
| void | Canvas2D. addPoint(Point_2 p) | 
| void | Canvas2D. addSegment(Point_2 p,
          Point_2 q) | 
| void | Canvas2D. addSegment(Point_2 p,
          Point_2 q,
          java.awt.Color c) | 
| void | Draw. drawArrow(Point_2 u,
         Point_2 v,
         java.awt.Color arrowColor) | 
| void | Draw. drawCircle(Point_2 v,
          int r,
          java.awt.Color c)Draw a circle, with a given color and size | 
| void | Draw. drawLabel(Point_2 v,
         java.lang.String label) | 
| void | Draw. drawPoint(Point_2 v)Draw a point in the window (as a small circle) | 
| void | Draw. drawSegment(Point_2 p,
           Point_2 q) | 
| void | Draw. drawSegment(Point_2 p,
           Point_2 q,
           java.awt.Color c) | 
| void | Draw. drawTinyPoint(Point_2 v)Draw a point in the window (as a small circle) | 
| void | Draw. fillTriangle(Point_2 p1,
            Point_2 p2,
            Point_2 p3,
            java.awt.Color triangle) | 
| static Node<Point_2> | Canvas2D. findClosestVertex(GeometricGraph_2 graph,
                 Point_2 p,
                 double epsilon)Return the list of vertices which are at distance at most epsilon from point p | 
| static java.util.Collection<Node<Point_2>> | Canvas2D. findCloseVertices(GeometricGraph_2 graph,
                 Point_2 p,
                 double epsilon)Return the list of vertices which are at distance at most epsilon from point p | 
| java.awt.Point | Draw. getPoint(Point_2 v)Return the integer coordinates of a pixel corresponding to a given point | 
| void | Draw. resize(Point_2 leftBottom,
      Point_2 rightTop) | 
| Modifier and Type | Method and Description | 
|---|---|
| void | Canvas2D. addPoints(java.util.Collection<Point_2> points) | 
| void | Canvas2D. addPolyhedronEdges(Polyhedron_3<Point_2> mesh,
                  java.awt.Color[] edgeColors) | 
| void | Canvas2D. addPolyhedronVertexLabels(Polyhedron_3<Point_2> mesh,
                         java.lang.String[] labels) | 
| void | Canvas2D. addPolyhedronVertices(Polyhedron_3<Point_2> mesh) | 
| void | Draw. drawMesh(Polyhedron_3<Point_2> mesh)Draw the edges of a planar mesh (halfedge data structure) | 
| void | Draw. drawMesh(Polyhedron_3<Point_2> mesh,
        java.awt.Color[] colors)Draw the colored edges of a planar mesh (halfedge data structure) | 
| Constructor and Description | 
|---|
| Draw(java.awt.Graphics g,
    Point_2 a,
    Point_2 b,
    int w,
    int h) | 
| Modifier and Type | Method and Description | 
|---|---|
| void | Fenetre. addColoredSegment(Point_2 p1,
                 Point_2 p2,
                 java.awt.Color c)Draw a segment with a given color | 
| void | Fenetre. addFatSegment(Point_2 p1,
             Point_2 p2) | 
| void | Fenetre. addLabel(java.lang.String label,
        Point_2 p)Draw a text label at a given position | 
| void | Fenetre. addPoint(Point_2 point)Add a 2D point to the window | 
| void | Fenetre. addPoints(Point_2[] points) | 
| void | Fenetre. addSegment(Point_2 p1,
          Point_2 p2)Add a segment | 
| void | Fenetre. addTriangle(Point_2[] points)Add the three segments of a triangle | 
| Modifier and Type | Method and Description | 
|---|---|
| void | Fenetre. addPoints(java.util.Collection<Point_2> points)Add a collection of 2D points | 
| void | Fenetre. addPolyhedronColoredEdges(Polyhedron_3<Point_2> polyhedron,
                         java.awt.Color[] colors) | 
| void | Fenetre. addPolyhedronEdges(Polyhedron_3<Point_2> polyhedron)Draw all halfedges of a planar Polyhedron (half-edge DS) | 
| Modifier and Type | Field and Description | 
|---|---|
| Point_2 | Canvas2DProcessing. selectedPoint | 
| Modifier and Type | Method and Description | 
|---|---|
| Point_2 | Canvas2DProcessing. selectPoint(int x,
           int y) | 
| Modifier and Type | Method and Description | 
|---|---|
| void | Draw2DProcessing. drawPoint(Point_2 p)Draw a circle at given location in the frame | 
| void | Draw2DProcessing. drawSegment(Point_2 p,
           Point_2 q)Draw a segment between two points (in the given frame) | 
| java.awt.Point | Draw2DProcessing. getPoint(Point_2 v) |