Search Files

Advanced Search

View All files by:
Most Recent
Most Downloaded

Files

Watch this search E-mail this View Subscribe to this View
Date: Updated Submitted Time Frame: All Time Last 30 Days Last 7 Days			1 - 16 of 16
Date	File	Tags	Downloads (last 30 days)	Comments	Ratings
12 Oct 2009	K-NEAREST NEIGHBOURS AND RADIUS (RANGE) SEARCH A Mex implementation of the brute search algorithm. Supports KNN and Radius Search. Author: Luigi Giaccari	image processing, mathematics, statistics, optimization, neighbor, delaunay	274	2	5.0 5.0 \| 2 ratings
09 Oct 2009	SURFACE RECONSTRUCTION FROM SCATTERED POINTS CLOUD PART2 Builds a triangulated surface given a 3D points cloud. They do not need to be in the z=f(x,y) form. Author: Luigi Giaccari	3d, lidar, mathematics, image processing, simulation, data export	486	12	5.0 5.0 \| 9 ratings
09 Oct 2009	SURFACE RECONSTRUCTION FROM SCATTERED POINTS CLOUD PART1 Builds a triangulated surface given a 3D points cloud. They don't need to be in the z=f(x,y) form. Author: Luigi Giaccari	plot, 3d, surface, delaunay, cloud, mesh	445	6	5.0 5.0 \| 7 ratings
24 Aug 2009	FAST CONVEX HULL ALGORITHM Totally m-code routine to compute convex hull in 2D space faster than the Matlab native convhull. Author: Luigi Giaccari	hull, simulation, mesh, delaunay, polygon, qhull	230	5	5.0 5.0 \| 3 ratings
20 Aug 2009	STRUCTURED TETRAEDRAL MESH GENERATION Gets a conform tetraedral mesh generation from 3 vectors representing the axes of a cuboid Author: Luigi Giaccari	triangles, tetredrons, simulation, mesh, delaunay, surface	164	0
19 Aug 2009	SURFACE RECOSTRUCTION FROM SCATTERED POINTS CLOUD PART3 The BallFretting algorithm designed for filled points cloud. Author: Luigi Giaccari	model, stl, simulation, mod, graphics, communications	196	0
10 Aug 2009	HOW TO PLOT A COLOURED SURFACE FROM 3D SCATTER Simple script that shows how to plot surfaces in the z=f(x,y) form with rgb values at each point. Author: Luigi Giaccari	griddata, 3d, gridfit, gui, trimesh, delaunay	247	2	5.0 5.0 \| 1 rating
10 Aug 2009	N-DIMENSIONAL CONVEX HULL: QUICKER HULL ALGORITHM Should be faster than convhulln on large models in dimension <5. Author: Luigi Giaccari	hull, simulation, graphics, mesh, delaunay, polygon	170	1	5.0 5.0 \| 1 rating
07 Aug 2009	Deleting multiple points: UniqueRows UniqueRows can be a faster alternative to the Matlab unique(X,'rows'); Author: Luigi Giaccari	sortrows, unique, data import, delaunay, optimization, image	126	3	5.0 5.0 \| 1 rating
05 May 2009	Compute normal vectors of 2.5D triangulation That function compute the normal vectors of a 2.5D triangulation. Author: David Gingras	delaunay, 2d, normal vector, triangulation	24	2	5.0 5.0 \| 2 ratings
07 Jul 2008	Efficient K-Nearest Neighbor Search using JIT A small but efficient tool to perform KNN search Author: Yi Cao	jit, kdtree, statistics, delaunay, knearest neighbors, probability	281	2	4.5 4.5 \| 4 ratings
26 Nov 2007	Iterative Closest Point Method ICP fit points in data to the points in model. Author: Per Bergström	delaunay, icp, iterative closest poi..., robust, optimization, weighted	318	7	4.0 4.0 \| 6 ratings
10 Sep 2007	Consolidator Consolidates common elements in x (may be n-dimensional), aggregating corresponding y. Author: John D'Errico	consolidates, elements, delaunay, unique, matrices, replicates	164	16	5.0 5.0 \| 12 ratings
07 Sep 2007	nearestneighbour.m Computes nearest neighbour(s) by Euclidean distance Author: Richard Brown	neighbour, dsearch, delaunay, neighbor, dsearchn, nearest	52	3	5.0 5.0 \| 1 rating
02 Aug 2005	Triangulate vertices on a sphere Triangulate a set of vertices on a sphere Author: Tianli Yu	interpolation, sphere, delaunay, mathematics, approximation, triangulation	24	1
07 Mar 2003	Earth Mesh Space view of globe with Delaunay mesh of equidistant points. Author: Michael Kleder	earth, gallery, globe, delaunay, nasa	119	5	3.8 3.8 \| 6 ratings
1 - 16 of 16
Watch this search E-mail this View Subscribe to this View

MATLAB Central Terms of Use

NOTICE: Any content you submit to MATLAB Central, including personal information, is not subject to the protections which may be afforded information collected under other sections of The MathWorks, Inc. Web site. You are entirely responsible for all content that you upload, post, e-mail, transmit or otherwise make available via MATLAB Central. The MathWorks does not control the content posted by visitors to MATLAB Central and, does not guarantee the accuracy, integrity, or quality of such content. Under no circumstances will The MathWorks be liable in any way for any content not authored by The MathWorks, or any loss or damage of any kind incurred as a result of the use of any content posted, e-mailed, transmitted or otherwise made available via MATLAB Central. Read the complete Terms prior to use.