Euclidean

Contains two functions. The one function computes the greatest common divisor (gcd) of two polynomials a(x) and b(x) over GF(2^m). The other function performs the extended Euclidean algorithm where two polynomials u(x) and v(x) is calculated in addition to the gcd of a(x) and b(x) such that gcd =...

Gambol is a Euclidean, construction-based, drawing system. Features Intuitive construction GUI using unordered calling pattern prediction (ok, just try-it to get the point...;o) Free movement of any construction element using numerical optimization (done) and construction rearrangement (not...

Algorithm::TravelingSalesman::BitonicTour is a Perl module to solve the euclidean traveling-salesman problem with bitonic tours. SYNOPSIS use Algorithm::TravelingSalesman::BitonicTour; my $bt = Algorithm::TravelingSalesman::BitonicTour->new; $bt->add_point($x1,$y1); $bt->add_point($x2,$y2);...


Platforms: *nix

KSEG is a Free (GPL) interactive geometry program for exploring Euclidean geometry. You create a construction, such as a triangle with a circumcenter, and then, as you drag verteces of the triangle, you can see the circumcenter moving in real time. Of course, you can do a lot more than that--see...


Platforms: Mac

This is the extended euclidean algorithm implemented in haskell. It will put every single step of the algorithm in a file and show the actual result and everything in between.


Platforms: Windows, Mac, BSD, Linux

TopDrawer makes it easy to produce beautifully typeset Euclidean geometry diagrams.


Platforms: Windows, Mac, Linux

FUNCTIONotr = transform(itr,tmx)PARAMETERSotr = output tensor, after transformation; has the same dimensions as the input tensoritr = input tensor, before transformation; should be a 3-element vector, a 3x3 matrix, or a 3x3x3x... multidimensional array, each dimension containing 3 elementstmx =...


Platforms: Matlab

To compute the Euclidean separation (L2 norm) between two sets of points in MATLAB can be slow and/or memory-hungry. In some cases (most particularly, if you are working with 2D, 3D or 4D data), this function will do it 2-4 times faster than the fastest m-code I've seen (due to Germano Gomes) and...


Platforms: Matlab

Given a set of points in N-dimensional Euclidean space, works out for each point the distance to its nearest neighbour (unless its nearest neighbour isn't very close). The distance metric is a method; subclass and override it for non-Euclidean space. SYNOPSIS use...


Platforms: *nix

MPIL is an instance-based learning system , which utilizes two models for creating neighborhoods. The first model places a single neighborhood sphere (based on Euclidean distance measure) around an instance, and is in nature similar to the nearest neighbor classifier, except that it removes...


Platforms: Windows

2DPathfinder is a C library for performing fast pathfinding on 2D maps. Its highly portable and easy to use, and well documented. The source code is released under the Lesser General Public License. Theory: Finding paths between locations is one interesting problem that can be solved with the...


Platforms: *nix

Math::Numbers is a Perl module that contains methods for mathematical approaches of concepts of the number theory. SYNOPSIS use Math::Numbers; my $a = 123; my $b = 34; my $numbers = Math::Numbers->new($a, $b [, ...]); print "They are coprimes (relatively primes)!n" if...


Platforms: *nix

colorname is both a plugin for The Gimp as well as a standalone tool that tries to assign a name to a color, using external color definitions and linear algebra. For this it calculates the euclidean distance between the currently selected color and all predefined colors, either in the RGB or...


Platforms: *nix

A version of the classic worm game, played in non-Euclidean space - that is to say, on the surface of various three-dimensional shapes. It features retro-style vector graphics, exciting differential geometry and almost guaranteed nausea!


Platforms: Mac

matGeom is designed to be a Matlab library for geometric computing. Using the functions included in matGeom, you are able to create, transform, manipulate and display geometric primitives (points, lines, polygons, planes, etc.). Typical operations involve creation of shapes, computation of...


Platforms: Windows

GeomSpace is a browser for geometric space. You can build your own universe of any dimension and with any geometry. You can choose Euclidean, elliptic (Riemann), hyperbolic (Bolyai-Lobachevsky), Minkowskii among other spaces.


Platforms: Windows

This script can be used alongside MATLAB's native function lab2double (CIELAB to RGB conversion). CIELAB is a nonlinear transformation of RGB where the Euclidean distance between two colors is equal to their perceptual distances (for distances less than ~10 units). Algorithms that process color...


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

It is implemented in JavaScript, using the jQuery and Prototype framewroks, and uses image formats like SVG and VML. Key features "JSXGraph": - Euclidean Geometry: Points, lines, circles, intersections, perpendicular lines, angles - Curve plotting: Graphs, parametric curves, polar curves, data...


Platforms: Windows, Mac, *nix, JavaScript, BSD Solaris

A given polynomial p(x) is transformed into a rational function r(x). The poles and residues of the derived rational function are found to be equivalent to the roots and multiplicities of the original polynomial. p(x) = Given polynomial = PROD[k=1:K]{(x - z_k)^m_k} d(x) = (d/dx)p(x) g(x) =...


Platforms: Matlab

CSMV calculates distances from a given set of points to a set of linear segments SYNOPSIS: [squared_distances_to_segments I]=csmv(P,R,Q,to_plot) [squared_distances_to_segments I]=csmv(P,R,Q,...) INPUT P,R : arrays of coordinates of 2n segment endpoints (i.e., if there are n segments considered in...


Platforms: Matlab