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

support for drawing bisector ray between segments 

Signed-off-by: Panagiotis Cheilaris <philaris@cs.ntua.gr>
This commit is contained in:
Panagiotis Cheilaris 2013-02-06 11:57:30 +01:00
parent b583d26409
commit 000facc886
1 changed files with 42 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

66
Segment_Delaunay_graph_Linf_2/include/CGAL/Segment_Delaunay_graph_Linf_2/Constructions_C2.h
View File

@ -10,6 +10,8 @@
#include <CGAL/Polychain_2.h>
#include <CGAL/intersections.h>
#include <CGAL/Segment_Delaunay_graph_Linf_2/Bisector_Linf.h>
namespace CGAL {
@ -108,7 +110,7 @@ public:
};
//-----------------------------------------------------------------------
// Segment Delaunay graph Voronoi circle
//-----------------------------------------------------------------------
@ -415,11 +417,14 @@ public:
typedef typename Gt::Point_2 Point_2;
typedef typename Gt::Direction_2 Direction_2;
typedef typename Gt::Line_2 Line_2;
typedef typename Gt::Segment_2 Segment_2;
typedef typename Gt::Segment_2 Segment_2;
typedef typename Gt::Construct_svd_vertex_2 Construct_svd_vertex_2;
typedef CGAL::Polychainline_2<Gt> Polychainline;
typedef CGAL::Polychainray_2<Gt> Polychainray;
typedef Polychainray result_type;
typedef Bisector_Linf<Gt> Bisector_Linf_Type;
typedef typename Gt::Compare_x_2 Compare_x_2;
typedef typename Gt::Compare_y_2 Compare_y_2;
typedef typename Gt::Equal_2 Equal_2;
@ -434,21 +439,20 @@ public:
CGAL_SDG_DEBUG( std::cout << "debug construct bisector ray "
<< "p=" << p << " q=" << q << " r=" << r << std::endl; );
CGAL_assertion( !(p.is_segment() && q.is_segment()) );
// compute pqr vertex
Point_2 v = Construct_svd_vertex_2()(p, q, r);
CGAL_SDG_DEBUG( std::cout << "debug construct bisector ray "
<< "p=" << p << " q=" << q << " r=" << r
CGAL_SDG_DEBUG( std::cout << "debug construct bisector ray "
<< "p=" << p << " q=" << q << " r=" << r
<< " has v(pqr)=" << v << std::endl; );
//CGAL_SDG_DEBUG( std::cout << "debug in ray computing bisector" << std::endl; );
//CGAL_SDG_DEBUG( std::cout
// << "debug in ray computing bisector" << std::endl; );
// compute oriented bisector between p and q
if ( p.is_point() and q.is_point() ) {
Point_2 pp = p.point();
if ( p.is_point() and q.is_point() ) {
Point_2 pp = p.point();
Point_2 pq = q.point();
Compare_x_2 compare_x_2;
@ -530,14 +534,15 @@ public:
Polychainray pcr(points, points+npts, d);
CGAL_SDG_DEBUG( std::cout << "debug construct bisector ray is " << pcr << std::endl; );
CGAL_SDG_DEBUG( std::cout
<< "debug construct bisector ray is " << pcr << std::endl; );
return pcr;
}
}
if ( (p.is_point() and q.is_segment())
or (p.is_segment() and q.is_point()) ) {
Point_2 pnt = (p.is_point()) ? p.point() : q.point();
Segment_2 seg = (p.is_segment()) ? p.segment() : q.segment();
@ -710,22 +715,35 @@ public:
npts = 1;
}
}
Polychainray pcr(points, points+npts, d);
CGAL_SDG_DEBUG( std::cout << "debug construct bisector ray is " << pcr << std::endl; );
CGAL_SDG_DEBUG( std::cout << "debug construct bisector ray is "
<< pcr << std::endl; );
return pcr;
}
}
// this part should never be reached
CGAL_SDG_DEBUG( std::cout << "debug construct bisector ray error " << std::endl; );
if (p.is_segment() and q.is_segment()) {
CGAL_SDG_DEBUG(std::cout
<< "debug construct bisector ray: p, q are segments"
<< std::endl ; ) ;
Bisector_Linf_Type bisector_linf;
Polychainline full_bisec = bisector_linf(p,q);
Point_2 points[1];
points[0] = v;
Polychainray pcr(points, points+1, full_bisec.get_outgoing());
CGAL_SDG_DEBUG( std::cout << "debug construct bisector ray is "
<< pcr << std::endl; );
return pcr;
}
// the following code should never be executed
CGAL_SDG_DEBUG( std::cout
<< "debug construct bisector ray error " << std::endl; );
CGAL_assertion(false);
return Polychainray();
}
};