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

create compute_pss_bisectors function in ring 

Signed-off-by: Panagiotis Cheilaris <philaris@cs.ntua.gr>
This commit is contained in:
Panagiotis Cheilaris 2014-06-11 14:12:27 +02:00
parent 2ed35b7681
commit 23d7be438b
1 changed files with 10 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
Segment_Delaunay_graph_Linf_2/include/CGAL/Segment_Delaunay_graph_Linf_2/Voronoi_vertex_ring_C2.h
View File

@ -507,22 +507,27 @@ private:
v_type = PSS;
bool pq =
const bool pq =
same_points(p, q.source_site()) || same_points(p, q.target_site());
bool pr =
const bool pr =
same_points(p, r.source_site()) || same_points(p, r.target_site());
Point_2 pp = p.point();
if ( pq && pr ) {
// philaris: result should be point p
const Point_2 pp = p.point();
ux_ = pp.x();
uy_ = pp.y();
uz_ = RT(1);
return;
}
return compute_pss_bisectors(p, q, r);
}
inline void
compute_pss_bisectors(const Site_2& p, const Site_2& q, const Site_2& r)
{
const bool pq =
same_points(p, q.source_site()) || same_points(p, q.target_site());
Polychainline_2 goodbisector;
if (pq) {
goodbisector = bisector_linf(p, q);