mirror of https://github.com/CGAL/cgal
63 lines
1.7 KiB
C++
63 lines
1.7 KiB
C++
#include <CGAL/Simple_cartesian.h>
|
|
#include <CGAL/Surface_mesh.h>
|
|
|
|
#include <iostream>
|
|
#include <fstream>
|
|
|
|
#include <CGAL/boost/graph/prim_minimum_spanning_tree.h>
|
|
|
|
typedef CGAL::Simple_cartesian<double> Kernel;
|
|
typedef Kernel::Point_3 Point;
|
|
typedef CGAL::Surface_mesh<Point> Mesh;
|
|
|
|
typedef boost::graph_traits<Mesh>::vertex_descriptor vertex_descriptor;
|
|
|
|
int main(int argc, char* argv[])
|
|
{
|
|
const std::string filename = (argc>1) ? argv[1] : CGAL::data_file_path("meshes/prim.off");
|
|
|
|
Mesh P;
|
|
if(!CGAL::IO::read_polygon_mesh(filename, P))
|
|
{
|
|
std::cerr << "Invalid input." << std::endl;
|
|
return 1;
|
|
}
|
|
|
|
Mesh::Property_map<vertex_descriptor,vertex_descriptor> predecessor;
|
|
predecessor = P.add_property_map<vertex_descriptor,vertex_descriptor>("v:predecessor").first;
|
|
|
|
boost::prim_minimum_spanning_tree(P, predecessor, boost::root_vertex(*vertices(P).first));
|
|
|
|
std::cout << "#VRML V2.0 utf8\n"
|
|
"DirectionalLight {\n"
|
|
"direction 0 -1 0\n"
|
|
"}\n"
|
|
"Shape {\n"
|
|
" appearance Appearance {\n"
|
|
" material Material { emissiveColor 1 0 0}}\n"
|
|
" geometry\n"
|
|
" IndexedLineSet {\n"
|
|
" coord Coordinate {\n"
|
|
" point [ \n";
|
|
|
|
for(vertex_descriptor vd : vertices(P)){
|
|
std::cout << " " << P.point(vd) << "\n";
|
|
}
|
|
|
|
std::cout << " ]\n"
|
|
" }\n"
|
|
" coordIndex [\n";
|
|
for(vertex_descriptor vd : vertices(P)){
|
|
if(predecessor[vd]!=vd){
|
|
std::cout << " " << std::size_t(vd) << ", " << std::size_t(predecessor[vd]) << ", -1\n";
|
|
}
|
|
}
|
|
|
|
std::cout << "]\n"
|
|
" }#IndexedLineSet\n"
|
|
"}# Shape\n";
|
|
|
|
P.remove_property_map(predecessor);
|
|
return 0;
|
|
}
|