From 165408e7bbede1f1f8c124ab08279627e97cbcf7 Mon Sep 17 00:00:00 2001 From: Raphael Delhome Date: Tue, 10 Oct 2023 06:57:30 +0000 Subject: [PATCH] Apply 2 suggestion(s) to 1 file(s) --- src/algorithm/visibility.cpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/algorithm/visibility.cpp b/src/algorithm/visibility.cpp index 8a68045b..2fa640f3 100644 --- a/src/algorithm/visibility.cpp +++ b/src/algorithm/visibility.cpp @@ -77,7 +77,7 @@ visibility(const Geometry &polygon, const Geometry &point, NoValidityCheck) // Create Triangular Expansion Visibility object. TEV tev(arr); - // If the point is within a face, we can compute the visbility that way + // If the point is within a face, we can compute the visibility that way if (face != nullptr) { fh = tev.compute_visibility(queryPoint, *face, output_arr); } else { @@ -161,7 +161,7 @@ visibility(const Geometry &polygon, const Geometry &pointA, hit != pwh.holes_end(); ++hit) CGAL::insert(arr, hit->edges_begin(), hit->edges_end()); - // If the point in a boundary segment, find the corresponding half edge + // If the point is in a boundary segment, find the corresponding half edge Halfedge_const_handle he = arr.halfedges_begin(); while (he->source()->point() != startPoint || he->target()->point() != endPoint) {