Julian Stahl and Daniel Zint
This package implements several variations of the marching cubes algorithm to generate a triangle meshes out of a voxel grid.
This package provides algorithms to extract isosurfaces from different inputs. The input is represented as a domain and can be an implicit function, a cartesion grid, or an octree. The output is an indexed face set that stores an isosurface in the form of a surface mesh. Available algorithms include Marching Cubes, Dual Contouring, and others.
Concepts
Classes
Free Functions
|
template<typename Concurrency_tag = Sequential_tag, class Domain_ , class PointRange , class PolygonRange > |
void | CGAL::Isosurfacing::make_triangle_mesh_using_marching_cubes (const Domain_ &domain, const typename Domain_::FT iso_value, PointRange &points, PolygonRange &polygons) |
| Creates a polygon soup that represents an isosurface using the marching cubes algorithm. More...
|
|
◆ make_triangle_mesh_using_marching_cubes()
template<typename Concurrency_tag = Sequential_tag, class Domain_ , class PointRange , class PolygonRange >
void CGAL::Isosurfacing::make_triangle_mesh_using_marching_cubes |
( |
const Domain_ & |
domain, |
|
|
const typename Domain_::FT |
iso_value, |
|
|
PointRange & |
points, |
|
|
PolygonRange & |
polygons |
|
) |
| |