Test if 3d points are inside a mesh. Or, voxelise a mask from a surface. Mesh can be non-convex too!
Set of tools for transformation used in geodesy, especially when using GNSS or mapping
Geometric computing library for 3D shapes: meshes, points, lines, planes...
Model 2-d surfaces from scattered data
Exports 2D/3D image volume, vector field, surface, lines, polygons, etc. to ParaView
Voxelise a triangular-polygon mesh.
Computes conformal maps to polygons, allowing easy solution of Laplace's equation.
Useful functions for geometry processing, constrainted optimization and image processing.
Generate unstructured meshes for general two-dimensional geometries.
Efficient test for points inside a convex hull in n dimensions
Functions to compute many proximity graphs and their relatives.
Tests if points are inside of triangulated volume.
A fast test to determine point inclusion for general polygonal geometries.
Convert a triangulated mesh into a voxel volume
Suite of tools to compute minimal bounding circles, rectangles, triangles, spheres, incircles, etc.
Generate unit geodesic sphere created by subdividing a regular icosahedron
Find vertex or (in)equality forms of convex polyhedra in R^n (for n not super large). Also, compute their intersections and unions.
Detect a whereas a point is interior or exterior to a 2D polygon
The program plots convex linear closed regions in 2D/3D.
A small collection of routines for the Spherical Harmonic Transform and Gaunt coefficients.
Geometry library for matlab. Performs geometric computations on points, lines, circles, polygons...
Find the rigid transformation & Least Root Mean Square distance between two paired sets of points
Convex hull, mesh generation, Delaunay triangulation, Voronoi diagram and other algorithms.
Geodesic (shortest path) algorithm for triangular mesh (triangulated 2D surface in 3D).
Create an annotation that is pinned to the axes of a graph.
Constrain the vertices of a Voronoi decomposition to the domain of the input data.
POLYGEOM computes area, centroid location, area moments of inertia and perimeter of closed polygons.
Vectorized surface curvature computation
Toolbox for generating uniform sampling patterns and decompositions of a unit sphere
Compute voronoi's diagram of points on the 2-sphere
This program computes the power diagram for a given set of weighted points.
Function to verify if one given point is in or out a given convex 2D (polygon) or 3D (polyhedron) convex set, excluding its boundaries.
The function cacluates arbitrary polytope bounded Voronoi diagram in 2D/3D
Here is two m-files showing the simplicity of LBM. A view of the density distributions is provided.
Show a 3D triangulated mesh ( patch ) with a texture
Convert a closed triangulated mesh to a tetrahedron volume ( like constrained Delaunay )
Calculate the distance from a point to 2-D polygon, and the point on the polygon closest to the poin
MC integration of n-dimensional integral with stratified and antithetic sampling
Fast mesh-mesh intersection based on ray-tri solution. Octree partitioning gives large speed-up.
Simplifies a closed polygon by reducing the number of vertices to a specified number
Compute quickly the minimal bounding box of a set of 2D points
Conversion routines to take a surface and convert this into a solid.
Fast detection points inside a polygonal region
Set of routines to perform operatioons on polytopes and polyhedra
Saves triangulated mesh objects as wavefront .obj files, optionally with user-defined face or vertex colours.
Contouring and filled contouring for unstructured 2D triangular meshes
SPHERETRI performs a triangulation of a unit sphere based on Icosahedron face partitioning
Fast generation of geodesic Delaunay surface meshes
Computes curvature and curvature derivative tensors in each vertex of a triangle meshes
The code calculates Gaussian and mean curvatures on a triangulaed 3d surface.
Are 3D-testpoints located inside or outside an arbitrary watertight mesh with vertices and faces?
Transform 2D cartesian coordinates to channel fitted curvilinear coordinates and backward
Converts an object with multiple boundary contours to a logical mask
Construct polygonal "dual" meshes from 2-simplex triangulations embedded in R^3.
Generates triangulations on surfaces with arbitrary genera.
Generate multivariate conditional random fields given a mesh and covariance information.
GUI to show Isosurface of volume data, with fast preview render
Finds the pairwise intersection points between line segments in 2D Cartesian space.
Gives the area of polygons from the matlab function C=contour(x,y,z) and their centroids.
Given two arbitrary polygons, the routine calculates the resulting polygon ...
Web サイトの選択
Web サイトを選択すると、翻訳されたコンテンツにアクセスし、地域のイベントやサービスを確認できます。現在の位置情報に基づき、次のサイトの選択を推奨します:
また、以下のリストから Web サイトを選択することもできます。
最適なサイトパフォーマンスの取得方法
中国のサイト (中国語または英語) を選択することで、最適なサイトパフォーマンスが得られます。その他の国の MathWorks のサイトは、お客様の地域からのアクセスが最適化されていません。
南北アメリカ
ヨーロッパ
アジア太平洋地域
最寄りの営業オフィスへのお問い合わせ