storage for points on voxel edges used in Marching Cubes algorithms
More...
#include <MRSeparationPoint.h>
storage for points on voxel edges used in Marching Cubes algorithms
◆ findSeparationPointSet()
auto MR::SeparationPointStorage::findSeparationPointSet |
( |
size_t | voxelId | ) |
const -> const SeparationPointSet *
|
|
inline |
finds the set (locating the block) by voxel id
◆ getBlock()
Block & MR::SeparationPointStorage::getBlock |
( |
size_t | blockIndex | ) |
|
|
inline |
get block for filling in the thread responsible for it
◆ getPoints()
MRMESH_API void MR::SeparationPointStorage::getPoints |
( |
VertCoords & | points | ) |
const |
obtains coordinates of all stored points
◆ getTriangulation()
MRMESH_API Triangulation MR::SeparationPointStorage::getTriangulation |
( |
Vector< VoxelId, FaceId > * | outVoxelPerFaceMap = nullptr | ) |
const |
combines triangulations from every block into one and returns it
◆ makeUniqueVids()
MRMESH_API int MR::SeparationPointStorage::makeUniqueVids |
( |
| ) |
|
shifts vertex ids in each block (after they are filled) to make them unique; returns the total number of valid points in the storage
◆ resize()
MRMESH_API void MR::SeparationPointStorage::resize |
( |
size_t | blockCount, |
|
|
size_t | blockSize ) |
prepares storage for given number of blocks, each containing given size of voxels
The documentation for this class was generated from the following file: