songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Creating a boolean operations object from map overlay. 

It gives the user the possibility to create the boolean oepration
object with the walk along aline point-location, which is more efficient when
using sweep-line.
This commit is contained in:
Ester Ezra 2002-08-07 14:17:40 +00:00
parent cc01fbf138
commit ed35455ece
1 changed files with 112 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

112
Packages/Map_overlay_2/examples/Boolean_operations_2/example2.C Normal file
View File

@ -0,0 +1,112 @@
#include <CGAL/basic.h> //CGAL definitions that need to be before anything else
#include <CGAL/Cartesian.h>
#include <CGAL/Quotient.h>
#include <CGAL/Pm_walk_along_line_point_location.h>
#include <CGAL/Bop_default_dcel.h>
#include <CGAL/Map_overlay_default_notifier.h>
#include <CGAL/Map_overlay.h>
#include <CGAL/Boolean_operations_2.h>
#include <CGAL/Arr_segment_exact_traits.h>
#include <CGAL/Planar_map_2.h>
#include <iostream.h>
#include <vector>
#include <list>
// uncomment if LEDA is installed.
//#include <CGAL/IO/cgal_window.h> //used for visualization -
//#include <CGAL/IO/Pm_Window_stream.h>
typedef CGAL::Quotient<int> NT;
typedef CGAL::Cartesian<NT> R;
typedef CGAL::Arr_segment_exact_traits<R> Traits;
typedef Traits::Point Point;
typedef Traits::X_curve X_curve;
typedef Traits::Curve Curve;
typedef CGAL::Bop_default_dcel<Traits> Dcel;
typedef CGAL::Planar_map_2<Dcel,Traits> Planar_map;
typedef CGAL::Map_overlay_2<Planar_map> MapOverlay;
typedef CGAL::Boolean_operations_2<MapOverlay> Bops;
typedef CGAL::Pm_walk_along_line_point_location<Planar_map> PmWalkPL;
typedef Bops::Faces_container Faces_container;
typedef Bops::Halfedges_container Halfedges_container;
typedef Bops::Vertices_container Vertices_container;
using std::cin;
using std::cout;
using std::endl;
int main()
{
Planar_map pm1, pm2;
int num_curves1, num_curves2;
NT x1, y1, x2, y2;
cin >> num_curves1;
std::vector<Curve> curves;
while (num_curves1--) {
cin >> x1 >> y1 >> x2 >> y2;
Point p1(x1,y2), p2(x2,y2);
curves.push_back(X_curve(p1, p2));
}
Traits traits;
CGAL::sweep_to_construct_planar_map_2(curves.begin(),
curves.end(), traits, pm1);
curves.clear();
cin >> num_curves2;
while (num_curves2--) {
cin >> x1 >> y1 >> x2 >> y2;
Point p1(x1,y2), p2(x2,y2);
curves.push_back(X_curve(p1, p2));
}
CGAL::sweep_to_construct_planar_map_2(curves.begin(),
curves.end(), traits, pm2);
// ignoring unbounded face in boolean operations.
pm1.unbounded_face()->set_ignore_bop(false);
pm2.unbounded_face()->set_ignore_bop(false);
PmWalkPL ovl_walk;
MapOverlay map1(pm1), map2(pm2);
MapOverlay map_overlay(map1, map2, &ovl_walk);
cout<<"Creating a boolean-operation object efficiently"<<endl;
Bops bop(map_overlay);
Halfedges_container halfedges_result;
bop.intersection(halfedges_result);
for (Halfedges_container::iterator h_iter=halfedges_result.begin();
h_iter!=halfedges_result.end(); ++h_iter)
cout << (*h_iter)->curve() << endl;
// uncomment if LEDA is installed.
//CGAL::Window_stream W(700, 700);
//W.init(-10,10,-10);
//W.set_node_width(3);
//W.display();
//W<<CGAL::BLUE;
//W<<pm1;
//W<<CGAL::RED;
//W<<pm2;
// drawing all edges in the intersection of pm1 and pm2.
//for (Halfedges_container::iterator h_iter=halfedges_result.begin();
// h_iter!=halfedges_result.end(); ++h_iter){
// W << CGAL::PURPLE;
// W << (*h_iter)->curve();
//}
return 0;
}