visualization.cpp File Reference

#include "visualization.h"
#include "dic_structures.h"
#include "strain_computation.h"
#include "logging.h"
#include <fstream>
#include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <functional>
#include <filesystem>
#include <map>
#include <set>
#include <queue>
#include <array>

Go to the source code of this file.

Namespaces
namespace	cppxdic
	DataSerializer - Abstract base class for format-agnostic DIC data I/O.

Functions
static std::vector< std::vector< int > >	cppxdic::buildFaceAdjacency (const std::vector< int > &faces, size_t n_faces)
	Build face adjacency map from triangle connectivity For each face, find all faces that share at least one vertex.
static std::vector< std::array< double, 3 > >	cppxdic::computeFaceCentroids (const Point3DFrame &points, const std::vector< int > &faces, size_t n_faces)
	Compute face centroids from vertices and faces.
static double	cppxdic::computeAverageResolution (const std::vector< std::array< double, 3 > > &centroids, const std::vector< std::vector< int > > &adjacency)
	Compute average resolution (spacing) of face centroids.
static std::vector< std::vector< std::pair< int, int > > >	cppxdic::findKNearestByHops (const std::vector< std::vector< int > > &adjacency, int k)
	Find k-nearest neighbors for each face using BFS on adjacency graph.
static void	cppxdic::designButterworth4 (double Wn, std::vector< double > &b, std::vector< double > &a)
	Design 4th order Butterworth low-pass filter coefficients Equivalent to MATLAB's [B,A] = butter(4, Wn)
static std::vector< double >	cppxdic::filtfilt (const std::vector< double > &b, const std::vector< double > &a, const std::vector< double > &x)
	Apply zero-phase filtering (equivalent to MATLAB's filtfilt) Filters forward and backward to eliminate phase distortion.
static void	cppxdic::fillMissingLinear (std::vector< double > &data)
	Fill missing values (NaN) with linear interpolation Equivalent to MATLAB's fillmissing(d,'linear',1,'EndValues','nearest')