RN_NET::TRIANGULATOR_STATE Class Reference

Public Member Functions
void	Clear ()
void	AddNode (CN_ANCHOR_PTR aNode)
void	Triangulate (std::vector< CN_EDGE > &mstEdges)

Private Member Functions
bool	areNodesColinear (const std::vector< CN_ANCHOR_PTR > &aNodes) const

Private Attributes
std::multiset< CN_ANCHOR_PTR, CN_PTR_CMP >	m_allNodes

Detailed Description

Definition at line 135 of file ratsnest_data.cpp.

Member Function Documentation

AddNode()

void RN_NET::TRIANGULATOR_STATE::AddNode ( CN_ANCHOR_PTR  aNode )

inline

Definition at line 169 of file ratsnest_data.cpp.

 {
 m_allNodes.insert( aNode );
 }

areNodesColinear()

bool RN_NET::TRIANGULATOR_STATE::areNodesColinear ( const std::vector< CN_ANCHOR_PTR > &  aNodes ) const

inlineprivate

Definition at line 143 of file ratsnest_data.cpp.

 {
 if ( aNodes.size() <= 2 )
 return true;

 const VECTOR2I p0( aNodes[0]->Pos() );
 const VECTOR2I v0( aNodes[1]->Pos() - p0 );

 for( unsigned i = 2; i < aNodes.size(); i++ )
 {
 const VECTOR2I v1 = aNodes[i]->Pos() - p0;

 if( v0.Cross( v1 ) != 0 )
 return false;
 }

 return true;
 }

References VECTOR2< T >::Cross().

Clear()

void RN_NET::TRIANGULATOR_STATE::Clear ( )

inline

Definition at line 164 of file ratsnest_data.cpp.

 {
 m_allNodes.clear();
 }

Triangulate()

void RN_NET::TRIANGULATOR_STATE::Triangulate ( std::vector< CN_EDGE > &  mstEdges )

inline

Definition at line 174 of file ratsnest_data.cpp.

 {
 std::vector<double> node_pts;
 std::vector<CN_ANCHOR_PTR> anchors;
 std::vector< std::vector<CN_ANCHOR_PTR> > anchorChains( m_allNodes.size() );

 node_pts.reserve( 2 * m_allNodes.size() );
 anchors.reserve( m_allNodes.size() );

 CN_ANCHOR_PTR prev = nullptr;

 for( const CN_ANCHOR_PTR& n : m_allNodes )
 {
 if( !prev || prev->Pos() != n->Pos() )
 {
 node_pts.push_back( n->Pos().x );
 node_pts.push_back( n->Pos().y );
 anchors.push_back( n );
 prev = n;
 }

 anchorChains[anchors.size() - 1].push_back( n );
 }

 if( anchors.size() < 2 )
 {
 return;
 }
 else if( areNodesColinear( anchors ) )
 {
 // special case: all nodes are on the same line - there's no
 // triangulation for such set. In this case, we sort along any coordinate
 // and chain the nodes together.
 for( size_t i = 0; i < anchors.size() - 1; i++ )
 {
 const CN_ANCHOR_PTR& src = anchors[i];
 const CN_ANCHOR_PTR& dst = anchors[i + 1];
 mstEdges.emplace_back( src, dst, src->Dist( *dst ) );
 }
 }
 else
 {
 delaunator::Delaunator delaunator( node_pts );
 auto& triangles = delaunator.triangles;

 for( size_t i = 0; i < triangles.size(); i += 3 )
 {
 CN_ANCHOR_PTR src = anchors[triangles[i]];
 CN_ANCHOR_PTR dst = anchors[triangles[i + 1]];
 mstEdges.emplace_back( src, dst, src->Dist( *dst ) );

 src = anchors[triangles[i + 1]];
 dst = anchors[triangles[i + 2]];
 mstEdges.emplace_back( src, dst, src->Dist( *dst ) );

 src = anchors[triangles[i + 2]];
 dst = anchors[triangles[i]];
 mstEdges.emplace_back( src, dst, src->Dist( *dst ) );
 }

 for( size_t i = 0; i < delaunator.halfedges.size(); i++ )
 {
 if( delaunator.halfedges[i] == delaunator::INVALID_INDEX )
 continue;

 const CN_ANCHOR_PTR& src = anchors[triangles[i]];
 const CN_ANCHOR_PTR& dst = anchors[triangles[delaunator.halfedges[i]]];
 mstEdges.emplace_back( src, dst, src->Dist( *dst ) );
 }
 }

 for( size_t i = 0; i < anchorChains.size(); i++ )
 {
 std::vector<CN_ANCHOR_PTR>& chain = anchorChains[i];

 if( chain.size() < 2 )
 continue;

 std::sort( chain.begin(), chain.end(),
 [] ( const CN_ANCHOR_PTR& a, const CN_ANCHOR_PTR& b )
 {
 return a->GetCluster().get() < b->GetCluster().get();
 } );

 for( unsigned int j = 1; j < chain.size(); j++ )
 {
 const CN_ANCHOR_PTR& prevNode = chain[j - 1];
 const CN_ANCHOR_PTR& curNode = chain[j];
 int weight = prevNode->GetCluster() != curNode->GetCluster() ? 1 : 0;
 mstEdges.emplace_back( prevNode, curNode, weight );
 }
 }
 }

Member Data Documentation

m_allNodes

std::multiset<CN_ANCHOR_PTR, CN_PTR_CMP> RN_NET::TRIANGULATOR_STATE::m_allNodes

private

Definition at line 138 of file ratsnest_data.cpp.

---

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

• ratsnest_data.cpp