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

remove warnings

This commit is contained in:
Sébastien Loriot 2014-12-12 11:53:25 +01:00
parent 6c4d0a65ee
commit 6fc84fb659
5 changed files with 2 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Point_set_processing_3/examples/Point_set_processing_3/bilateral_smooth_point_set_example.cpp
View File

@ -48,7 +48,7 @@ int main(void)
for (int i = 0; i < iter_number; ++i)
{
double error =
/* double error = */
CGAL::bilateral_smooth_point_set <CGAL::Parallel_tag>(
points.begin(),
points.end(),

10
Point_set_processing_3/include/CGAL/Rich_grid.h
View File

@ -77,8 +77,8 @@ public:
public:
Point pt;
Vector normal;
unsigned int index;
Vector normal;
std::vector<unsigned int> neighbors;
std::vector<unsigned int> original_neighbors;//it's not necessary
};
@ -184,7 +184,6 @@ void Rich_grid<Kernel>::init(std::vector<Rich_point<Kernel> > &vert,
CGAL::Bbox_3 bbox,
const typename Kernel::FT _radius)
{
typedef typename Kernel::Point_3 Point;
typedef typename Kernel::FT FT;
rich_points.resize(vert.size());
@ -259,9 +258,6 @@ void Rich_grid<Kernel>::travel_itself(
iterator startb, iterator endb, FT radius)
)
{
typedef typename Kernel::Point_3 Point;
typedef typename Kernel::FT FT;
static int corner[8*3] = { 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1,
0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1 };
@ -302,9 +298,6 @@ void Rich_grid<Kernel>::travel_others(
const typename Kernel::FT radius)
)
{
typedef typename Kernel::Point_3 Point;
typedef typename Kernel::FT FT;
static int corner[8*3] = { 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1,
0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1 };
@ -463,7 +456,6 @@ void compute_ball_neighbors_one_self(
CGAL::Bbox_3 bbox, ///< bounding box
const typename Kernel::FT radius)
{
typedef typename Kernel::FT FT;
CGAL_point_set_processing_precondition(radius > 0);
for (unsigned int i = 0; i < points.size(); ++i)

1
Point_set_processing_3/include/CGAL/bilateral_smooth_point_set.h
View File

@ -389,7 +389,6 @@ bilateral_smooth_point_set(
typedef bilateral_smooth_point_set_internal::Kd_tree_traits<Kernel> Tree_traits;
typedef CGAL::Orthogonal_k_neighbor_search<Tree_traits> Neighbor_search;
typedef typename Neighbor_search::Tree Tree;
typedef typename Neighbor_search::iterator Search_iterator;
// copy points and normals
Pwns pwns;

3
Point_set_processing_3/include/CGAL/edge_aware_upsample_point_set.h
View File

@ -140,7 +140,6 @@ update_new_point(
)
{
// basic geometric types
typedef typename Kernel::Point_3 Point;
typedef typename Kernel::Vector_3 Vector;
typedef typename Kernel::FT FT;
typedef typename rich_grid_internal::Rich_point<Kernel> Rich_point;
@ -334,8 +333,6 @@ edge_aware_upsample_point_set(
typedef typename Kernel::Vector_3 Vector;
typedef typename Kernel::FT FT;
typedef typename rich_grid_internal::Rich_point<Kernel> Rich_point;
typedef std::pair<Point, Vector> Point_with_normal;
// preconditions
CGAL_point_set_processing_precondition(first != beyond);

4
Point_set_processing_3/include/CGAL/wlop_simplify_and_regularize_point_set.h
View File

@ -240,7 +240,6 @@ compute_density_weight_for_original_point(
// basic geometric types
typedef typename Kernel::Point_3 Point;
typedef typename Kernel::Vector_3 Vector;
typedef typename Kernel::FT FT;
//types for range search
@ -296,7 +295,6 @@ compute_density_weight_for_sample_point(
{
// basic geometric types
typedef typename Kernel::Point_3 Point;
typedef typename Kernel::Vector_3 Vector;
typedef typename Kernel::FT FT;
//types for range search
@ -397,7 +395,6 @@ wlop_simplify_and_regularize_point_set(
{
// basic geometric types
typedef typename Kernel::Point_3 Point;
typedef typename Kernel::Vector_3 Vector;
typedef typename Kernel::FT FT;
// types for K nearest neighbors search structure
@ -405,7 +402,6 @@ wlop_simplify_and_regularize_point_set(
typedef simplify_and_regularize_internal::Kd_tree_traits<Kernel> Tree_traits;
typedef CGAL::Orthogonal_k_neighbor_search<Tree_traits> Neighbor_search;
typedef typename Neighbor_search::Tree Kd_Tree;
typedef typename Neighbor_search::iterator Search_iterator;
// precondition: at least one element in the container.
// to fix: should have at least three distinct points