#define MRMESH_API
Definition MRMesh/MRMeshFwd.h:80
Definition MRAABBTree.h:16
@ None
special value not to limit path in one slice
Definition MRVoxelPath.h:33
Definition MRCameraOrientationPlugin.h:8
GeodesicPathApprox
the algorithm to compute approximately geodesic path
Definition MREnums.h:97
@ DijkstraBiDir
compute edge-only path by building it from start and end simultaneously
@ FastMarching
use Fast Marching algorithm
@ DijkstraAStar
compute edge-only path using A*-search algorithm
WrapType
Definition MREnums.h:15
ColoringType
Definition MREnums.h:77
@ LinesColorMap
Use different color (taken from faces colormap) for each line (primitive for object lines)
@ VertsColorMap
Use different color (taken from verts colormap) for each vertex.
@ SolidColor
Use one color for whole object.
@ FacesColorMap
Use different color (taken from faces colormap) for each face (primitive for object mesh)
@ PrimitivesColorMap
Use different color (taken from faces colormap) for each primitive.
EdgeWeights
determines the weight of each edge in applications like Laplacian
Definition MREnums.h:41
@ Cotan
edge weight depends on local geometry and uses cotangent values
FilterType
Definition MREnums.h:9
OffsetMode
Definition MREnums.h:68
@ Sharpening
create mesh using standard marching cubes with additional sharpening implemented in MeshLib
@ Smooth
create mesh using dual marching cubes from OpenVDB library
@ Standard
create mesh using standard marching cubes implemented in MeshLib
MRMESH_API const char * asString(ColoringType ct)
returns string representation of enum values
VertexMass
determines the weight or mass of each vertex in applications like Laplacian
Definition MREnums.h:31
@ NeiArea
vertex mass depends on local geometry and proportional to the area of first-ring triangles
@ Unit
all vertices have same mass=1
Processing
typically returned from callbacks to control the behavior of main algorithm
Definition MREnums.h:54
OrientNormals
the method how to choose between two opposite normal orientations
Definition MREnums.h:61
UseAABBTree
Definition MREnums.h:89
@ YesIfAlreadyConstructed
Reorder
determines how points to be ordered
Definition MREnums.h:23
@ Lexicographically
the order is determined by lexicographical sorting by coordinates (optimal for uniform sampling)