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 is a routine used for constructing Bezier Curves for a given set of control points. It also constructs the sub-divided Bezier Curve specified by the given limits of parameter values, along with the control points for the same.
A point X* is said to be Pareto optimal one if there is no X such that Fi(X)<=Fi(X*) for all i=1...n, with at least one strict inequality. These points are also known as non-dominated, non-inferior, or efficient points.
[xs,ys] = cint(x1,y1,x2,y2) finds intersection points of the curves defined by straight lines between the length(x1) points in the plane, (x1,y1), and the length(x2) points in the plane (x2,y2).
The function essentially solves
distributes points around a given point on a through a normal determined plane and gives their coordinates back
M-file to calculate the distance between two points on the earth surface, using different ellipsoid parameters.
In geomatic projects, it is often required to generate a regular grid containing points at pre determined intervals. Such grids could be used as a reference to georectify toposheets. This script when run asks for the bounding box of the study...
Based on selection of two points, the function 'll crop the ROI in the form of circular fashion and with black background.
Returns the Z-points of the points making up a psychophysical curve.
If the values are out of bounds the function returns NaN. If they are 0 or 1 (which would give -Inf and +Inf) the values are rescaled
It doesn't perform...
Interpolates a tridimensional function and calculates a parabolic approximation to first and second derivatives at the interpolation points.
A line of connected straight sections is fitted to a 2D-cloud of data points. The sections are described by the coordinates of their endpoints. No toolbox required.
select 2 seed points from mouse click. 1st one vl be mid point of the circle and 2nd vl be radius of the same.
it vl crop the area
sel_and_del Interactively select and delete points from a line object using mouse input. Left-click selects the point closest to the click and Right-click unselects it. The selected points are highlighted with a black square. The selection process...
This function will take two transformation matrices and transform from tr1 to tr2 converting all the points from frame 1-->2
Use: pointsOut = fcn_transformPoints(trOrigin[4x4],trDestination[4x4], pointsToBeMoved[mx3]) tr1 and...
Using,
bwmorph(a,'thin', inf); bwmorph(a,'thin', skel);
we draw two methods to make skeletons, and plotted the points of connection and end points.
This function fetches data points from matlab supported image formats and writes them into a specified text file. Use 'help d_fetch' for more details.
Function used to compute the center of the circle given two points and a radius. Takes only real inputs and gives only real outputs. Make sure the units are consistent
%Inputs: %P1-First point e.g. [3 4] => (x1,y1) ...
VEC = PLANENORMVEC(PT1,PT2,PT3) calculats the normal vector of a plane that includes three points PT1, PT2, and PT3. When the plane is expressed as ax + by + cz = 1, VEC(1) = a, VEC(2) = b, VEC(3) = c. Points should be a 1 x 3 vector, specifying...
This paper describes the web-based MATLAB programming contests and points out some interesting connections between the contests and opensource software development.
[This paper was presented at CHI 2001.]
Function to find the minimum distance loop from given set of points. This function uses the distance formula to genrate a minimum distance loop. function mindist = minimumdistance(X,Y,x,y) X = X coordinate vector Y = Y... |