Skip to content

Spelling correction #9648

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
sloriot merged 2 commits into from
Sep 14, 2026
Merged

Spelling correction #9648

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
f91b11d
Spelling correction
albert-github Sep 10, 2026
d61a896
Update Partition_2/include/CGAL/Partition_2/partition_optimal_convex_2.h
albert-github Sep 10, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions Partition_2/include/CGAL/Partition_2/partition_optimal_convex_2.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -526,11 +526,11 @@ OutputIterator partition_optimal_convex_2(InputIterator first,

// The algorithm is sensitive to the choice of starting vertex (vertex 0).
// When vertex 0 is a non-convex or "awkward" vertex the closing boundary
// edge (n-1 -> 0) is mis-classified during preprocessing, which can cause
// non-simple or non-convex pieces to be returned. Normalising the polygon
// edge (n-1 -> 0) is miss-classified during preprocessing, which can cause
Comment thread
albert-github marked this conversation as resolved.
Outdated
// non-simple or non-convex pieces to be returned. Normalizing the polygon
Comment thread
lrineau marked this conversation as resolved.
// so that vertex 0 is the lexicographically smallest vertex guarantees it
// is a convex vertex (true for any simple polygon), satisfying the
// algorithm's anchor assumption. See https://github.com/CGAL/cgal/issues/9322.
// algorithm's anchor assumption. See https://github.com/CGAL/cgal/issues/9322.
//
// Note: std::rotate is safe here because diagonal lists are not yet
// populated (that happens in partition_opt_cvx_preprocessing below).
Expand Down
Loading