cgv
cgv::media::mesh::dual_contouring< X, T > Class Template Reference

class used to perform the marching cubes algorithm More...

#include <dual_contouring.h>

Inheritance diagram for cgv::media::mesh::dual_contouring< X, T >:
cgv::media::mesh::streaming_mesh< X >

Public Types

typedef cgv::math::fvec< X, 3 > pnt_type
 points must have three components
 
typedef cgv::math::fvec< X, 3 > vec_type
 vectors must have three components
 
typedef cgv::math::qem< X > qem_type
 qem type must have dimension three
 
typedef cell_info< X > cell_info_type
 qem type must have dimension three
 

Public Member Functions

 dual_contouring (const cgv::math::v3_func< X, T > &_func, streaming_mesh_callback_handler *_smcbh, const X &_consistency_threshold=0.01f, unsigned int _max_nr_iters=10, const X &_epsilon=1e-6f)
 construct dual contouring object
 
void compute_cell_vertex (dc_slice_info< T > *info_ptr, int i, int j)
 construct a new vertex on an edge
 
void generate_quad (unsigned int vi, unsigned int vj, unsigned int vk, unsigned int vl, bool reorient)
 construct a quadrilateral
 
void process_edge_plane (const T &v_1, const T &v_2, int e, cell_info_type *C1, cell_info_type *C2, cell_info_type *C3, cell_info_type *C4)
 construct plane through edge and add it to the incident qems
 
void process_slice (dc_slice_info< T > *prev_info_ptr, dc_slice_info< T > *info_ptr)
 process a slice
 
void extract (const T &_iso_value, const axis_aligned_box< X, 3 > &box, unsigned int _resx, unsigned int _resy, unsigned int _resz, bool show_progress=false)
 extract iso surface and send quads to dual contouring handler
 
void set_callback_handler (streaming_mesh_callback_handler *_smcbh)
 set a new callback handler
 
unsigned int get_nr_dropped_vertices () const
 return the number of vertices dropped from the front, what is used as index offset into a deque
 
unsigned int get_nr_vertices () const
 return the number of vertices
 
unsigned int get_nr_faces () const
 return the number of faces
 
void drop_vertex ()
 drop the front most vertex from the deque
 
void drop_vertices (unsigned int n)
 drop n vertices from the front of the deque
 
pnt_typevertex_location (unsigned int vi)
 write access to vertex locations
 
const pnt_typevertex_location (unsigned int vi) const
 read access to vertex locations
 
const vec_typevertex_normal (unsigned int vi) const
 read access to vertex normals
 
vec_typevertex_normal (unsigned int vi)
 write access to vertex normals
 
unsigned int new_vertex (const pnt_type &p)
 add a new vertex with the given location and call the callback of the callback handler
 
void new_triangle (unsigned int vi, unsigned int vj, unsigned int vk)
 construct a new triangle by calling the new polygon method of the callback handler
 
void new_quad (unsigned int vi, unsigned int vj, unsigned int vk, unsigned int vl)
 construct a new quad by calling the new polygon method of the callback handler
 
void new_polygon (const std::vector< unsigned int > &vertex_indices)
 construct a new polygon by calling the new polygon method of the callback handler
 

Protected Attributes

int idx_off
 offset used to address vertices in deque
 
unsigned int nr_faces
 count the number of faces
 
std::deque< pnt_typepnts
 store currently used points in deque
 
std::deque< vec_typenmls
 store currently used normals in deque
 
streaming_mesh_callback_handlersmcbh
 store a pointer to the callback handler
 

Detailed Description

template<typename X, typename T>
class cgv::media::mesh::dual_contouring< X, T >

class used to perform the marching cubes algorithm


The documentation for this class was generated from the following file: