public interface TraversalVisitor
boolean visit(QuadEdgeTriangle currTri, int edgeIndex, QuadEdgeTriangle neighbTri)
QuadEdgeSubdivision. An implementation of this method may perform processing on the current triangle. It must also decide whether a neighbouring triangle should be added to the queue so its neighbours are visited. Often it will perform processing on the neighbour triangle as well, in order to mark it as processed (visited) and/or to determine if it should be visited. Note that choosing not to visit the neighbouring triangle is the terminating condition for many traversal algorithms. In particular, if the neighbour triangle has already been visited, it should not be visited again.
currTri- the current triangle being processed
edgeIndex- the index of the edge in the current triangle being traversed
neighbTri- a neighbouring triangle next in line to visit
Copyright © 2020. All rights reserved.