ArrangementUtils.hpp File Reference

Define utils used by arrangements. More...

#include <utilities/Exception.hpp>
#include <utilities/IndexDef.hpp>
#include <bitset>
#include <deque>
#include <vector>

Include dependency graph for ArrangementUtils.hpp:

This graph shows which files directly or indirectly include this file:

Classes
struct	AMCAX::Meshing::Arrangements::MeshArrangements_Stats
struct	AMCAX::Meshing::Arrangements::Labels
	Each output triangle has a surface label and inside label. More...
struct	AMCAX::Meshing::Arrangements::SourceFaceInfo< TriIndexT >
	The faces index of input meshes. More...
struct	AMCAX::Meshing::Arrangements::InterSegments< TriIndexT >
	The intersection segments information of result mesh. More...

Namespaces
namespace	AMCAX
	Namespace of all interface in the AMCAX kernel.
namespace	AMCAX::Meshing
	Namespace of all interface in the AMCAX Meshing module.

Typedefs
using	AMCAX::Meshing::Arrangements::Label = std::bitset< NBIT >

Variables
constexpr int	AMCAX::Meshing::Arrangements::NBIT = 32

Detailed Description

Define utils used by arrangements.

Copyright

Copyright (c) 2023 Hefei Jiushao Intelligent Technology Co., Ltd. All rights reserved.

This file is part of AMCAX kernel.

Typedef Documentation

Label

using AMCAX::Meshing::Arrangements::Label = typedef std::bitset<NBIT>

• Label for each triangle in arrangements (boolean, and other applications). Label indicates where this triangle locates on. (For example, if Label[0] and Label[1] is true, this triangle locates on triangle soup with index 0 and triangle soup with index 1 at the same time.)
• Users can use this label to transfer attributes from input triangle soups to the output triangle soup.
• Consider efficiency, we limit maximal label count to be less than NBIT(32).