Building PCL with Visual Studio 2013 ( λΉμ£ΌμΌ μ€ν¬λμ€ 2013μμ PCL λΉλνκΈ°, 64bit version )
- μλ μ£Όμμμ PCLμ λ€μ΄λ°μ μμΆμ νΌλ€. (μ C:\PCL-1.7.2)
https://github.com/PointCloudLibrary/pcl/tree/pcl-1.7.2
Boost 1.55.0(boost_1_55_0.zip)γγγ¦γ³γγΌγγγ¦γγ‘γ€γ«γθ§£εγγγ(C:\boost_1_55_0)
http://www.boost.org/users/history/version_1_55_0.html
https://github.com/boostorg/boost/tree/boost-1.55.0
HPC Pack 2012 R2 MS-MPI Redistributable Package - ζ₯ζ¬θͺ(MSMPISetup.exe)γγγ¦γ³γγΌγγγ¦γ€γ³γΉγγΌγ«γγγ
Eigenμ λΉλ μμ΄ includeλ§ νλ©΄ μΈ μ μλ λΌμ΄λΈλ¬λ¦¬μ΄κΈ° λλ¬Έμ μμ§ν μ΄ λ°©λ²μ΄ νμνμ§ μμκ² κ°μ§λ§ μ§μ λ κ²½λ‘(Program files)μ μΉ΄νΌνκΈ° μ¬μ΄ λ°©λ²μΈκ²κ°λ€.
CMake
#include <iostream> | |
#include <vector> | |
#include <map> | |
#include <string> | |
using namespace std; | |
extern unsigned int time; | |
// vertex data structure | |
// employs STL pair and vector to store adjacent list |
#include <iostream> | |
#include <fstream> | |
#include <sstream> | |
#include <string> | |
#include <vector> | |
#include <Eigen/Core> | |
#include <Eigen/Dense> | |
using std::string; | |
using std::vector; |
#include <iostream> | |
using namespace std; | |
void printAll(const char str[], char buf[], bool used[], int start, int end); | |
void printAll(const char str[]); | |
int main(int argc, char* argv[]) | |
{ | |
if(argc != 2) | |
{ |
// print all combinations of string | |
#include <iostream> | |
#include <vector> | |
using namespace std; | |
void combinations(const char str[]); | |
void combinations(const char str[], char buf[], bool used[], int bufpos, int cur, int len); | |
void combinations(const char str[], vector<char>& buf, int start, int len); | |
int main(int argc, char* argv[]) |