CGAL users discussion list

["Lehtonen, Matti/HIIT" <>]

Hi!

I forget third mismatch in previous mail.

3) Use of deprecated boost header
In file included from /usr/include/CGAL/boost/graph/properties.h:24,
                 from
/usr/include/CGAL/boost/graph/properties_Polyhedron_3.h:23,
                 from
/usr/include/CGAL/Surface_mesh_simplification/HalfedgeGraph_Polyhedron_3.h:24,
                 from triangulator.cpp:38:
/usr/include/boost/property_map.hpp:15:4: warning: #warning "This header is
deprecated. Please use: boost/property_map/property_map.hpp"


I have switched back to CGAL 3.5.1, so I cannot promise that 2) case will be
triggered with this code sample.

You can ignore errors & warnings related to class Mesh_domain, it is defined 
but
not implemented.

Lehtonen, Matti


Quoting Andreas Fabri 
<>:

> On 28/06/2010 12:55, Lehtonen, Matti/HIIT wrote:
> > Hi!
> >
> > 1) In /usr/include/CGAL/boost/graph/named_function_params.h is defined
> >    template<typename Visitor>
> >    cgal_bgl_named_params<Visitor, boost::graph_visitor_t>
> >    visitor(const Visitor&  p)
> >    {
> >      typedef cgal_bgl_named_params<Visitor, boost::graph_visitor_t>
> Params;
> >      return Params(p);
> >    }
> > which is also defined in
> /usr/include/boost/graph/named_function_params.hpp:157
> > Error is raised when  CGAL::mst_orient_normals() is called.
> >
> > This happens with 3.5.1-1 also. Easy to 'fix' with #if 0 .. #endif in
> > /usr/include/CGAL/boost/graph/named_function_params.h
> >
>
>
> Hello,
>
> Can you give me a minimal example so that we can reproduce and fix it.
> Your recommendation seems not to be the real fix, although I must admit
> that to overload a global function with the name visitor and a templated
> type as its argument is probably a bad idea.
>
>
>
> >
> > 2) Boost parametrization fails
> > /usr/include/boost/parameter/aux_/overloads.hpp:81: error: no matching
> function
> > for call to ï¿œboost::parameter::aux::arg_list<...>::arg_list(...)
> >
> > The only candidate is
> > /usr/include/boost/parameter/aux_/arg_list.hpp:214: note: candidates are:
> > boost::parameter::aux::arg_list<TaggedArg, Next>::arg_list(TaggedArg, 
> > const
> > Next&)
> >
> > Problem is raised with call to CGAL::make_mesh_3<C3t3>( domain, criteria 
> > ).
> > Won't get fixed with call to CGAL::make_mesh_3_impl<C3t3>( c3t3, domain,
> > criteria, exude(), perturb(), no_odt(), no_lloyd() );
>
>
> I don't understand what the bug is and what you propose.
> Again, a minial example would be welcome.
>
> andreas
>
> >
> >
> > Lehtonen, Matti
> > Researcher, head programmer - Helsinki Institute for Information 
> > Technology
> HIIT
> > http://www.hiit.fi/
>
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss
>
>


Researcher, head programmer - Helsinki Institute for Information Technology 
HIIT
http://www.hiit.fi/
-- 
Life is complex. It has real and imaginary parts.

#include <vector>



// Tree based queries
#include <CGAL/Orthogonal_k_neighbor_search.h>
#include <CGAL/Search_traits.h>
#include <CGAL/Search_traits_3.h>
#include <CGAL/Kd_tree_rectangle.h>

// Kernel & domain
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Point_with_normal_3.h>
#include <CGAL/Mesh_3/Robust_intersection_traits_3.h>

// Normal estimation and orientation
#include <CGAL/jet_estimate_normals.h>
#include <CGAL/mst_orient_normals.h>

// Delaunay triangulation
#include <CGAL/Triangulation_euclidean_traits_xy_3.h>
#include <CGAL/Triangulation_vertex_base_2.h>
#include <CGAL/Triangulation_hierarchy_vertex_base_2.h>
#include <CGAL/Triangulation_face_base_2.h>
#include <CGAL/Triangulation_data_structure_2.h>
#include <CGAL/Delaunay_triangulation_2.h>
#include <CGAL/Triangulation_hierarchy_2.h>

// Mesh
#include <CGAL/Mesh_triangulation_3.h>
#include <CGAL/Mesh_complex_3_in_triangulation_3.h>
#include <CGAL/Mesh_criteria_3.h>

//#include "Labeled_point_set_mesh_domain_3.h"
#include <CGAL/make_mesh_3.h>
#include <CGAL/refine_mesh_3.h>

#include <CGAL/Surface_mesh_simplification/HalfedgeGraph_Polyhedron_3.h>
#include <CGAL/Surface_mesh_simplification/edge_collapse.h>

// Kernel
typedef CGAL::Exact_predicates_inexact_constructions_kernel		Kernel;
typedef Kernel::FT												FT;
typedef Kernel::Point_3											Point;
typedef CGAL::Point_with_normal_3<Kernel>						Point_with_normal;

// Triangulation
typedef CGAL::Triangulation_euclidean_traits_xy_3<Kernel>		Gt;
typedef CGAL::Triangulation_vertex_base_2<Gt>					Vbb;
typedef CGAL::Triangulation_hierarchy_vertex_base_2<Vbb>		Vb;
typedef CGAL::Triangulation_face_base_2<Gt>						Fb;
typedef CGAL::Triangulation_data_structure_2<Vb, Fb>			Tds;
typedef CGAL::Delaunay_triangulation_2<Gt, Tds>					DTr;
typedef CGAL::Triangulation_hierarchy_2<DTr>					HDTr;

// Mesh
typedef CGAL::Mesh_3::Robust_intersection_traits_3<Kernel>		GeomTraits;
typedef CGAL::Polyhedron_3<GeomTraits>							Polyhedron;

// Domain
typedef std::vector<Point_with_normal>							PointList;

// Tree
typedef CGAL::Search_traits<FT,
							Point_with_normal,
							Kernel::Cartesian_const_iterator_3,
							Kernel::Construct_cartesian_const_iterator_3>
																TreeTraits;
typedef CGAL::Kd_tree_rectangle<TreeTraits>						TreeBoundingBox;
typedef CGAL::Orthogonal_k_neighbor_search<TreeTraits>			Neighbor_search;
typedef Neighbor_search::Tree									PointSet;


class Mesh_domain;

typedef CGAL::Mesh_triangulation_3<Mesh_domain>::type			Tr;
typedef CGAL::Mesh_complex_3_in_triangulation_3<Tr>				C3t3;

// Criteria
typedef CGAL::Mesh_criteria_3<Tr>								Mesh_criteria;
typedef Mesh_criteria::Facet_criteria							Facet_criteria;
typedef Mesh_criteria::Cell_criteria							Cell_criteria;


int 
main
(
	int			argc, 
	char **		argv 
)
{
	// Process points
	PointList		points;

	///process_classified_points( sets );
	PointList::iterator		unoriented_points_begin =
		CGAL::mst_orient_normals( points.begin(), 
								  points.end(),
								  CGAL::make_normal_of_point_with_normal_pmap( points.begin() ),
								  24 );


	// Create 2D Delaunay triangulation
	HDTr		delenaytriangulation;

	// Create input polyhedron from triangulation
	Polyhedron											polyhedron;

	// Create domain
	PointSet		pnts;
	Mesh_domain		domain( pnts, delenaytriangulation );

	// Mesh LOD generation
#if 0
	// 3.5 & 3.6
	Facet_criteria	facet_criteria( 20, 1, 1 );
	Cell_criteria	cell_criteria( 1, 1 );
	Mesh_criteria	criteria( facet_criteria, cell_criteria );
#else
	// 3.6
	Mesh_criteria	criteria( facet_angle=30, facet_size=6, facet_distance=4,
							  cell_radius_edge=3, cell_size=8 );
#endif
	C3t3	c3t3 = CGAL::make_mesh_3<C3t3>( domain, criteria );
	CGAL::refine_mesh_3( c3t3, domain, criteria );

	return EXIT_SUCCESS;
}