搜索结果

Binary Search Tree Implementation with extra features like Maximum Depth of a tree, Minimum element in the BST and Mirroring of BST.

Implementation of a queue using a Linklist.

Josephus Problem implementation.

Implementation of a Doubly linked list.

this class is an implementation of the kd-tree algorithm

This article describes a new efficient implementation of the Cooley-Tukey fast Fourier transform (FFT) algorithm using C++ template metaprogramming. Thank to the recursive nature of the FFT, the source code is more readable and faster than the classical implementation. The efficiency is proved by pe ...

the musiccollection struts 1 application i netbeans implementation (strut for dummies book source)

SiftGPU is an implementation of SIFT [1] for GPU. SiftGPU processes pixels parallely to build Gaussian pyramids and detect DoG Keypoints. Based on GPU list generation, SiftGPU then uses a GPU/CPU mixed method to efficiently build compact keypoint lists. Finally keypoints are processed parallely to ...

A version of a sparse bundle adjustment implementation with adjustable intrinsics and distortion parameters (either shared by all views or varying for each view)

Implementation of GPU (Graphics Processing Unit) that rendered triangle based models. Our goal was to generate complex models with a movable camera. We wanted to be able to render complex images that consisted of hundreds to thousands of triangles. We wanted to apply interpolated shading on the obje ...