Grab 2D points 1.0
File ID: 81396
Grab 2D points 1.0 Description
Description: % This code is used to digitize figures that you find in publications, journals, or simply scanned reports or documents by clicking on the desired points using the mouse.
% You can use it to pick [x,y] points by clicking on the original scanned plot.
% To run, simply type:
% and then follow the instructions
% 1- Plots or figures should be of jpg, png, bmp or any other format that is
% acceptable by matlab and in the same directory as these m-files you are using.
% 2- You don't have to select the points in increasing or decreasing
% order. Click wherever you want on the plot. I have written a small code
% to sort the vectors in ascending order
% 3- The [x,y] data points will be saved in GRABBED.mat. Load
% GRABBED.mat and the first column of GRABBED will be your absisca points, the second
% are the ordinates.
% This code is written by
% Nassim Khaled
% June 2007
Important:Change imshow to imagesc for people without Image Processing Toolbox.
Related: ascending, Vectors, saved, grabbedmat, Column, Small, written, decreasing, increasing
O/S:BSD, Linux, Solaris, Mac OS X
File Size: 870.4 KB
|More Similar Code|
The function "Return_points_polyg_direct" finds the subset of an arbitrarily large set of 2D points. This subset defines the convex polygon that includes all above points. The function accounts for aligned or identical points.
Below is an example of how to use the function with 100 random 2D points.
The initial points are in blue, the convex polygon points are linked in red.
This simple code calculates the convex hull of a set of 2D points
and generates EPS files to visualise them. The algorithm was taken
from a textbook on Computional Geometry.
Connects randomly ordered 2D points into a minimal nearest neighbor contour.
Given any list of 2D points (Xin,Yin),...
Returns the convex hull (separated into upper and lower chains of vertices) and the diameter (farthest pair of points), given input consisting of a list of 2d points represented as pairs (x,y). The convex hull algorithm is Graham's scan, using a...
Compute the minimal bounding box of a set of 2D points, similarly to the "Minimal Bounding Rectangle" of John D'Errico.
- The algorithm is fully vectorized (matlab implementation, no for loop). Thus it is better...
Even if totally m-coded, this routine is particularly fast in computing convex hull of 2D points. In many cases seems to be much faster than the matlab library routine. The main reason is that, differently from convhull, this algorithm jumps the...
cvoronoi computes the smallest circumscribed, the greatest inscribed and the best approaching circles of a set of 2D points. The method is based on the Voronoi diagram properties. Data can be generated randomly or by mouse click or by reading a...
returns a set of 2D coordinates from a 3D triangulated surface. 2D points are disposed inside a circle of unit radius so they represent a parametrization of the initial surface.
The triangulation is represented by the n x 3 t array.
an example, strings A B C or D with probabilities .1 .2 .3 .4 --
abcd = dict( A=1, D=4, C=3, B=2 )
# keys can be any immutables: 2d points, colors, atoms ...
wrand = Walkerrandom( abcd.values(), abcd.keys() )
The function computes parameters a, b, and c of the weighted orthogonal least squares fit of line ax+by+c=0 to a set of 2D points with coordinates given by x and y and weights w.
|User Review for Grab 2D points