This program implements the iterative algorithm in Khachiyan's paper "Rounding of Polytopes in the Real Number Model of Computation" to approximate the minimum volume ellipsoid circumscribing a non-degenerate set of points in arbitrary dimensions.
It is basically like Nima Moshtagh's MinVolEllipse except that the resulting ellipse actually circumscribes the input points, and that it is much faster due to its use of more...
This directory contains a suite of files for performing the standard two phase simplex method on linear programming problems. The three files LINPROG.DOC, PHASEI.DOC and PHASEII.DOC are fully documented versions of the m-files LINPROG.M, PHASEI.M...
In this file you can find a simple but very effective algorithm for Nearest Neighbour Search which I megalomaniacly called the GLTree.
You want more? go to the Professional version of GLTree
It has been designed for uniformly...
this file you can find a simple but very effective algorithm for Nearest Neighbour Search which I megalomaniacly called the GLTree.
You want more? go to the Professional version of GLTree
It has been designed for uniformly...
It's a modification of the initial function voronoi.m In order to avoid the loops 'for' in the code, a lot of memory is needed. Working to solve it.
Use functions like PointLocation, DelaunayTri, so the code works in last versions...
This is my second submission. This gui plots up to 3 implicit functions F(x,y). The left-hand side generates random integers for A,B, and C then the user is expected to determine the type of the conic. The program checks the answer and...
NROOTS attempts to find all the roots of a real/complex polynomial. It uses a two-step algorithm: a first-approximation to a root is found via the companion matrix method (as per the built-in function ROOTS) and then this approximation is refined...
Use coeffs = fit2dPolySVD(x, y, z, order) to fit a polynomial of x and y so that it provides a best fit to the data z. Uses SVD which is robust even if the data is degenerate. Will always produce a least-squares best fit to the data even if...
This is a simple utility for estimating the rigid transformation that aligns two sets of 3D point clouds, given 3 (or more) point matches.
Input: two sets of 3D point clouds (P1 and P2) Output: homogeneous transformation that...
Using the Double Group Formulation of k.p Theory, one may return full zone bulk band diagrams for SiGe alloys. Second order degenerate perturbation theory returns effective mass Hamiltonians and canonical transformations may return arbitrary... |