mirror of https://github.com/CGAL/cgal
Add return 0 and whitespace
This commit is contained in:
parent
f06bbd7313
commit
35ad0e0b50
|
|
@ -77,4 +77,6 @@ int main() {
|
|||
// save output indexed meshes to files, in the OFF format
|
||||
CGAL::IO::write_OFF("result_mc.off", points_mc, polygons_mc);
|
||||
CGAL::IO::write_OFF("result_dc.off", points_dc, polygons_dc);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -53,4 +53,6 @@ int main() {
|
|||
|
||||
// write output indexed surface mesh to file, in OFF format
|
||||
CGAL::IO::write_OFF("result.off", points, polygons);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -54,4 +54,6 @@ int main() {
|
|||
|
||||
// save the result in the OFF format
|
||||
CGAL::IO::write_OFF("result.off", points, polygons);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -71,4 +71,6 @@ int main() {
|
|||
|
||||
// save output indexed mesh to a file, in the OFF format
|
||||
CGAL::IO::write_OFF("result.off", points, polygons);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -83,4 +83,6 @@ int main() {
|
|||
CGAL::Isosurfacing::dual_contouring(domain, 0.8, points, polygons);
|
||||
|
||||
CGAL::IO::write_OFF("result.off", points, polygons);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -46,4 +46,6 @@ int main() {
|
|||
|
||||
// save output indexed surface mesh to file, in the OFF format
|
||||
CGAL::IO::write_OFF("result.off", points, polygons);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -32,4 +32,6 @@ int main() {
|
|||
|
||||
// save ouput indexed mesh to a file, in the OFF format
|
||||
CGAL::IO::write_OFF("result.off", points, polygons);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -37,4 +37,6 @@ int main() {
|
|||
|
||||
// save output indexed mesh to a file, in the OFF format
|
||||
CGAL::IO::write_OFF("result.off", points, polygons);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -28,7 +28,7 @@ typedef std::vector<Point> Point_range;
|
|||
typedef std::vector<std::vector<std::size_t>> Polygon_range;
|
||||
|
||||
|
||||
// computes the Euclidean distance from query point p to the mesh
|
||||
// computes the Euclidean distance from query point p to the mesh
|
||||
// via the AABB tree data structure
|
||||
inline Kernel::FT distance_to_mesh(const Tree& tree, const Point& p) {
|
||||
const Point& x = tree.closest_point(p);
|
||||
|
|
@ -94,4 +94,6 @@ int main() {
|
|||
|
||||
// save output indexed triangle soup to a file, in the OFF format
|
||||
CGAL::IO::write_OFF("output.off", points, polygons);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,5 +1,5 @@
|
|||
#ifndef CGAL_TIMER_H
|
||||
#define CGAL_TIMER_H
|
||||
#ifndef SCOPE_TIMER_H
|
||||
#define SCOPE_TIMER_H
|
||||
|
||||
#include <chrono>
|
||||
#include <iostream>
|
||||
|
|
@ -35,4 +35,4 @@ private:
|
|||
bool running;
|
||||
};
|
||||
|
||||
#endif // CGAL_TIMER_H
|
||||
#endif // SCOPE_TIMER_H
|
||||
|
|
|
|||
|
|
@ -78,4 +78,6 @@ int main() {
|
|||
|
||||
// CGAL::IO::write_OFF("result.off", mesh);
|
||||
CGAL::IO::write_OFF("result.off", points, polygons);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -91,4 +91,6 @@ int main() {
|
|||
test_grid_sphere(100);
|
||||
|
||||
std::cout << "All tests passed" << std::endl;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -66,4 +66,4 @@ bool check_mesh_distance(const Mesh& m0, const Mesh& m1) {
|
|||
return true;
|
||||
}
|
||||
|
||||
#endif // CGAL_ISOSURFACING_TEST_UTIL_H
|
||||
#endif // CGAL_ISOSURFACING_TEST_UTIL_H
|
||||
|
|
|
|||
Loading…
Reference in New Issue