Description: Computes region adjacency graph of a labeled 2D or 3D image.

Two regions are considered as neighbor if they are separated by a background (i. e. with color 0) pixel in the horizontal or vertical direction, as well as depth direction for 3D images.

The result is a N*2 array, containing 2 indices for each couple of neighbor regions.

usage: ADJ = imRAG(IMG); ADJ has the format [LBL1 LBL2], LBL1 and LBL2 being vertical arrays the same size.

LBL1 is given in ascending order, LBL2 is given in ascending order for each LBL1. Ex : [1 2] [1 3] [1 4] [2 3] [2 5] [3 4]

Alternative syntax: [NODES, ADJ] = imRAG(IMG); Return two arrays: the first one is a [N*2] array containing centroids of the N labeled region, and ADJ is the adjacency previously described.

Given a list of points that represents an object in a plane, the points are rotated to fit within the smallest square possible. This was developed to display functions of a linearly bounded region of a two-dimensional parameter space with the most samples possible within the region. A graph of box size vs. angle and a graph of the rotated object within the box can also be displayed.

Griffon's 3D Graph Component is VCL component allows you to visualize data by plotting a highly customizable 3D Graph. It combines the power of OpenGL with ease of use of VCLcomponents.

Graph Game is an implementation of the Shannon switching game.

It is a game for two players. The first player selects edges of the graph trying to connect two highlighted nodes while the second player removes unselected edges. AI is...

The 2D / 3D Area Graph provides both a client and server side solution for the incorporation of area graphs and charts into web pages. It provides versatile components so that web authors and Java developers can easily build and publish dynamic...