Volume Cartographer 2.27.0
|
#include <vc/core/shapes/Cone.hpp>
Public Member Functions | |
Cone (int radius=2, int height=5, int recursion=5, bool closed=true) | |
![]() | |
ITKMesh::Pointer | itkMesh () |
Return the shape as an ITKMesh. | |
vtkSmartPointer< vtkPolyData > | vtkMesh () |
Return the shape as a vtkPolyData. | |
PointSet< cv::Vec3d > | unorderedPoints () |
Return the vertices as a PointSet. More... | |
PointSet< cv::Vec6d > | unorderedPointNormal () |
Return the vertices and vertex normals as a PointSet. More... | |
std::vector< SimpleMesh::Vertex > | getPoints () const |
Return the vertices as a list of SimpleMesh::Vertex. More... | |
std::vector< SimpleMesh::Cell > | getCells () const |
Return the faces as a list of volcart::Cell. More... | |
OrderedPointSet< cv::Vec3d > | orderedPoints () |
Return the vertices as an OrderedPointSet. More... | |
OrderedPointSet< cv::Vec6d > | orderedPointNormal () |
Return the vertices and vertex normals as an OrderedPointSet. More... | |
bool | isOrdered () const |
Return if the shape generator created ordered vertices. More... | |
std::size_t | orderedWidth () const |
Return the width of the ordered vertex set. More... | |
std::size_t | orderedHeight () const |
Return the height of the ordered vertex set. More... | |
Additional Inherited Members | |
![]() | |
ShapePrimitive () | |
void | addVertex_ (double x, double y, double z) |
Add a new vertex to the shape. | |
void | addCell_ (int v1, int v2, int v3) |
Add a new triangular face to the mesh from vertex IDs. More... | |
void | updateNormal_ (int vertID, double nx, double ny, double nz) |
Update the normal of a vertex with a new normal component. More... | |
![]() | |
std::vector< SimpleMesh::Vertex > | points_ |
std::vector< SimpleMesh::Cell > | cells_ |
bool | ordered_ {false} |
std::size_t | orderedWidth_ {0} |
std::size_t | orderedHeight_ {0} |
Cone shape.
This class builds a right-circular cone shape with a circular base centered at the origin.
The recursion level determines the number of points along the circumference of the circular base. For a recursion level , the number of points in the base will be
.
The shape will have a number of points equal to the number of points in the base (see above) plus two. The points generated by this class are unordered.
|
inline |