Open Source Windows Data Visualization Software

The Progressive Graphics File (PGF) is an efficient image file format, that is based on a fast, discrete wavelet transform with progressive coding features. PGF can be used for lossless and lossy compression. It's most suitable for natural images. PGF can be used as a very efficient and fast replacement of JPEG 2000.

This project has moved. Please follow the WWW link below.

A GUI sorting visualizer desktop application that helps to visualize various sorting algorithms interactively. Visualizer the sorting algorithms like Bubble sort, Insertion sort, Selection sort, Gnome sort, Shaker sort and Odd even sort. Change the bar color and background by customizing. Increase or decrease speed of animation to visualize the sorting process. Download now!

PANDA is a comprehensive and flexib tool for quantitative proteomics data analysis, which is developed based on our solid foundations in quantitative proteomics for years. Several novelties have been implemented in it. First, we implement the advantage algorithms of LFQuant (Proteomics 2012, 12, (23-24), 3475-84) and SILVER (Bioinformatics 2014, 30, (4), 586-7) into PANDA. Second, we consider the state-of-art concept of quantification reliability in this quantitative workflow. On the levels of spectra, peptides and proteins, PANDA works out a few quantitative filters and new scores for quantification confidence. Third, PANDA is designed for processing proteomics big data in parallel.

An open source workbench for chemo- and bioinformatics built on the Eclipse Rich Client Platform (RCP).

A C++ library for clipping polygons.

This projects hosts the worlds fastest algorithms for the labeling of point-features. It especially looks for algorithms thar are free of constraints, applicable to many scenarios (e.g., visualization, maps...) and do not need any preprocessing.

A class/library which uses the graphic card for linear algebra. Warning : you will need a GeForce 8 serie to take profit of this class.

GraphScript project is a network theory simulator based purely on Java and Java scripting engines. It is intended to allow fast development, testing and visualization of network theory (graph) algorithms.

A Java library and set of tools to quickly and easily manipulate graphs (set of nodes and edges) and dynamic graphs. The principal trait of this library is its ability to manage (create, edit, layout, display) continuously evolving graphs. The development of this project now takes place on Github. Visit the official Graphstream website at http://graphstream-project.org

Inspired by Grokking Algorithms and python-execution-trace, this project aims to reveal the mechanics behind algorithms via interactive visualizations of their execution. Visual representations of variables and operations augment the control flow, alongside actual source code. You can fast forward and rewind the execution to closely observe how an algorithm works. The same code that is displayed next to the illustration is also decorated using babel-plugin-trace-execution and executed to record the context at every step. Literally the same source file. Going back and forth between function execution (and call stack when algorithm uses recursion) is effortless. So is pausing and resuming. This project uses styled-jsx, but takes the idea of CSS-in-JS even further. Sizing, positioning and transition offsets are computed by JS, all before elements hit the DOM.

This package implements a variety of interpolation schemes for the Julia language. It has the goals of ease of use, broad algorithmic support, and exceptional performance. Currently, this package supports B-splines and irregular grids. The API has been designed with the intent to support more options. Initial support for Lanczos interpolation was recently added. Pull requests are more than welcome! It should be noted that the API may continue to evolve over time.

An easy to extend, highly graphical, easy to use 2D robot simulator specialized for path planning algorithms. Can be used in testing various robotic algorithms, and already used for comparison of path planning algorithms like RRT, RRTConnect, PRM, RboT..

MobileMath is a software written by using J2ME technolology. It turns mobile into calculator supporting many operations such as : evaluate expression, plotting, differentiate & integrate expression... It can run on any mobiles supporting Java.

To give users the full control over the running application. This means that an application is working according to its purpose but the control over the whole interface is taken from developer and given to users. While an application is running, users can move, resize, and tune all the screen objects through which the communication with an application is going. Set of files includes the book (both in DOC and PDF formats), a big demonstration project with all its files available (all the source files are in C#), and an additional description of many used classes. Book uses the examples from the demo project to explain everything in details. The examples are from many different areas. Examples from the first part of the book are aimed at the details of algorithm and its use with different objects; examples from the second part are mostly the real and very useful applications.

A very lightweight advanced terrain-rendering and 3D map rendering system. Minimal dependencies: OpenGL, SDL. It's distrib in 2-3 separate modules: 1. the C++ implementation of the terrain- and/or surface- rendering Algorithms I have developed: both a multithread and a non-multithread variant is relaeased. 2. Seme as at point 1. , but with a road-network rendering and collision-detection module I wrote before. It also adds some trees at the top of the terrain. (multitread vesion not released yet) 3. Seme as point 2.. Multithread terrain-rendering, roads on it, and vehicles to go around. The most important part is terrain-rendering. The Algorithm at the heart of it features my first and second theorem abut polygonal surface approximation. It took something like 2 years to develop it. It's technically a view-dependent, continuous dynamic level-of-detail rendering algorithm. Main features are simplicity and documentation. Does easily a 4k x 4k terrain, but also much more.

OpenANN is a basic artificial neural network toolset. It is not being actively maintained. For performance neural networking, consider an alternative (such as https://sourceforge.net/projects/openann-project or https://www.tensorflow.org)

PHP Polar Tools is a set of PHP classes for the parsing and management of Polar Heart Rate Monitor data.

PixLab is a peculiar raster-based graphic editor giving one more additional drawing aspect to an artist. Not only traditional elements of painting, such as color and shape, but also artist's brush dynamics is fixed and displayed.

Plantra-Trajectory Planning is a software to rebuild surfaces from cloud points, featuring shaded 3D visualization and path planning for robotics paths. It uses Voronoi diagram, Cyrus-Beck clipping, Delaunay triangulation and B-Splines.

PyPlayground is an environment for developing algorithms involving movement in a space of up to three dimensions using Python.

A Fast MAC based 3D Free surface fuid solver. Capable also of simulating viscoelastic fluids.Includes also wave equation solver for simulating shallow water phenomena.

SenseRank Sys: - builds the dictionaries (multidim matrices) of words’ values; - for the set utterance in certain language builds a figure in multidimensional space (in the matrix space) of values (visual schema), which is topological view of sense

A Java API for using suffix trees with natural language and an Eclipse/SWT-based GUI for suffix tree visualization using Graphviz.

This site hosts the source code for C++ version of the Broker for SBW, NOM module, advanced simulation suite, analysis applications and model editors.