Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
C# QR Code Generator 4.0.2.2
Salesforce WordPress Customer Portal 3.2.0
Single Leg MLM 1.2.1
OzGIS 14.6
Quick Maps For Dynamics CRM 3.1
Job Board Software 4.2
PHP Real Estate Script 1.3.2
IP2Location Geolocation Database April.2019
dbForge Data Generator for Oracle 2.1
VisualNEO Web 2018.12.15
SentiMask SDK Trial 1.0.0
OrgChart JS 4.6.4
dotConnect for BigCommerce 1.8
FedEx Smart Shipping For Magento 1.0.0
Database Workbench Pro 5.6.2.311
Top Code
MATLAB Support Package for Arduino (aka ArduinoIO Package) 1.0
MLM Unilevel Plan Script 1.0.4
MLM Unilevel Plan Software 1.0.2
Job Board Software 4.2
AppControls 3.7.4
One Web MP3 Server Beta2
PHP AdminPanel - Control Panel Script 1.0.5
Comag Channel List Editor 1.0
Transparent Skin 1.00
Travel Booking script 1.0.4
Hangman Game 1.1
HTMLPad 2007 Pro 8.3
Tree data structure as a MATLAB class 1.0
Easynews PHP for Scripts 1.7.1
Bus Booking Script 1.0.4
Top Rated
VisualNEO Web 2018.12.15
Paste phpSoftPro 1.4.1
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
PHP GZ Blog Script 1.1
ATN Jobs Software 4.0
Grab 2D points 1.0
File ID: 81396






Grab 2D points 1.0
Download Grab 2D points 1.0http://www.mathworks.comReport Error Link
License: Shareware
File Size: 870.4 KB
Downloads: 3
Submit Rating:
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:

Nassim_Grabit0

% and then follow the instructions
%
%
%
% Notes:
% 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.

License: Shareware

Related: ascending, Vectors, saved, grabbedmat, Column, Small, written, decreasing, increasing

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 870.4 KB

Downloads: 3



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.

******************
clear;



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.
points2contour
Tristan Ursell
February 2012

[Xout,Yout]=points2contour(Xin,Yin,P,direction)

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.

However:
- 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.

n=100;
x=1:n;
y=2.5*x +...

User Review for Grab 2D points
- required fields
     

Please enter text on the image