void * getDirectedEdge(Vector3 const & e0, Vector3 const & e1) const
{
typedef std::pair<EdgeMap::const_iterator, EdgeMap::const_iterator> IteratorRange;
Long3Pair base_key(toGrid(e0), toGrid(e1));
// Every edge within welding distance of the given edge must be inside a neighbor of the grid cell containing the edge
for (int dx0 = -1; dx0 <= 1; ++dx0)
for (int dy0 = -1; dy0 <= 1; ++dy0)
for (int dz0 = -1; dz0 <= 1; ++dz0)
for (int dx1 = -1; dx1 <= 1; ++dx1)
for (int dy1 = -1; dy1 <= 1; ++dy1)
for (int dz1 = -1; dz1 <= 1; ++dz1)
{
Long3Pair key(Long3(base_key.first.x + dx0, base_key.first.y + dy0, base_key.first.z + dz0),
Long3(base_key.second.x + dx1, base_key.second.y + dy1, base_key.second.z + dz1));
IteratorRange nbrs = edge_map.equal_range(key);
for (EdgeMap::const_iterator ni = nbrs.first; ni != nbrs.second; ++ni)
{
if ((ni->second.e0 - e0).squaredLength() <= squared_weld_radius
&& (ni->second.e1 - e1).squaredLength() <= squared_weld_radius)
return ni->second.edge;
}
}
return NULL;
}
