53 typedef std::pair<uint64_t, uint64_t> EdgeIndex;
72 typedef std::vector<IsoVertex> IsoVertexVector;
74 typedef std::map<EdgeIndex, std::size_t> EdgeVertexMap;
76 typedef std::vector<std::vector<std::size_t> > PolygonList;
78 typedef std::vector<IsoEdge> IsoEdgeList;
81 void sanity_checks (
void);
84 EdgeVertexMap* edgemap, IsoVertexVector* isovertices);
85 bool is_isovertex_on_edge (
int mc_index,
int edge_id);
87 int edge_id, EdgeIndex* edge_index, EdgeInfo* edge_info);
89 int face_id, IsoEdgeList* isoedges,
bool descend_only);
90 void get_isovertex (EdgeIndex
const& edge_index,
91 int edge_id, IsoVertex* iso_vertex);
93 EdgeVertexMap
const& edgemap, PolygonList* polygons);
94 void compute_triangulation(IsoVertexVector
const& isovertices,
97 std::size_t lookup_edge_vertex (EdgeVertexMap
const& edgemap,
98 EdgeIndex
const& edge);
99 void find_twin_vertex(EdgeInfo
const& edge_info,
100 EdgeIndex* twin, EdgeInfo* twin_info);
Value const * binary_search(std::vector< std::pair< Key, Value > > const &vec, Key const &key)
Algorithm that finds the value corresponding to a key in sorted vector of key-value pairs.