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

add a default constructor to Primitive_vertex to make it work with Lazy 

also add a test showing the issue
This commit is contained in:
Sébastien Loriot 2014-01-13 19:08:30 +01:00
parent 244e0fe1cf
commit 69eff06691
2 changed files with 55 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Partition_2/include/CGAL/Partition_2/Partitioned_polygon_2.h
View File

@ -305,6 +305,12 @@ class Partition_vertex : public Traits_::Point_2
typedef std::list<Circulator> Diagonal_list;
typedef typename Diagonal_list::iterator Diagonal_iterator;
//default constructor added for EPECK
Partition_vertex(): Base_point()
{
current_diag = diag_endpoint_refs.end() ;
}
Partition_vertex(Base_point p)
: Base_point(p)
{

49
Partition_2/test/Partition_2/greene_approx_convex_partition_2_test_EPECK.cpp Normal file
View File

@ -0,0 +1,49 @@
// ============================================================================
//
// Copyright (c) 2000 The CGAL Consortium
//
// This software and related documentation is part of an INTERNAL release
// of the Computational Geometry Algorithms Library (CGAL). It is not
// intended for general use.
//
// ----------------------------------------------------------------------------
//
// release : $CGAL_Revision $
// release_date : $CGAL_Date $
//
// file : include/CGAL/greene_approx_convex_partiton_2_test_EPECK.cpp
// package : $CGAL_Package: Partition_2 1.0 (27 Jul 2000) $
// chapter : Planar Polygon Partitioning
//
// revision : $Id$
// revision_date : $Date$
//
// author(s) : Susan Hert <hert@mpi-sb.mpg.de>
// maintainer : Susan Hert <hert@mpi-sb.mpg.de>
//
// coordinator : MPI (Susan Hert <hert@mpi-sb.mpg.de>)
//
// implementation: Testing of convex partitioning functions
// ============================================================================
#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
#include <CGAL/Polygon_2.h>
#include <CGAL/partition_2.h>
#include <list>
#include <cassert>
typedef CGAL::Exact_predicates_exact_constructions_kernel K;
typedef K::Point_2 Point_2;
typedef std::list<Point_2> Container;
typedef CGAL::Polygon_2<K, Container> Polygon_2;
#include "convex_test_polys.h"
#include "test_greene_approx_convex.h"
int main(void)
{
test_greene_approx_convex();
return 0;
}