mirror of https://github.com/CGAL/cgal
manual fixes
This commit is contained in:
parent
f632a11d0d
commit
71932f2f1e
|
|
@ -30,7 +30,7 @@ int main(int argc, char* argv[])
|
|||
{
|
||||
Source S;
|
||||
|
||||
std::ifstream in((argc>1)?argv[1]:"cube.off");
|
||||
std::ifstream in((argc>1)?argv[1]:"cube_poly.off");
|
||||
in >> S;
|
||||
|
||||
// Note that the vertex_point property of the Source and Target1
|
||||
|
|
|
|||
|
|
@ -20,7 +20,7 @@ typedef boost::graph_traits<LCC>::vertex_iterator vertex_iterator;
|
|||
int main(int argc, char** argv)
|
||||
{
|
||||
LCC lcc;
|
||||
CGAL::IO::read_polygon_mesh((argc>1)?argv[1]:"cube.off", lcc);
|
||||
CGAL::IO::read_polygon_mesh((argc>1)?argv[1]:"cube_poly.off", lcc);
|
||||
|
||||
// This is the vector where the distance gets written to
|
||||
std::vector<int> distance(lcc.vertex_attributes().size());
|
||||
|
|
|
|||
|
|
@ -51,7 +51,7 @@ OutputIterator adjacent_vertices_V2(const LCC& g,
|
|||
int main(int argc, char** argv)
|
||||
{
|
||||
LCC lcc;
|
||||
CGAL::IO::read_polygon_mesh((argc>1)?argv[1]:"cube.off", lcc);
|
||||
CGAL::IO::read_polygon_mesh((argc>1)?argv[1]:"cube_poly.off", lcc);
|
||||
|
||||
GraphTraits::vertex_iterator vi = vertices(lcc).first;
|
||||
std::list<vertex_descriptor> V;
|
||||
|
|
|
|||
|
|
@ -70,7 +70,7 @@ int main(int argc, char** argv)
|
|||
Face_index_map;
|
||||
|
||||
LCC lcc;
|
||||
CGAL::IO::read_polygon_mesh((argc>1)?argv[1]:"cube.off", lcc);
|
||||
CGAL::IO::read_polygon_mesh((argc>1)?argv[1]:"cube_poly.off", lcc);
|
||||
|
||||
// Ad hoc property_map to store normals. Face_index_map is used to
|
||||
// map face_descriptors to a contiguous range of indices. See
|
||||
|
|
|
|||
|
|
@ -52,7 +52,7 @@ void fct(const LCC& lcc)
|
|||
int main(int argc, char** argv)
|
||||
{
|
||||
LCC lcc;
|
||||
CGAL::IO::read_polygon_mesh((argc>1)?argv[1]:"cube.off", lcc);
|
||||
CGAL::IO::read_polygon_mesh((argc>1)?argv[1]:"cube_poly.off", lcc);
|
||||
|
||||
fct(lcc);
|
||||
return 0;
|
||||
|
|
|
|||
|
|
@ -43,7 +43,7 @@ struct Source {
|
|||
int main(int argc, char** argv)
|
||||
{
|
||||
LCC lcc;
|
||||
CGAL::IO::read_polygon_mesh((argc>1)?argv[1]:"cube.off", lcc);
|
||||
CGAL::IO::read_polygon_mesh((argc>1)?argv[1]:"cube_poly.off", lcc);
|
||||
GraphTraits::vertex_descriptor vd = *(vertices(lcc).first);
|
||||
|
||||
typedef boost::transform_iterator<Source<LCC>,halfedge_around_target_iterator> adjacent_vertex_iterator;
|
||||
|
|
|
|||
File diff suppressed because it is too large
Load Diff
|
|
@ -1,5 +1,6 @@
|
|||
OFF
|
||||
2775 5558 0
|
||||
|
||||
0.262933 0.102269 0.138247
|
||||
0.0843142 0.0418575 -0.0419302
|
||||
0.0676609 -0.0308717 0.133371
|
||||
|
|
|
|||
|
|
@ -19,7 +19,7 @@ int main(int argc, char* argv[])
|
|||
{
|
||||
//read in mesh
|
||||
Surface_mesh sm;
|
||||
const char* filename = (argc > 1) ? argv[1] : "./data/sphere.off";
|
||||
const char* filename = (argc > 1) ? argv[1] : "./data/larger_sphere.off";
|
||||
std::ifstream in(filename);
|
||||
in >> sm;
|
||||
//property map for the distance values to the source set
|
||||
|
|
|
|||
|
|
@ -19,7 +19,7 @@ int main(int argc, char* argv[])
|
|||
{
|
||||
//read in mesh
|
||||
Surface_mesh sm;
|
||||
const char* filename = (argc > 1) ? argv[1] : "./data/sphere.off";
|
||||
const char* filename = (argc > 1) ? argv[1] : "./data/larger_sphere.off";
|
||||
std::ifstream in(filename);
|
||||
in >> sm;
|
||||
//property map for the distance values to the source set
|
||||
|
|
|
|||
|
|
@ -1,5 +1,6 @@
|
|||
OFF
|
||||
2775 5558 0
|
||||
|
||||
0.262933 0.102269 0.138247
|
||||
0.0843142 0.0418575 -0.0419302
|
||||
0.0676609 -0.0308717 0.133371
|
||||
|
|
|
|||
|
|
@ -14,7 +14,7 @@ int main(int argc, char *argv[])
|
|||
{
|
||||
// read OFF file into a polyhedron
|
||||
Polyhedron P;
|
||||
std::ifstream ifs((argc > 1) ? argv[1] : "data/cross.off");
|
||||
std::ifstream ifs((argc > 1) ? argv[1] : "data/cross_quad.off");
|
||||
ifs >> P;
|
||||
|
||||
// initialize nef from polyhedron
|
||||
|
|
|
|||
|
|
@ -1,16 +1,16 @@
|
|||
OFF
|
||||
8 6 0
|
||||
-1 -1 1
|
||||
-1 1 1
|
||||
1 1 1
|
||||
1 -1 1
|
||||
-1 -1 -1
|
||||
-1 1 -1
|
||||
1 1 -1
|
||||
1 -1 -1
|
||||
4 3 2 1 0
|
||||
4 0 1 5 4
|
||||
4 6 5 1 2
|
||||
4 3 7 6 2
|
||||
4 4 7 3 0
|
||||
4 4 5 6 7
|
||||
-1 -1 1
|
||||
-1 1 1
|
||||
1 1 1
|
||||
1 -1 1
|
||||
4 0 3 7 4
|
||||
4 3 2 6 7
|
||||
4 2 1 5 6
|
||||
4 1 0 4 5
|
||||
4 4 7 6 5
|
||||
4 0 1 2 3
|
||||
|
|
@ -93,7 +93,7 @@ void subdiv( Polyhedron& P) {
|
|||
|
||||
int main(int argc, char* argv[]) {
|
||||
Polyhedron P;
|
||||
std::ifstream in1((argc>1)?argv[1]:"data/cube.off");
|
||||
std::ifstream in1((argc>1)?argv[1]:"data/cube_quad.off");
|
||||
in1 >> P;
|
||||
P.normalize_border();
|
||||
if ( P.size_of_border_edges() != 0) {
|
||||
|
|
|
|||
|
|
@ -1,5 +1,6 @@
|
|||
OFF
|
||||
2775 5558 0
|
||||
|
||||
0.262933 0.102269 0.138247
|
||||
0.0843142 0.0418575 -0.0419302
|
||||
0.0676609 -0.0308717 0.133371
|
||||
|
|
|
|||
Loading…
Reference in New Issue