ialhashim

// Portable version of powercrust, adapted from https://github.com/timhutton/vtkpowercrust

/*===================================================================================================

vtkPowerCrustSurfaceReconstruction algorithm reconstructs surfaces from unorganized point data.
Copyright (C) 2014  Arash Akbarinia, Tim Hutton, Bruce Lamond Dieter Pfeffer, Oliver Moss

====================================================================================================*/
/*
#include "CellArray.h"

ialhashim

template<class Vector3>
std::pair<Vector3, Vector3> best_plane_from_points(const std::vector<Vector3> & c)
{
	// copy coordinates to  matrix in Eigen format
	size_t num_atoms = c.size();
	Eigen::Matrix< Vector3::Scalar, Eigen::Dynamic, Eigen::Dynamic > coord(3, num_atoms);
	for (size_t i = 0; i < num_atoms; ++i) coord.col(i) = c[i];

	// calculate centroid
	Vector3 centroid(coord.row(0).mean(), coord.row(1).mean(), coord.row(2).mean());

ialhashim

# Install NuGet to run inside VS

# Get VC project files
$include = @("*.vcxproj","*.sln")
$projectFiles = gci . -recurse -force -include $include 

foreach ($file in $projectFiles) {
	(get-content $file) | % { $_ -creplace 'Win32', 'x64' } | set-content $file
	(get-content $file) | % { $_ -creplace '%40QMAKE_SUBSYSTEM_SUFFIX%40', '' } | set-content $file
}

ialhashim

# 2D Near Isometric Deformations -
# code from : http://www.cs.technion.ac.il/~cggc/Upload/Projects/KVFDeformation/index.html

QT       += core gui opengl
greaterThan(QT_MAJOR_VERSION, 4): QT += widgets

TEMPLATE = app
TARGET = KVF_deform

INCLUDEPATH += . ./include

ialhashim

// Adapted from: https://github.com/flexible-collision-library/fcl

#include <Eigen/Geometry>

namespace Intersect{

	typedef double Scalar;
	typedef Eigen::Vector3d Vector3;

	const Scalar EPSILON = 1e-5;

ialhashim

template<typename Scalar, typename Container>
inline static Eigen::Matrix<Scalar,-1,-1> toEigenMatrix( const Container& vectors ){
	typedef typename Container::value_type VectorType;
	typedef typename VectorType::value_type Scalar;
	Eigen::Matrix<Scalar,-1,-1> M(vectors.size(), vectors.front().size());
	for(size_t i = 0; i < vectors.size(); i++)
		for(size_t j = 0; j < vectors.front().size(); j++)
			M(i,j) = vectors[i][j];
	return M;
}

ialhashim

template<typename Vector, typename Container>
Vector geometric_median( const Container& data, int iterations = 200 )
{
	size_t N = data.size();
	if(N < 3) return data.front();
	size_t dim = data.front().size();
	std::vector<Vector> A (2, (data[0] + data[1]) / Scalar(2));

	for(int it = 0; it < iterations; it++){
		Vector numerator; for(size_t i = 0; i < dim; i++) numerator[i] = 0;

ialhashim

inline QVector<QColor> rndColors(int count){
	QVector<QColor> colors;
	float currentHue = 0.0;
	for (int i = 0; i < count; i++){
		colors.push_back( QColor::fromHslF(currentHue, 1.0, 0.5) );
		currentHue += 0.618033988749895f;
		currentHue = std::fmod(currentHue, 1.0f);
	}
	return colors;
}

ialhashim

//    SPHERE_FIBONACCI_POINTS computes sphere points on a Fibonacci spiral.
//
//    John Burkardt - 21 October 2013 / This code is distributed under the GNU LGPL license.
//
//  Reference:
//
//    Richard Swinbank, James Purser,
//    Fibonacci grids: A novel approach to global modelling. July 2006
//
inline std::vector< Vector3Type > sphere_fibonacci_points ( int n = 100 )

ialhashim

// Fix Visual Studio
#ifdef WIN32
namespace std{  
	template<typename T> bool isnan(T x){ return _isnan(x); } 
	template<typename T> bool isfinite(T arg){
		return arg == arg && 
			arg != std::numeric_limits<T>::infinity() &&
			arg != -std::numeric_limits<T>::infinity();
	}
}