Wildmeshing Toolkit
Loading...
Searching...
No Matches
Classes | Public Types | Public Member Functions | Public Attributes | Protected Member Functions | Private Member Functions | Private Attributes | List of all members
wmtk::TriMesh Class Reference

Classes

class  SmartTuple
 
class  TriangleConnectivity
 
class  Tuple
 
class  VertexConnectivity
 
class  VertexMutex
 

Public Types

template<typename T >
using vector = tbb::concurrent_vector< T >
 

Public Member Functions

void init (size_t n_vertices, const std::vector< std::array< size_t, 3 > > &tris)
 
void init (const MatrixXi &F)
 Generate the connectivity of the mesh from an IGL-style F matrix.
 
std::vector< Tupleget_vertices () const
 
std::vector< Tupleget_edges () const
 
std::vector< Tupleget_faces () const
 
Tuple tuple_from_edge (size_t vid1, size_t vid2, size_t fid) const
 
Tuple tuple_from_vids (size_t vid0, size_t vid1, size_t vid2) const
 
simplex::Vertex simplex_from_vertex (const Tuple &t) const
 
simplex::Edge simplex_from_edge (const Tuple &t) const
 
simplex::Face simplex_from_face (const Tuple &t) const
 
simplex::Face simplex_from_face (const size_t fid) const
 
Tuple tuple_from_simplex (const simplex::Face &s) const
 
simplex::RawSimplexCollection simplex_incident_triangles (const simplex::Vertex &v) const
 
simplex::RawSimplexCollection simplex_incident_triangles (const simplex::Edge &e) const
 
simplex::RawSimplexCollection simplex_link_vertices (const simplex::Vertex &v) const
 
simplex::RawSimplexCollection simplex_link_vertices (const simplex::Edge &e) const
 
simplex::RawSimplexCollection simplex_link_edges (const simplex::Vertex &v) const
 
virtual bool invariants (const std::vector< Tuple > &)
 User specified invariants that can't be violated.
 
virtual bool split_edge_before (const Tuple &t)
 User specified preparations and desideratas for an edge split.
 
virtual bool split_edge_after (const Tuple &t)
 User specified modifications and desideratas after an edge split.
 
virtual bool collapse_edge_before (const Tuple &t)
 User specified preparations and desideratas for an edge collapse including the link check as collapse prerequisite.
 
virtual bool collapse_edge_after (const Tuple &t)
 User specified modifications and desideratas after an edge collapse.
 
virtual bool swap_edge_after (const Tuple &t)
 User specified modifications and desideras after an edge swap.
 
virtual bool swap_edge_before (const Tuple &t)
 User specified preparations and desideratas for an edge swap including 1.can't swap on boundary edge. 2. when swap edge between v1, v2, there can't exist edges between the two opposite vertices v3, v4.
 
virtual bool smooth_before (const Tuple &t)
 User specified preparations and desideratas for an edge smooth.
 
virtual bool smooth_after (const Tuple &t)
 User specified modifications and desideras after an edge smooth.
 
virtual bool split_face_before (const Tuple &t)
 User specified preparations and desideratas for a face split.
 
virtual bool split_face_after (const Tuple &t)
 User specified modifications and desideratas after a face split.
 
size_t tri_capacity () const
 get the current largest global fid
 
size_t vert_capacity () const
 get the current largest global vid
 
void consolidate_mesh ()
 removing the elements that are removed
 
Tuple switch_vertex (const Tuple &t) const
 a duplicate of Tuple::switch_vertex funciton
 
Tuple switch_edge (const Tuple &t) const
 a duplicate of Tuple::switch_edge funciton
 
std::optional< Tupleswitch_face (const Tuple &t) const
 a duplicate of Tuple::switch_face funciton
 
bool check_link_condition (const Tuple &t) const
 prerequisite for collapse
 
bool check_mesh_connectivity_validity () const
 verify the connectivity validity of the mesh
 
bool check_edge_manifold () const
 verify the edge manifoldness of the mesh
 
bool is_boundary_edge (const TriMesh::Tuple &t) const
 check if edge that's represented by a Tuple is at the boundary of the mesh
 
bool is_boundary_vertex (const TriMesh::Tuple &t) const
 check if the vertex that's represented by a Tuple is at the boundary of the mesh
 
bool split_edge (const Tuple &t, std::vector< Tuple > &new_t)
 
virtual bool collapse_edge (const Tuple &t, std::vector< Tuple > &new_t)
 
void collapse_edge_conn (const Tuple &loc0, std::vector< Tuple > &new_tris, Tuple &return_t, size_t &new_vid, std::vector< std::pair< size_t, TriangleConnectivity > > &old_tris, std::vector< std::pair< size_t, VertexConnectivity > > &old_vertices, std::vector< std::pair< size_t, size_t > > &same_edge_vid_fid, std::vector< size_t > &n12_intersect_fids)
 
void collapse_edge_rollback (size_t &new_vid, std::vector< std::pair< size_t, TriangleConnectivity > > &old_tris, std::vector< std::pair< size_t, VertexConnectivity > > &old_vertices, std::vector< std::pair< size_t, size_t > > &same_edge_vid_fid, std::vector< size_t > &n12_intersect_fids)
 
bool swap_edge (const Tuple &t, std::vector< Tuple > &new_t)
 
bool smooth_vertex (const Tuple &t)
 
bool split_face (const Tuple &t, std::vector< Tuple > &new_t)
 Split a face in 3 faces.
 
size_t get_valence_for_vertex (const Tuple &t) const
 Count the number of the one ring tris for a vertex.
 
std::vector< Tupleget_one_ring_tris_for_vertex (const Tuple &t) const
 Get the one ring tris for a vertex.
 
const std::vector< size_t > & get_one_ring_fids_for_vertex (const Tuple &t) const
 
const std::vector< size_t > & get_one_ring_fids_for_vertex (const size_t vid) const
 
std::vector< size_t > get_one_ring_vids_for_vertex_duplicate (const size_t &t) const
 Get the vids of the incident one ring tris for a vertex.
 
std::vector< size_t > get_incident_fids_for_edge (const Tuple &t) const
 
std::vector< size_t > get_incident_fids_for_edge (const size_t vid0, const size_t vid1) const
 
std::vector< Tupleget_one_ring_edges_for_vertex (const Tuple &t) const
 Get all edges that are incident to the vertex of Tuple t.
 
std::vector< Tupleget_one_ring_edges_for_vertex (const size_t vid) const
 
std::array< Tuple, 3 > oriented_tri_vertices (const Tuple &t) const
 Get the incident vertices for a triangle.
 
std::array< size_t, 3 > oriented_tri_vids (const Tuple &t) const
 Get the incident vertices for a triangle.
 
std::array< size_t, 3 > oriented_tri_vids (const size_t i) const
 
std::array< Tuple, 2 > get_edge_vertices (const Tuple &t) const
 
std::array< size_t, 2 > get_edge_vids (const Tuple &t) const
 
Tuple tuple_from_tri (size_t fid) const
 
Tuple tuple_from_vertex (size_t vid) const
 
Tuple tuple_from_edge (size_t fid, size_t local_eid) const
 
std::tuple< Tuple, size_t > tuple_from_edge (const std::array< size_t, 2 > &vids) const
 
void start_protect_attributes ()
 Start the phase where the attributes that will be modified can be recorded.
 
void release_protect_attributes ()
 End the modification phase.
 
void rollback_protected_attributes ()
 rollback the attributes that are modified if any condition failed
 
int release_vertex_mutex_in_stack ()
 
bool try_set_vertex_mutex_two_ring (const Tuple &v, int threadid)
 try lock the two-ring neighboring triangles' incident vertices
 
bool try_set_edge_mutex_two_ring (const Tuple &e, int threadid)
 try lock the two-ring neighboring triangles' incident vertices for the two ends of an edge
 
bool try_set_vertex_mutex_one_ring (const Tuple &v, int threadid)
 get the lock for one ring neighboring triangles' incident vertices
 
bool try_set_face_mutex_one_ring (const Tuple &f, int threadid)
 try lock the one-ring neighboring triangles' incident vertices.
 
void for_each_face (const std::function< void(const Tuple &)> &)
 perform the given function for each face
 
void for_each_edge (const std::function< void(const Tuple &)> &)
 perform the given function for each edge
 
void for_each_vertex (const std::function< void(const Tuple &)> &)
 perform the given function for each vertex
 

Public Attributes

AbstractAttributeContainerp_vertex_attrs = nullptr
 
AbstractAttributeContainerp_edge_attrs = nullptr
 
AbstractAttributeContainerp_face_attrs = nullptr
 
tbb::enumerable_thread_specific< std::vector< size_t > > mutex_release_stack
 
int NUM_THREADS = 0
 

Protected Member Functions

void resize_mutex (size_t v)
 

Private Member Functions

size_t get_next_empty_slot_t ()
 Get the next avaiblie global index for the triangle.
 
size_t get_next_empty_slot_v ()
 Get the next avaiblie global index for the vertex.
 
bool try_set_vertex_mutex (const Tuple &v, int threadid)
 
bool try_set_vertex_mutex (size_t vid, int threadid)
 
void unlock_vertex_mutex (const Tuple &v)
 
void unlock_vertex_mutex (size_t vid)
 

Private Attributes

vector< VertexConnectivitym_vertex_connectivity
 
vector< TriangleConnectivitym_tri_connectivity
 
std::atomic_long current_vert_size
 
std::atomic_long current_tri_size
 
tbb::spin_mutex vertex_connectivity_lock
 
tbb::spin_mutex tri_connectivity_lock
 
bool vertex_connectivity_synchronizing_flag = false
 
bool tri_connectivity_synchronizing_flag = false
 
int MAX_THREADS = 128
 
tbb::concurrent_vector< VertexMutexm_vertex_mutex
 

Member Function Documentation

◆ check_link_condition()

bool wmtk::TriMesh::check_link_condition ( const Tuple t) const

prerequisite for collapse

Parameters
tTuple referes to the edge to be collapsed
Returns
true is the link check is passed

◆ check_mesh_connectivity_validity()

bool wmtk::TriMesh::check_mesh_connectivity_validity ( ) const

verify the connectivity validity of the mesh

Note
a valid mesh can have triangles that are is_removed == true

◆ collapse_edge()

bool TriMesh::collapse_edge ( const Tuple t,
std::vector< Tuple > &  new_t 
)
virtual

Collapse an edge

Parameters
tInput Tuple for the edge to be collapsed.
[out]new_edgesa vector of Tuples refering to the triangles incident to the new vertex introduced
Note
collapse edge a,b and generate a new vertex c
Returns
if collapse succeed

◆ collapse_edge_after()

virtual bool wmtk::TriMesh::collapse_edge_after ( const Tuple t)
inlinevirtual

User specified modifications and desideratas after an edge collapse.

Parameters
theedge Tuple to be collapsed
Returns
true if the modifications succeed

◆ collapse_edge_before()

virtual bool wmtk::TriMesh::collapse_edge_before ( const Tuple t)
inlinevirtual

User specified preparations and desideratas for an edge collapse including the link check as collapse prerequisite.

Parameters
theedge Tuple to be split
Returns
true if the preparation succeed

◆ collapse_edge_conn()

void TriMesh::collapse_edge_conn ( const Tuple loc0,
std::vector< Tuple > &  new_tris,
Tuple return_t,
size_t &  new_vid,
std::vector< std::pair< size_t, TriangleConnectivity > > &  old_tris,
std::vector< std::pair< size_t, VertexConnectivity > > &  old_vertices,
std::vector< std::pair< size_t, size_t > > &  same_edge_vid_fid,
std::vector< size_t > &  n12_intersect_fids 
)

Collpase an edge connectivity part

◆ collapse_edge_rollback()

void TriMesh::collapse_edge_rollback ( size_t &  new_vid,
std::vector< std::pair< size_t, TriangleConnectivity > > &  old_tris,
std::vector< std::pair< size_t, VertexConnectivity > > &  old_vertices,
std::vector< std::pair< size_t, size_t > > &  same_edge_vid_fid,
std::vector< size_t > &  n12_intersect_fids 
)

collapse edge rollback

◆ consolidate_mesh()

void TriMesh::consolidate_mesh ( )

removing the elements that are removed

Parameters
bnd_outputwhen turn on will write the boundary vertices to "bdn_table.dmat"

◆ get_edges()

std::vector< TriMesh::Tuple > TriMesh::get_edges ( ) const

Generate a vector of Tuples for each edge

Note
ensures the fid assigned is the smallest between faces adjacent to the edge
Returns
vector of Tuples refering to unique edges

◆ get_faces()

std::vector< TriMesh::Tuple > TriMesh::get_faces ( ) const

Generate a vector of Tuples from global face index

Note
Local vid is the first of the m_idices Local eid assigned counter clockwise as in the ilustrated example
Returns
vector of Tuples refering to each face

◆ get_next_empty_slot_t()

size_t TriMesh::get_next_empty_slot_t ( )
private

Get the next avaiblie global index for the triangle.

Returns
size_t

◆ get_next_empty_slot_v()

size_t TriMesh::get_next_empty_slot_v ( )
private

Get the next avaiblie global index for the vertex.

Returns
size_t

◆ get_one_ring_edges_for_vertex()

std::vector< wmtk::TriMesh::Tuple > TriMesh::get_one_ring_edges_for_vertex ( const Tuple t) const

Get all edges that are incident to the vertex of Tuple t.

The return tuples contain the edge and the adjacent vertex: return_tuple.switch_vertex().vid == t.vid()

Parameters
ttuple pointing to a vertex
Returns
one-ring

The code below is a faster implementation but it did not give the exact same result for QSLIM. Leaving it commented out for now.

◆ get_one_ring_tris_for_vertex()

std::vector< TriMesh::Tuple > TriMesh::get_one_ring_tris_for_vertex ( const Tuple t) const

Get the one ring tris for a vertex.

Parameters
ttuple pointing to a vertex
Returns
a vector of Tuples refering to one-ring tris

◆ get_one_ring_vids_for_vertex_duplicate()

std::vector< size_t > TriMesh::get_one_ring_vids_for_vertex_duplicate ( const size_t &  t) const

Get the vids of the incident one ring tris for a vertex.

Parameters
ttuple pointing to a vertex
Returns
a vector of vids that can have duplicates

◆ get_valence_for_vertex()

size_t wmtk::TriMesh::get_valence_for_vertex ( const Tuple t) const
inline

Count the number of the one ring tris for a vertex.

Parameters
ttuple pointing to a vertex
Returns
one-ring tris number

◆ get_vertices()

std::vector< TriMesh::Tuple > TriMesh::get_vertices ( ) const

Generate a vector of Tuples from global vertex index and local edge index

Note
Each vertex generate Tuple that has the smallest fid to be among incident triangles'. Local vid to be in the same order as thier indices in the m_conn_tris. Local eid assigned counter clockwise as in the ilustrated example
Returns
vector of Tuples refering to each vertex

◆ init() [1/2]

void wmtk::TriMesh::init ( const MatrixXi &  F)

Generate the connectivity of the mesh from an IGL-style F matrix.

Parameters
Fby 3 list of vertex indices.

◆ init() [2/2]

void TriMesh::init ( size_t  n_vertices,
const std::vector< std::array< size_t, 3 > > &  tris 
)

Generate the connectivity of the mesh

Parameters
n_verticesInput number of vertices
tristriangle connectivity

◆ invariants()

virtual bool wmtk::TriMesh::invariants ( const std::vector< Tuple > &  )
inlinevirtual

User specified invariants that can't be violated.

Parameters
std::vector<Tuple>a vector of Tuples that are concerned in a given operation
Returns
true if the invairnats are not violated

◆ is_boundary_edge()

bool wmtk::TriMesh::is_boundary_edge ( const TriMesh::Tuple t) const
inline

check if edge that's represented by a Tuple is at the boundary of the mesh

Parameters
tTuple refering to an edge

◆ is_boundary_vertex()

bool wmtk::TriMesh::is_boundary_vertex ( const TriMesh::Tuple t) const
inline

check if the vertex that's represented by a Tuple is at the boundary of the mesh

Parameters
tTuple refering to an edge

◆ oriented_tri_vertices()

std::array< wmtk::TriMesh::Tuple, 3 > TriMesh::oriented_tri_vertices ( const Tuple t) const

Get the incident vertices for a triangle.

Parameters
ttuple pointing to an face
Returns
tuples of incident vertices

◆ oriented_tri_vids()

std::array< size_t, 3 > TriMesh::oriented_tri_vids ( const Tuple t) const

Get the incident vertices for a triangle.

Parameters
ttuple pointing to an face
Returns
global vids of incident vertices

◆ smooth_after()

virtual bool wmtk::TriMesh::smooth_after ( const Tuple t)
inlinevirtual

User specified modifications and desideras after an edge smooth.

Parameters
theedge Tuple to be smoothed
Returns
true if the modifications succeed

◆ smooth_before()

virtual bool wmtk::TriMesh::smooth_before ( const Tuple t)
inlinevirtual

User specified preparations and desideratas for an edge smooth.

Parameters
theedge Tuple to be smoothed
Returns
true if the preparation succeed

◆ smooth_vertex()

bool TriMesh::smooth_vertex ( const Tuple t)

Smooth a vertex

Parameters
tInput Tuple for the vertex
Note
no geometry changed here
Returns
if smooth succeed

◆ split_edge()

bool TriMesh::split_edge ( const Tuple t,
std::vector< Tuple > &  new_t 
)

Split an edge

Parameters
tInput Tuple for the edge to split.
[out]new_edgesa vector of Tuples refering to the triangles incident to the new vertex introduced
Returns
if split succeed

◆ split_edge_after()

virtual bool wmtk::TriMesh::split_edge_after ( const Tuple t)
inlinevirtual

User specified modifications and desideratas after an edge split.

Parameters
theedge Tuple to be split
Returns
true if the modifications succeed

◆ split_edge_before()

virtual bool wmtk::TriMesh::split_edge_before ( const Tuple t)
inlinevirtual

User specified preparations and desideratas for an edge split.

Parameters
theedge Tuple to be split
Returns
true if the preparation succeed

◆ split_face()

bool TriMesh::split_face ( const Tuple t,
std::vector< Tuple > &  new_t 
)

Split a face in 3 faces.

Parameters
tInput tuple for the face to split.
[out]new_tA vector of Tuples refering to the triangles incident to the new vertex. introduced
Returns
true, if split succeed
   v2
   /|\
  / | \
 /  |  \
/f1 ^ f0\

/ / \ \ // f2 \ v0 --------— v1

◆ split_face_after()

virtual bool wmtk::TriMesh::split_face_after ( const Tuple t)
inlinevirtual

User specified modifications and desideratas after a face split.

Parameters
theface Tuple to be split
Returns
true if the modifications succeed

◆ split_face_before()

virtual bool wmtk::TriMesh::split_face_before ( const Tuple t)
inlinevirtual

User specified preparations and desideratas for a face split.

Parameters
theface Tuple to be split
Returns
true if the preparation succeed

◆ swap_edge()

bool TriMesh::swap_edge ( const Tuple t,
std::vector< Tuple > &  new_t 
)

Swap an edge

Parameters
tInput Tuple for the edge to be swaped.
[out]new_edgesa vector of Tuples refering to the triangles incident to the new edge introduced
Note
swap edge a,b to edge c,d
Returns
if swap succeed

◆ swap_edge_after()

virtual bool wmtk::TriMesh::swap_edge_after ( const Tuple t)
inlinevirtual

User specified modifications and desideras after an edge swap.

Parameters
theedge Tuple to be swaped
Returns
true if the modifications succeed

◆ swap_edge_before()

bool TriMesh::swap_edge_before ( const Tuple t)
virtual

User specified preparations and desideratas for an edge swap including 1.can't swap on boundary edge. 2. when swap edge between v1, v2, there can't exist edges between the two opposite vertices v3, v4.

Parameters
theedge Tuple to be swaped
Returns
true if the preparation succeed

◆ switch_face()

std::optional< Tuple > wmtk::TriMesh::switch_face ( const Tuple t) const
inline

a duplicate of Tuple::switch_face funciton

Note
Returns nullptr if current Tuple referes to a boundary triangle

◆ tri_capacity()

size_t wmtk::TriMesh::tri_capacity ( ) const
inline

get the current largest global fid

Returns
size_t

◆ try_set_edge_mutex_two_ring()

bool TriMesh::try_set_edge_mutex_two_ring ( const Tuple e,
int  threadid 
)

try lock the two-ring neighboring triangles' incident vertices for the two ends of an edge

Parameters
eTuple refers to the edge
threadid
Returns
true if all locked successfully

◆ try_set_face_mutex_one_ring()

bool TriMesh::try_set_face_mutex_one_ring ( const Tuple f,
int  threadid 
)

try lock the one-ring neighboring triangles' incident vertices.

Parameters
fTuple refers to the face
threadid
Returns
true if all locked successfully

◆ try_set_vertex_mutex_one_ring()

bool wmtk::TriMesh::try_set_vertex_mutex_one_ring ( const Tuple v,
int  threadid 
)

get the lock for one ring neighboring triangles' incident vertices

Parameters
v
threadid
Returns
true if all succeed

◆ try_set_vertex_mutex_two_ring()

bool TriMesh::try_set_vertex_mutex_two_ring ( const Tuple v,
int  threadid 
)

try lock the two-ring neighboring triangles' incident vertices

Parameters
vTuple refers to the vertex
threadid
Returns
true if all locked successfully

◆ tuple_from_edge() [1/2]

Tuple wmtk::TriMesh::tuple_from_edge ( size_t  fid,
size_t  local_eid 
) const
inline

Generate a edge Tuple using global fid and local eid

Parameters
fidglobale fid for the triangle
local_eidlocal eid
Returns
tuple refers to the edge

◆ tuple_from_edge() [2/2]

TriMesh::Tuple TriMesh::tuple_from_edge ( size_t  vid1,
size_t  vid2,
size_t  fid 
) const

Generate a tuple using local vid and global fid

Parameters
vid1,vid2are local vids TODO: these are global vids
fidglobale fid for the triangle
Note
tuple refers to vid1
Returns
vector of Tuples

◆ tuple_from_tri()

Tuple wmtk::TriMesh::tuple_from_tri ( size_t  fid) const
inline

Generate a face Tuple using global fid

Parameters
fidglobal fid for the triangle
Note
Use the local vid of the first vertex among the incident vertices in the connectivity of the triangle
Returns
a face Tuple

◆ tuple_from_vertex()

Tuple wmtk::TriMesh::tuple_from_vertex ( size_t  vid) const
inline

Generate avertex Tuple using local vid and global fid

Parameters
vidglobale vid for the triangle
Note
tuple refers to vid

◆ vert_capacity()

size_t wmtk::TriMesh::vert_capacity ( ) const
inline

get the current largest global vid

Returns
size_t

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