Skip to content

Conversation

jasonsurratt
Copy link
Collaborator

No description provided.

1. Provides constrained delaunay triangulation & tests of small/simple
   polygons. No testing has been done with large/complex polygons.
2. This does not handle overlapping edges or vertices.
1. Haven't run any real world data through it yet, but the test cases
   are all passing as expected.
1. General house keeping in the constrained triangulation code.
@coveralls
Copy link

coveralls commented May 29, 2018

Pull Request Test Coverage Report for Build 74

  • 518 of 648 (79.94%) changed or added relevant lines in 9 files are covered.
  • 4 unchanged lines in 2 files lost coverage.
  • Overall coverage increased (+0.8%) to 77.442%

Changes Missing Coverage Covered Lines Changed/Added Lines %
geom.go 42 50 84.0%
planar/triangulate/quadedge/quadedgesubdivision.go 30 41 73.17%
planar/triangulate/constraineddelaunay/triangle.go 56 68 82.35%
planar/triangulate/constraineddelaunay/triangulator.go 362 461 78.52%
Files with Coverage Reduction New Missed Lines %
planar/triangulate/quadedge/debug.go 2 76.67%
planar/triangulate/quadedge/quadedge.go 2 80.0%
Totals Coverage Status
Change from base Build 72: 0.8%
Covered Lines: 3711
Relevant Lines: 4792

💛 - Coveralls

Copy link
Member

@gdey gdey left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I skimmed over the files in the triangulate directory, as they appeared to be the same as the fields in #10. The comment there would apply here as well.

Look over things, I wondering if a better package layout would be:
planer/triangulate/delaunay for the Delaunay package. and planer/triangulate/delaunay/constrained for the constrained Delaunay package?


/*
locateEdgeByVertex finds a quad edge that has this vertex as Orig(). This will
not be a unique edge.
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This should be for LocateSegment not locateEdgeByVertex

return nil
}

// TriangulatePseudoPolygon
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Should this be:

// triangulatePseudoPolygon

Copy link
Member

@gdey gdey left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

There is just a minor style thing, infinite loops in go are generally written as:

for {
…
}

for !done {

for true {
base = idt.subdiv.Connect(e, base.Sym())
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

change this to:

for {

For infinite loops in go you don't specify the conditional value.

@gdey gdey closed this Jul 26, 2018
@gdey
Copy link
Member

gdey commented Jul 26, 2018

This pull request has been merge with f174354

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants