Skip to content

Commit

Permalink
Fixed code and moved into a header
Browse files Browse the repository at this point in the history
  • Loading branch information
@afabri
afabri committed Apr 12, 2024
1 parent 021d0f9 commit 67a9aa8
Show file tree
Hide file tree
Showing 2 changed files with 397 additions and 177 deletions.
196 changes: 19 additions & 177 deletions Triangulation_2/examples/Triangulation_2/boolean_constrained_plus.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -3,214 +3,56 @@
#include <CGAL/Polygon_with_holes_2.h>
#include <CGAL/Multipolygon_with_holes_2.h>

#include <CGAL/Constrained_Delaunay_triangulation_2.h>
#include <CGAL/Constrained_triangulation_plus_2.h>
#include <CGAL/Triangulation_vertex_base_with_info_2.h>
#include <CGAL/Triangulation_face_base_with_info_2.h>
#include <CGAL/draw_constrained_triangulation_2.h>

#include <CGAL/Triangulation_2/Boolean.h>
#include <CGAL/draw_constrained_triangulation_2.h>
#include <CGAL/draw_multipolygon_with_holes_2.h>

#include <CGAL/IO/WKT.h>

#include <vector>
#include <cassert>

#include <iostream>
#include <sstream>

#include <boost/property_map/property_map.hpp>


struct Boolean_cdt_2 {


struct FaceInfo {

FaceInfo()
{}

int nesting_level[2];

bool in_domain(int i) const
{
return nesting_level[i] % 2 == 1;
}

template <typename Fct>
bool in_domain(const Fct& fct) const
{
return fct(in_domain(0), in_domain(1));
}

};

typedef CGAL::Exact_predicates_exact_constructions_kernel K;
typedef K::Point_2 Point_2;
using Polygon_with_holes_2 = CGAL::Polygon_with_holes_2<K>;
using Multipolygon_with_holes_2 = CGAL::Multipolygon_with_holes_2<K>;


typedef CGAL::Exact_intersections_tag Itag;
typedef CGAL::Triangulation_vertex_base_2<K> Vb;
typedef CGAL::Triangulation_face_base_with_info_2<FaceInfo,K> Fbb;
typedef CGAL::Constrained_triangulation_face_base_2<K,Fbb> Fb;
typedef CGAL::Triangulation_data_structure_2<Vb,Fb> Tds;
typedef CGAL::Constrained_Delaunay_triangulation_2<K,Tds,Itag> CDT;
typedef CGAL::Constrained_triangulation_plus_2<CDT> CDTplus;
typedef CDTplus::Face_handle Face_handle;
typedef CDTplus::Constraint_id Constraint_id;
typedef CDTplus::Edge Edge;
typedef CDTplus::Context Context;


CDTplus cdt;
std::set<Constraint_id> idA, idB;

Boolean_cdt_2() = default;

void operator()(const Multipolygon_with_holes_2& pA, const Multipolygon_with_holes_2& pB)
{
for(const auto& pwh : pA.polygons_with_holes()){
Constraint_id cidA = cdt.insert_constraint(pwh.outer_boundary().vertices_begin(), pwh.outer_boundary().vertices_end(), true);
idA.insert(cidA);
for(auto const& hole : pwh.holes()){
cidA = cdt.insert_constraint(hole.vertices_begin(), hole.vertices_end(), true);
idA.insert(cidA);
}
}

for(const auto& pwh : pB.polygons_with_holes()){
Constraint_id cidB = cdt.insert_constraint(pwh.outer_boundary().vertices_begin(), pwh.outer_boundary().vertices_end(), true);
idB.insert(cidB);
for(auto const& hole : pwh.holes()){
cidB = cdt.insert_constraint(hole.vertices_begin(), hole.vertices_end(), true);
idB.insert(cidB);
}
}

mark_domains(idA, 0);
mark_domains(idB, 1);
}

void
mark_domains(Face_handle start,
int index,
std::list<Edge>& border,
const std::set<Constraint_id>& cids,
int aorb)
{
if(start->info().nesting_level[aorb] != -1){
return;
}
std::list<Face_handle> queue;
queue.push_back(start);

while(! queue.empty()){
Face_handle fh = queue.front();
queue.pop_front();
if(fh->info().nesting_level[aorb] == -1){
fh->info().nesting_level[aorb] = index;
for(int i = 0; i < 3; i++){
Edge e(fh,i);
Face_handle n = fh->neighbor(i);
if(n->info().nesting_level[aorb] == -1){
if(cdt.is_constrained(e)){
for(Context c : cdt.contexts(e.first->vertex(cdt.cw(e.second)),
e.first->vertex(cdt.ccw(e.second)))){
if(cids.find(c.id()) != cids.end()){
border.push_back(e);
}
}
}else{
queue.push_back(n);
}
}
}
}
}
}




void
mark_domains(const std::set<Constraint_id>& cids, int aorb)
{
for(Face_handle f : cdt.all_face_handles()){
f->info().nesting_level[aorb] = -1;
}

std::list<Edge> border;
mark_domains(cdt.infinite_face(), 0, border, cids, aorb);
while(! border.empty()){
Edge e = border.front();
border.pop_front();
Face_handle n = e.first->neighbor(e.second);
if(n->info().nesting_level[aorb] == -1){
mark_domains(n, e.first->info().nesting_level[aorb]+1, border, cids, aorb);
}
}
}

template <typename Fct>
void to_stl(const Fct& fct)
{
std::ofstream out("cdt.stl");
out.precision(17);
out << "solid outside\n";
for(auto fit = cdt.finite_faces_begin(); fit != cdt.finite_faces_end(); ++fit){
if(fit->info().in_domain(fct)){
out << "facet normal 0 0 0\n"
<< "outer loop\n";
for(int i=0; i < 3; ++i){
out << "vertex " << fit->vertex(i)->point() << " 0\n";
}
out << "endloop\n"
<< "endfacet\n";
}
}
out << "endsolid" << std::endl;
out.close();
}

};

using K = CGAL::Exact_predicates_exact_constructions_kernel;
using Polygon_with_holes_2 = CGAL::Polygon_with_holes_2<K>;
using Multipolygon_with_holes_2 = CGAL::Multipolygon_with_holes_2<K>;



int
main( )
{

Boolean_cdt_2 bcdt;

CGAL::Triangulations::Boolean<K> bops;

Multipolygon_with_holes_2 pA, pB;


{
std::istringstream is("MULTIPOLYGON( ((0 0, 20 0, 20 30, 0 30, 0 0), (1 1, 1 2, 2 2, 2 1, 1 1 ) ) , (( 50 0, 60 0, 60 60, 50 60)) )");
//std::istringstream is("MULTIPOLYGON( ((0 0, 2 0, 2 3, 0 3) ) )"); // (0.1 0.1, 0.1 0.4, 0.4 0.1)
CGAL::IO::read_multi_polygon_WKT(is, pA);
}

{
std::istringstream is("MULTIPOLYGON( ((10 1, 30 1, 30 2, 20 2, 20 4, 10 4)) )");
//std::istringstream is("MULTIPOLYGON( ((2 1, 3 1, 3 2, 2 2)) ");
CGAL::IO::read_multi_polygon_WKT(is, pB);
}


bcdt(pA,pB);

std::map<Boolean_cdt_2::Face_handle,bool> map;
for(auto fh : bcdt.cdt.finite_face_handles()){
map[fh] = fh->info().in_domain(0) || fh->info().in_domain(1);
}

bcdt.to_stl([](bool a, bool b){ return a || b;} );
bops.insert(pA,pB);
Multipolygon_with_holes_2 mpwh = bops([](bool a, bool b){ return a || b;});
CGAL::IO::write_multi_polygon_WKT(std::cout, mpwh);
CGAL::draw(mpwh);

CGAL::draw(bcdt.cdt, boost::make_assoc_property_map(map));
/*
std::map<Boolean_cdt_2::Face_handle,bool> map;
for(auto fh : bops.cdt.finite_face_handles()){
map[fh] = fh->info().in_domain(0) || fh->info().in_domain(1);
assert(map[fh] == (fh->info().label != 0));
}
CGAL::draw(bops.cdt, boost::make_assoc_property_map(map));
*/
return 0;
}
Loading

0 comments on commit 67a9aa8

Please sign in to comment.