Package | Description |
---|---|
Jcg.geometry | |
Jcg.geometry.kernel | |
Jcg.graph | |
Jcg.graph.drawing | |
Jcg.mesh | |
Jcg.rangesearch | |
Jcg.subdivision | |
Jcg.triangulations3D | |
Jcg.viewer | |
Jcg.viewer.j3d | |
Jcg.viewer.processing3d |
Modifier and Type | Field and Description |
---|---|
Point_3 |
Segment_3.p |
Point_3 |
Segment_3.q |
Modifier and Type | Method and Description |
---|---|
Point_3[] |
PointCloud_3.boundingBox()
Compute the bounding box (enclosing all points)
|
static Point_3 |
GeometricOperations_3.circumCenter(Point_3 p,
Point_3 q,
Point_3 r,
Point_3 s)
Deprecated.
|
static Point_3 |
Point_3.linearCombination(Point_3[] points,
java.lang.Number[] coefficients) |
Point_3 |
PointCloud_3.max(int d)
Return the point with greatest coordinate value (in direction d)
|
Point_3 |
PointCloud_3.min(int d)
Return the point with smallest coordinate value (in direction d)
|
Point_3 |
Plane_3.point() |
Point_3 |
Point_3.sum(Vector_ v) |
Point_3 |
Triangle_3.vertex(int i) |
Modifier and Type | Method and Description |
---|---|
static Point_3 |
GeometricOperations_3.circumCenter(Point_3 p,
Point_3 q,
Point_3 r,
Point_3 s)
Deprecated.
|
static boolean |
GeometricOperations_3.coplanarExact(Point_3 a,
Point_3 b,
Point_3 c,
Point_3 d)
Deprecated.
Test whether four 3D points are coplanar (test is filtered)
|
java.lang.Number |
Point_3.distanceFrom(Point_3 p) |
boolean |
Plane_3.hasOn(Point_3 p) |
boolean |
Plane_3.hasOnNegativeSide(Point_3 p) |
boolean |
Plane_3.hasOnPositiveSide(Point_3 p) |
static Point_3 |
Point_3.linearCombination(Point_3[] points,
java.lang.Number[] coefficients) |
static int |
GeometricOperations_3.orientation(Point_3 a,
Point_3 b,
Point_3 c,
Point_3 d)
Deprecated.
refer to Jcg.geometry.kernel.GeometricPredicates_3
|
static int |
GeometricOperations_3.sideOfSphere(Point_3 p,
Point_3 a,
Point_3 b,
Point_3 c,
Point_3 d)
Deprecated.
Returns the position of p with respect to the circumsphere of tetrahedron (a, b, c, d): +1 if
p lies outside the sphere, -1 if p lies inside the sphere, 0 if p lies on the sphere
with exact computations (slow but more reliable)
|
static int |
GeometricOperations_3.sideOfTetrahedron(Point_3 p,
Point_3[] t)
Deprecated.
determines on which side of the tetrahedron t point p lies: -1 means inside, 0 means on the boundary,
+1 means outside
|
static int |
GeometricOperations_3.sideOfTetrahedron(Point_3 p,
Point_3[] t)
Deprecated.
determines on which side of the tetrahedron t point p lies: -1 means inside, 0 means on the boundary,
+1 means outside
|
Constructor and Description |
---|
Plane_3(Point_3 p,
Point_3 q,
Point_3 r) |
Plane_3(Point_3 p,
Vector_3 n) |
Segment_3(Point_3 p,
Point_3 q) |
Triangle_3(Point_3 a,
Point_3 b,
Point_3 c) |
Vector_3(Point_3 a,
Point_3 b) |
Constructor and Description |
---|
PointCloud_3(java.util.ArrayList<Point_3> points)
Create a new point cloud (a copy) from a collection of points
|
Modifier and Type | Method and Description |
---|---|
Point_3 |
GeometricConstructions_3.circumCenter(Point_3 p,
Point_3 q,
Point_3 r,
Point_3 s)
Returns the (approximate) circumcenter of four points
|
Point_3 |
ApproximateConstructions_3.circumCenter(Point_3 p,
Point_3 q,
Point_3 r,
Point_3 s)
Returns the (approximate) circumcenter of four points
|
Modifier and Type | Method and Description |
---|---|
Point_3 |
GeometricConstructions_3.circumCenter(Point_3 p,
Point_3 q,
Point_3 r,
Point_3 s)
Returns the (approximate) circumcenter of four points
|
Point_3 |
ApproximateConstructions_3.circumCenter(Point_3 p,
Point_3 q,
Point_3 r,
Point_3 s)
Returns the (approximate) circumcenter of four points
|
int |
FilteredPredicates_3.orientation(Point_3 a,
Point_3 b,
Point_3 c,
Point_3 d)
Compute the orientation of tetrahedron (test is filtered)
|
int |
GeometricPredicates_3.orientation(Point_3 a,
Point_3 b,
Point_3 c,
Point_3 d)
Compute the orientation of tetrahedron
|
Modifier and Type | Method and Description |
---|---|
Point_3[] |
GeometricGraph_3.boundingBox()
Compute and return the bounding box for the points set.
|
Point_3 |
GeometricGraph_3.getPoint(Node<Point_3> v) |
Point_3[] |
GeometricGraph_3.getSegment(Node<Point_3> u,
Node<Point_3> v)
Return the segment having as extremities two given vertices of the graph
|
Modifier and Type | Method and Description |
---|---|
java.util.ArrayList<Point_3> |
GeometricGraph_3.listOfPoints()
Return the list of vertex points of the graph
|
Modifier and Type | Method and Description |
---|---|
void |
GeometricGraph_3.addNode(Point_3 p)
Add a new vertex to the graph (with its geometric coordinates)
|
void |
GeometricGraph_3.setPoint(Node<Point_3> v,
Point_3 p) |
Modifier and Type | Method and Description |
---|---|
Point_3 |
GeometricGraph_3.getPoint(Node<Point_3> v) |
Point_3[] |
GeometricGraph_3.getSegment(Node<Point_3> u,
Node<Point_3> v)
Return the segment having as extremities two given vertices of the graph
|
Point_3[] |
GeometricGraph_3.getSegment(Node<Point_3> u,
Node<Point_3> v)
Return the segment having as extremities two given vertices of the graph
|
void |
GeometricGraph_3.setPoint(Node<Point_3> v,
Point_3 p) |
Modifier and Type | Class and Description |
---|---|
class |
SphericalCentralProjection<X extends Point_3>
Provides methods for performing the central projection of a 3D convex polyhedron
on the unit sphere.
|
Modifier and Type | Method and Description |
---|---|
Point_3 |
SpectralDrawing_3.computeCoordinates_3(int i,
double[] eigenvalues,
double[][] eigenvectors) |
Modifier and Type | Field and Description |
---|---|
Point_3[] |
SharedVertexRepresentation.points |
Modifier and Type | Method and Description |
---|---|
static Polyhedron_3<Point_3> |
MeshLoader.getSurfaceMesh(java.lang.String filename)
Load a surface mesh embedded in 3D (Polyhedron_3
|
static TriangulationDS_2<Point_3> |
Triangulations_IO.getTriangleMeshFromFile(java.lang.String filename)
Create a Triangle Data Structure for a given 3D surface mesh (from a file).
|
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)
|
Constructor and Description |
---|
SharedVertexRepresentation(int n,
int f,
int he,
int[][] faces,
int[] faceDegrees,
Point_3[] points)
Create a shared vertex representation
|
Constructor and Description |
---|
SharedVertexRepresentation(Polyhedron_3<Point_3> polyhedron)
Create a shared vertex representation from a polyhedron (half-edge data structure)
|
SharedVertexRepresentation(TriangulationDS_2<Point_3> mesh)
Create a mesh representation from a polyhedron (half-edge data structure)
|
Modifier and Type | Method and Description |
---|---|
PointCloud_3 |
RangeSearch_3.rangeSearch(Point_3 q,
double delta)
Compute the points at distance at most delta from q.
|
Modifier and Type | Field and Description |
---|---|
Polyhedron_3<Point_3> |
SubdivisionMethod_3.polyhedron3D |
Modifier and Type | Method and Description |
---|---|
Point_3 |
LoopSubdivision.computeEdgePoint(Halfedge<Point_3> h)
Compute a new edge point (given the half-edge h)
|
Point_3 |
LoopSubdivision.computeNewVertexLocation(Vertex<Point_3> v)
Compute the new coordinates for a vertex (already existing in the initial mesh)
|
Point_3[] |
LoopSubdivision.computeNewVertexLocations()
Compute the new coordinates for all vertices of the initial mesh
|
Modifier and Type | Method and Description |
---|---|
java.util.HashMap<Halfedge<Point_3>,Point_3> |
LoopSubdivision.computeEdgePoints()
Compute all new edge points and store the result in an HashMap
|
java.util.HashMap<Halfedge<Point_3>,Point_3> |
LoopSubdivision.computeEdgePoints()
Compute all new edge points and store the result in an HashMap
|
Modifier and Type | Method and Description |
---|---|
Point_3 |
LoopSubdivision.computeEdgePoint(Halfedge<Point_3> h)
Compute a new edge point (given the half-edge h)
|
Point_3 |
LoopSubdivision.computeNewVertexLocation(Vertex<Point_3> v)
Compute the new coordinates for a vertex (already existing in the initial mesh)
|
void |
LoopSubdivision.splitEdges(java.util.HashMap<Halfedge<Point_3>,Point_3> edgePoints)
Splits all edges by inserting a new vertex
|
void |
LoopSubdivision.splitEdges(java.util.HashMap<Halfedge<Point_3>,Point_3> edgePoints)
Splits all edges by inserting a new vertex
|
void |
LoopSubdivision.subdivideFace(Face<Point_3> f)
Perform the subdivision of a face into 4 triangular sub-faces
Edges must already be split: the face has degree 3+3
|
Constructor and Description |
---|
LoopSubdivision(Polyhedron_3<Point_3> polyhedron) |
SubdivisionMethod_3(Polyhedron_3<Point_3> polyhedron3D) |
Modifier and Type | Class and Description |
---|---|
class |
FacetHandle<X extends Point_3>
A dummy class used to represent a triangulation facet as a pair (TriangulationDSCell_3, int).
|
class |
TriangulationDS_3<X extends Point_3>
Data structure for representing 3D triangulations that uses the standard cell/vertex encoding,
represented by classes TriangulationDSCell_3 and TriangulationDSVertex_3 respectively.
|
class |
TriangulationDSCell_3<X extends Point_3>
The class used to encode a cell of a triangulation.
|
class |
TriangulationDSVertex_3<X extends Point_3>
The class used to encode a vertex of a triangulation.
|
Modifier and Type | Method and Description |
---|---|
Point_3 |
Delaunay_3.dual(TriangulationDSCell_3<Point_3> c)
Outputs the Voronoi vertex dual to cell c.
|
Point_3[] |
TriangulationDSCell_3.verticesPoints()
returns an array containing the geometric points associated with the vertices of the cell
|
Modifier and Type | Method and Description |
---|---|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
Delaunay_3.cells()
returns the collection of all cells of the triangulation.
|
java.util.Collection<FacetHandle<Point_3>> |
Delaunay_3.convexHullFacets()
Outputs the collection of all facets of the boundary of the convex hull.
|
java.util.Set<TriangulationDSCell_3<Point_3>> |
Delaunay_3.findConflicts(Point_3 p,
TriangulationDSCell_3<Point_3> cstart)
Computes the set of cells that are in conflict with p, that is, the cells whose circumspheres have p
in their interior.
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
Delaunay_3.finiteCells()
returns the collection of all finite cells of the triangulation.
|
java.util.Collection<FacetHandle<Point_3>> |
Delaunay_3.finiteFacets()
Outputs the collection of all finite facets of the triangulation (the ones not linked to
bounding box vertices).
|
java.util.Collection<TriangulationDSVertex_3<Point_3>> |
Delaunay_3.finiteVertices()
returns the collection of all finite vertices of the triangulation.
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
Delaunay_3.incidentCells(TriangulationDSCell_3<Point_3> c,
int i,
int j)
Returns the collection of all cells incident to edge (c,i,j).
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
TriangulationDS_3.incidentCells(TriangulationDSCell_3<Point_3> c,
int i,
int j)
Returns the collection of all triangulation cells incident to edge (c,i,j).
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
Delaunay_3.incidentCells(TriangulationDSVertex_3<Point_3> v)
Outputs the collection of all cells incident to vertex v.
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
TriangulationDS_3.incidentCells(TriangulationDSVertex_3<Point_3> v)
Returns the collection of all triangulation cells incident to vertex v.
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
Delaunay_3.incidentCells(TriangulationDSVertex_3<Point_3> u,
TriangulationDSVertex_3<Point_3> v)
Returns the collection of all cells incident to edge (u,v).
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
TriangulationDS_3.incidentCells(TriangulationDSVertex_3<Point_3> u,
TriangulationDSVertex_3<Point_3> v)
Returns the collection of all triangulation cells incident to edge (u,v).
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
Delaunay_3.incidentFiniteCells(TriangulationDSCell_3<Point_3> c,
int i,
int j)
Returns the collection of all finite cells incident to edge (c,i,j).
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
Delaunay_3.incidentFiniteCells(TriangulationDSVertex_3<Point_3> v)
Outputs the collection of all finite cells incident to vertex v.
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
Delaunay_3.incidentFiniteCells(TriangulationDSVertex_3<Point_3> u,
TriangulationDSVertex_3<Point_3> v)
Returns the collection of all finite cells incident to edge (u,v).
|
TriangulationDSCell_3<Point_3> |
Delaunay_3.infiniteCell()
returns an infinite cell of the triangulation.
|
TriangulationDSVertex_3<Point_3> |
Delaunay_3.infiniteVertex()
returns an infinite vertex of the triangulation.
|
TriangulationDSVertex_3<Point_3> |
Delaunay_3.insert(Point_3 p)
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.
|
TriangulationDSVertex_3<Point_3> |
Delaunay_3.insert(Point_3 p,
TriangulationDSCell_3<Point_3> cstart)
Inserts point p in the triangulation, using cell cstart to initiate the conflicts zone computation.
|
TriangulationDSCell_3<Point_3> |
Delaunay_3.locate(Point_3 p)
locates point p using a straight-line walk from a random cell.
|
TriangulationDSCell_3<Point_3> |
Delaunay_3.randomCell()
returns a random (possibly infinite) cell of the triangulation, chosen according to uniform
distribution over the set of all triangulation cells.
|
TriangulationDSCell_3<Point_3> |
Delaunay_3.randomFiniteCell()
returns a random finite cell of the triangulation, chosen according to a uniform distribution over
the set of finite triangulation cells.
|
TriangulationDSVertex_3<Point_3> |
Delaunay_3.randomFiniteVertex()
returns a random finite vertex of the triangulation, chosen according to a uniform distribution over
the set of finite triangulation vertices.
|
TriangulationDSVertex_3<Point_3> |
Delaunay_3.randomVertex()
returns a random (possibly infinite) vertex of the triangulation, chosen according to uniform
distribution over the set of all triangulation vertices.
|
java.util.Collection<TriangulationDSVertex_3<Point_3>> |
Delaunay_3.vertices()
returns the collection of all vertices of the triangulation.
|
Modifier and Type | Method and Description |
---|---|
java.util.Set<TriangulationDSCell_3<Point_3>> |
Delaunay_3.findConflicts(Point_3 p,
TriangulationDSCell_3<Point_3> cstart)
Computes the set of cells that are in conflict with p, that is, the cells whose circumspheres have p
in their interior.
|
TriangulationDSVertex_3<Point_3> |
Delaunay_3.insert(Point_3 p)
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.
|
TriangulationDSVertex_3<Point_3> |
Delaunay_3.insert(Point_3 p,
TriangulationDSCell_3<Point_3> cstart)
Inserts point p in the triangulation, using cell cstart to initiate the conflicts zone computation.
|
boolean |
Delaunay_3.isInfinite(Point_3 p)
returns the status of a 3D point: infinite if it is a bounding box vertex, finite otherwise.
|
TriangulationDSCell_3<Point_3> |
Delaunay_3.locate(Point_3 p)
locates point p using a straight-line walk from a random cell.
|
Modifier and Type | Method and Description |
---|---|
Point_3 |
Delaunay_3.dual(TriangulationDSCell_3<Point_3> c)
Outputs the Voronoi vertex dual to cell c.
|
java.util.Collection<Triangle_3> |
Delaunay_3.dual(TriangulationDSVertex_3<Point_3> v)
Outputs the (triangulated) boundary of the Voronoi region dual to vertex v.
|
java.util.Set<TriangulationDSCell_3<Point_3>> |
Delaunay_3.findConflicts(Point_3 p,
TriangulationDSCell_3<Point_3> cstart)
Computes the set of cells that are in conflict with p, that is, the cells whose circumspheres have p
in their interior.
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
Delaunay_3.incidentCells(TriangulationDSCell_3<Point_3> c,
int i,
int j)
Returns the collection of all cells incident to edge (c,i,j).
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
TriangulationDS_3.incidentCells(TriangulationDSCell_3<Point_3> c,
int i,
int j)
Returns the collection of all triangulation cells incident to edge (c,i,j).
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
Delaunay_3.incidentCells(TriangulationDSVertex_3<Point_3> v)
Outputs the collection of all cells incident to vertex v.
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
TriangulationDS_3.incidentCells(TriangulationDSVertex_3<Point_3> v)
Returns the collection of all triangulation cells incident to vertex v.
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
Delaunay_3.incidentCells(TriangulationDSVertex_3<Point_3> u,
TriangulationDSVertex_3<Point_3> v)
Returns the collection of all cells incident to edge (u,v).
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
Delaunay_3.incidentCells(TriangulationDSVertex_3<Point_3> u,
TriangulationDSVertex_3<Point_3> v)
Returns the collection of all cells incident to edge (u,v).
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
TriangulationDS_3.incidentCells(TriangulationDSVertex_3<Point_3> u,
TriangulationDSVertex_3<Point_3> v)
Returns the collection of all triangulation cells incident to edge (u,v).
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
TriangulationDS_3.incidentCells(TriangulationDSVertex_3<Point_3> u,
TriangulationDSVertex_3<Point_3> v)
Returns the collection of all triangulation cells incident to edge (u,v).
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
Delaunay_3.incidentFiniteCells(TriangulationDSCell_3<Point_3> c,
int i,
int j)
Returns the collection of all finite cells incident to edge (c,i,j).
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
Delaunay_3.incidentFiniteCells(TriangulationDSVertex_3<Point_3> v)
Outputs the collection of all finite cells incident to vertex v.
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
Delaunay_3.incidentFiniteCells(TriangulationDSVertex_3<Point_3> u,
TriangulationDSVertex_3<Point_3> v)
Returns the collection of all finite cells incident to edge (u,v).
|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
Delaunay_3.incidentFiniteCells(TriangulationDSVertex_3<Point_3> u,
TriangulationDSVertex_3<Point_3> v)
Returns the collection of all finite cells incident to edge (u,v).
|
TriangulationDSVertex_3<Point_3> |
Delaunay_3.insert(Point_3 p,
TriangulationDSCell_3<Point_3> cstart)
Inserts point p in the triangulation, using cell cstart to initiate the conflicts zone computation.
|
void |
Delaunay_3.starZone(TriangulationDSVertex_3<Point_3> v,
java.util.TreeSet<TriangulationDSCell_3<Point_3>> zone)
Triangulates a zone (= facet-connected set of cells) by creating a star of simplices joining vertex v
to the triangles on the zone's boundary.
|
void |
Delaunay_3.starZone(TriangulationDSVertex_3<Point_3> v,
java.util.TreeSet<TriangulationDSCell_3<Point_3>> zone)
Triangulates a zone (= facet-connected set of cells) by creating a star of simplices joining vertex v
to the triangles on the zone's boundary.
|
Modifier and Type | Method and Description |
---|---|
Point_3[] |
DrawSkeleton.computeBoundingBox()
Compute the scale factor (depending on the max distance of the point set)
|
Modifier and Type | Method and Description |
---|---|
void |
DrawSkeleton.drawBoundingBox(Point_3[] box)
Draw the X, Y and Z axis
|
abstract void |
DrawMesh.drawFace(Point_3[] f)
Draw a (triangle or polygonal) face
|
abstract void |
DrawSkeleton.drawSegment(Point_3 p,
Point_3 q)
Draw a segment between two points
|
abstract void |
DrawMesh.drawTriangle(Point_3 p,
Point_3 q,
Point_3 r)
Draw a triangle
|
abstract void |
DrawSkeleton.drawVertex(Point_3 p)
Draw a vertex
|
Modifier and Type | Field and Description |
---|---|
Point_3[] |
MeshViewer.points |
Modifier and Type | Field and Description |
---|---|
java.util.Collection<TriangulationDSCell_3<Point_3>> |
MeshViewer.cellsCollection
A field in which to store collections of 3D triangulation cells to be shown in the scene.
|
java.util.Collection<FacetHandle<Point_3>> |
MeshViewer.facetsCollection
A field in which to store collections of 3D triangulation facets to be shown in the scene.
|
java.util.ArrayList<Point_3> |
MeshViewer.graphEdges |
java.util.Collection<Point_3> |
MeshViewer.pointsCollection
A field in which to store collections of points to be shown in the scene.
|
Polyhedron_3<Point_3> |
MeshViewer.polyhedron |
TriangulationDS_3<Point_3> |
MeshViewer.triangulation3D |
Modifier and Type | Method and Description |
---|---|
void |
MeshViewer.addColoredEdges(javax.media.j3d.TransformGroup objTrans,
javax.media.j3d.Appearance ap,
Point_3[] points,
int[][] edges,
java.awt.Color[] colors)
Draw a set of colored edges in 3D (for example, as the 1-skeleton of a polyhedron)
|
void |
MeshViewer.addEdgesOnly(javax.media.j3d.TransformGroup objTrans,
javax.media.j3d.Appearance ap,
Point_3[] points,
int[][] edges,
java.awt.Color color)
Draw a set of edges in 3D (for example, as the 1-skeleton of a polyhedron)
|
void |
MeshViewer.addPolygonFacet(javax.media.j3d.TransformGroup objTrans,
javax.media.j3d.Appearance ap,
Point_3[] points,
java.awt.Color color)
Draw a polygonal face
|
void |
MeshViewer.addPolygonFacets(javax.media.j3d.TransformGroup objTrans,
javax.media.j3d.Appearance ap,
Point_3[] points,
int[][] faces,
java.awt.Color[] color)
Draw a set of polygon facets
|
void |
MeshViewer.addTriangleFacet(javax.media.j3d.TransformGroup objTrans,
javax.media.j3d.Appearance ap,
Point_3[] points,
java.awt.Color color)
Draw a triangle face
|
double[] |
MeshViewer.boundingBox(Point_3[] points)
Compute a bounding box of the input points (from an Array)
|
double |
MeshViewer.computeScaleFactor(Point_3[] points)
Compute the scale factor in order to adjust the 3D view
|
void |
MeshViewer.renderTriangleMesh(javax.media.j3d.TransformGroup objTrans,
javax.media.j3d.Appearance ap,
Point_3[] points,
int[][] faces,
java.awt.Color[] color)
Render the set of triangle facets of a surface mesh
(the input is a shared vertex representation)
|
Modifier and Type | Method and Description |
---|---|
void |
MeshViewer.add3DCells(javax.media.j3d.TransformGroup objTrans,
javax.media.j3d.Appearance ap,
java.util.Collection<TriangulationDSCell_3<Point_3>> cells,
java.awt.Color[] color)
Draw a 3D volume mesh (a set of tetrahedra in R3)
|
void |
MeshViewer.addFacets(javax.media.j3d.TransformGroup objTrans,
javax.media.j3d.Appearance ap,
java.util.Collection<FacetHandle<Point_3>> facets,
java.awt.Color[] colors)
Draws a triangle soup in 3D represented as a collection of facet handles in a triangulation
|
void |
MeshViewer.addPoints(javax.media.j3d.TransformGroup objTrans,
javax.media.j3d.Appearance ap,
java.util.Collection<Point_3> points,
java.awt.Color[] color)
Draws a point cloud in 3D
|
double[] |
MeshViewer.boundingBox(java.util.Collection<Point_3> points)
Compute a bounding box of the input points (from a Collection)
|
double |
MeshViewer.computeScaleFactor(java.util.Collection<Point_3> points)
Compute the scale factor in order to adjust the 3D view (from a Collection)
|
void |
MeshViewer.drawBoundingBox(javax.media.j3d.TransformGroup objTrans,
java.util.Collection<Point_3> points)
Draw x, y and z axis
|
Constructor and Description |
---|
MeshViewer(Point_3[] points,
int[][] edges)
creates a 3D viewer showing a collection of edges.
|
MeshViewer(Point_3[] points,
int[][] edges,
java.awt.Color[] colors)
creates a 3D viewer showing a collection of colored edges.
|
MeshViewer(Polyhedron_3<Point_3> mesh,
Point_3[] points,
int[][] edges,
java.awt.Color[] colors)
creates a 3D viewer showing a collection of colored edges.
|
Constructor and Description |
---|
MeshViewer(java.util.Collection<Point_3> points)
creates a 3D viewer showing a point cloud in 3D.
|
MeshViewer(java.util.Collection<Point_3> points,
java.awt.Color[] colors)
creates a 3D viewer showing a point cloud (with colors) in 3D.
|
MeshViewer(Polyhedron_3<Point_3> polyhedron)
creates a 3D viewer showing a polyhedron.
|
MeshViewer(Polyhedron_3<Point_3> mesh,
Point_3[] points,
int[][] edges,
java.awt.Color[] colors)
creates a 3D viewer showing a collection of colored edges.
|
MeshViewer(TriangulationDS_2<Point_3> mesh)
creates a 3D viewer showing a Triangle mesh.
|
MeshViewer(TriangulationDS_3<Point_3> triangulation3D)
creates a 3D viewer showing a 3D triangulation.
|
Modifier and Type | Field and Description |
---|---|
Polyhedron_3<Point_3> |
DrawPolyhedronProcessing.polyhedron3D |
Modifier and Type | Method and Description |
---|---|
void |
DrawPolyhedronProcessing.drawFace(Point_3[] f)
Draw a (triangle or polygonal) face
|
void |
DrawPolyhedronProcessing.drawNormal(Point_3 p,
float[] normal)
Draw the vertex normal
|
void |
DrawPolyhedronProcessing.drawSegment(Point_3 p,
Point_3 q)
Draw a segment between two points
|
void |
DrawPolyhedronProcessing.drawSegment(Point_3 p,
Point_3 q,
float[] color)
Draw a segment between two points
|
void |
DrawPolyhedronProcessing.drawTriangle(Point_3 p,
Point_3 q,
Point_3 r)
Draw a triangle
|
void |
DrawPolyhedronProcessing.drawVertex(Point_3 p)
Draw a vertex (as a small sphere)
|
Modifier and Type | Method and Description |
---|---|
void |
DrawPolyhedronProcessing.drawFace(Face<Point_3> f)
Draw a (triangle or polygonal) face
|
Constructor and Description |
---|
DrawPolyhedronProcessing(MeshViewerProcessing view,
Polyhedron_3<Point_3> polyhedron3D,
float[][] edgeColors)
Create a surface mesh from a 3D polyhedron (3D surface mesh)
|