Search Results for "triangulation"

Implementation of the algorithm of the paper: "Fractal image compression based on Delaunay triangulation and vector quantization" It is a Fractal compression algorithm, based on relationships between regions of the image (in this case triangles), rather than in explicitly the pixel values themselves. Video demo: https://frojasg1.com:8443/resource_counter/resourceCounter?operation=countAndForward&url=https%3A%2F%2Ffrojasg1.com%2Fdemos%2Faplicaciones%2FfractalCompressor%2Ffractal_image_compression_v1.0_demo.mp4%3Forigin%3Dsourceforge&origin=web You can find more about it at this web site: https://www.frojasg1.com:8443/downloads_web/web/html/compresionFractalImagenes.html?...

...Best case was about opposite that of sort(1)*. NEW* hsort main algorithm speed improvement (applies to all; 27,29,31). Now faster than sort(1) (in all cases tested). Using triangulation, hsort begins piped sorted output when 1st bin is done. This means it has new applications in distributed computing and in some cases makes dc un-necessary. (gnu sort must finish all bins) Well compatible with gnu sort (not perfect). other algorthms featured if menu used: bubble, selection, insertion, shell, distributive counting, straight radix, radix exchange, quick, merge. ...