CGAL users discussion list

[Efi Fogel <>]

Iterate over the halfedges along the CCBs of one face; for each halfedge h check whether the incident face of the twin halfedge of h is identical to the other face.

   ____  _        ____             _
  /_____/_) o    /__________  __  //
 (____ (   (    (    (_/ (_/-(-'_(/
                         _/

On Fri, 30 Jun 2023 at 11:52, XIAOWEI XING <> wrote:

Greetings,

I would like to check if two faces share a common edge in line arrangement in CGAL. Currently, I have a line arrangement as follows.

#include <vector>

#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Arr_non_caching_segment_traits_2.h>
#include <CGAL/Arrangement_2.h>

typedef CGAL::Exact_predicates_inexact_constructions_kernel CGAL_kernel;
typedef CGAL_kernel::Point_2 CGAL_point_2;
typedef CGAL_kernel::Segment_2 CGAL_segment_2;

typedef CGAL::Arr_non_caching_segment_traits_2<CGAL_kernel> CGAL_traits;
typedef CGAL::Arrangement_2<CGAL_traits> Arrangement;

int main() {
    CGAL_point_2 p00(0, 0), p01(2, 0), p02(2, 2), p03(0, 2);
    CGAL_point_2 p10(0, 1.5), p11(1.5, 2), p20(1.5, 0), p21(0.5, 2);
    std::vector<CGAL_segment_2> segments = {
        CGAL_segment_2(p00, p01), CGAL_segment_2(p00, p03),
        CGAL_segment_2(p02, p01), CGAL_segment_2(p02, p03),
        CGAL_segment_2(p10, p11), CGAL_segment_2(p20, p21)
    };
    Arrangement arr;
    CGAL::insert(arr, segsegs.begin(), segsegs.end());
    int id1 = 0;
    for (auto f1 = arr.faces_begin(); f1 != arr.faces_end(); ++f1) {
        int id2 = 0;
        for (auto f2 = arr.faces_begin(); f2 != arr.faces_end(); ++f2) {
            if (id2 == id1) continue;
            //
            // Is there a function to check if these two faces share a common edge?
            //
            id2 += 1;
        }
        id1 += 1;
    }

    return 0;
}

I considered to compare the edges of a face with the edges of another face. But I am not sure if there is a better method.

Thanks a lot.

Yours sincerely,

Xiaowei Xing

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://sympa.inria.fr/sympa/info/cgal-discuss