image thumbnail

updated 17 days ago

Fast mesh-mesh intersection using ray-tri intersection with octree spatial partitioning. by Thomas

Fast mesh-mesh intersection based on ray-tri solution. Octree partitioning gives large speed-up. (triangular mesh, delaunay, intersection)

fastMesh2Mesh.m

mesh2mesh(facesInA, pointsInA, facesInB, pointsInB)

octMesh(facesA, pointsA, facesB, pointsB, octs)

image thumbnail

updated 3 months ago

Computational Geometry Toolbox by George Papazafeiropoulos

Convex hull, mesh generation, Delaunay triangulation, Voronoi diagram and other algorithms. (bounding box, concave, convex)

Bounding box of a random point set in 2-dimensional space

Bounding box of a random point set in 3-dimensional space

Bounding box of a random point set in 4-dimensional space

image thumbnail

updated 8 months ago

Voronoi Sphere by Bruno Luong

Bruno Luong (view profile)

Compute voronoi's diagram of points on the 2-sphere (voronoi, delaunay, sphere)

vcell_solidangle.m

voronoisphere(xyz, varargin)

test_voronoisphere.m

image thumbnail

updated almost 2 years ago

TRIGRADIENT.M by Mick Warehime

Fast approximation to the gradient for scattered data and for data defined by a triangulation. (triangulation, gradient, delaunay)

trigradient(x,y,z,t,opt)

image thumbnail

updated almost 3 years ago

Alpha shapes by Jonas Lundgren

Jonas Lundgren (view profile)

Alpha shape of 2D/3D point set. (alpha shape, alpha shapes, volume)

alphavol(X,R,fig)

image thumbnail

updated 3 years ago

scatterquad2 by Ben Petschel

Ben Petschel (view profile)

calculates the volume under a surface defined by scattered points (quad2, dblquad, delaunay)

v=scatterquad2(x,y,z)

image thumbnail

updated 4 years ago

Image and Terrain Modeling using Incremental Delaunay Triangulation by Omid Sakhi

Omid Sakhi (view profile)

This program model image/digital elevation data using incremental Delaunay triangulations. (image, terrain, modeling)

aIDT(input_im,max_allowed_error,max_number_of_iterations)

aRDT(input_im,number_of_vertex)

aReCon(dt,z)

image thumbnail

updated 4 years ago

Clipped Voronoi Diagram by David González

Returns 2D clipped Voronoi Diagram of a cloud of points. Valid for all kinds of domains, holes... (mathematics, optimization, voronoi)

clippedvoronoi(varargin)

image thumbnail

updated 4 years ago

Mesh2Tetra by Dirk-Jan Kroon

Dirk-Jan Kroon (view profile)

Convert a closed triangulated mesh to a tetrahedron volume ( like constrained Delaunay ) (constrained delaunay, delaunay, delaunayn)

C=PointToClosestPointOnPlane(A,B,C,P)

Faces=GetRemainingFaces(T,F,V)

InsidePoints3D(V,F)

image thumbnail

updated almost 5 years ago

Efficient K-Nearest Neighbor Search using JIT by Yi Cao

Yi Cao (view profile)

A small but efficient tool to perform KNN search (statistics, probability, knearest neighbors)

[idx,D]=knnsearch(varargin)

image thumbnail

updated almost 5 years ago

Preprocess CP2TFORM by Dirk-Jan Kroon

Dirk-Jan Kroon (view profile)

Removes folded over triangles in piecewise linear image transformation, so cp2tform always works. (cp2tform, foldover, triangles)

[uv xy]=PreProcessCp2tform(uv,xy)

image thumbnail

updated 5 years ago

Remove Unconnected Triangle by David Gingras

This function takes a triangular mesh and remove the unconnected cells. (delaunay, triangulation, mesh)

[TRI2 XYZ2]=removeUnconnectedTri(TRI1,XYZ1,triID)

image thumbnail

updated 5 years ago

writeVTK by Daniel Peterseim

Exports triangulations and triangulated surfaces to vtk file format. (vtk export, paraview, visualization)

writeVTK(filename,t,p,u)

writeVTKcell(filename,t,p,u)

image thumbnail

updated almost 6 years ago

Compute normal vectors of 2.5D triangulation by David Gingras

That function compute the normal vectors of a 2.5D triangulation. (2d, triangulation, normal vector)

[NormalVx NormalVy NormalVz PosVx PosVy PosVz]=computeNor...

image thumbnail

updated 7 years ago

Iterative Closest Point Method by Per Bergström

Per Bergström (view profile)

ICP fit points in data to the points in model. (optimization, icp, iterative closest poi...)

icp.m

image thumbnail

updated 7 years ago

nearestneighbour.m by Richard Brown

Richard Brown (view profile)

Computes nearest neighbour(s) by Euclidean distance (nearest, neighbor, neighbour)

NEARESTNEIGHBOUR Demonstration

nearestneighbour(varargin)

timingtest(P, X, mode)

image thumbnail

updated 9 years ago

Triangulate vertices on a sphere by Tianli Yu

Tianli Yu (view profile)

Triangulate a set of vertices on a sphere (approximation, interpolation, sphere)

GetMeshStructure(FacetListM, vertnum, verbose)

TriangulateSpherePoints(VertexM)

SampleTest.m

image thumbnail

updated almost 12 years ago

Earth Mesh by Michael Kleder

Michael Kleder (view profile)

Space view of globe with Delaunay mesh of equidistant points. (gallery, earth, globe)

Contact us