Repository navigation
Voronoi diagrams and Delaunay triangulations - #1545
Merged
Merged
Conversation
added 8 commits
June 13, 2016 09:07
jpolchlo
changed the title
| * incident on vertex i may be visited by repeated application of the rotCCWDest() method of | ||
| * HalfEdge on faceIncidentToVertex(i). | ||
| */ | ||
| val faceIncidentToVertex = Map.empty[Int,HalfEdge[Int,Point]] |
Member
There was a problem hiding this comment.
Shouldn't have public mutable maps (same for above)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR introduces Voronoi diagrams and Delaunay triangulations to the vector package. This includes the half-edge structure for mesh representation, and (eventually) distributed algorithms for computing Voronoi diagrams. See the documentation provided in this PR for details.