## Search Files Advanced Search

updated 3 months ago

### David Legland (view profile)

Library to handle 3D geometric primitives: create, intersect, display, and make basic computations

demoDrawTubularMesh

demoGeom3d

demoInertiaEllipsoid

updated 3 months ago

### Sven (view profile)

Test if 3d points are inside a mesh. Or, voxelise a mask from a surface. Mesh can be non-convex too! (inpolygon, stl, mesh)

inpolyhedron(varargin)

updated 5 months ago

### Matt J (view profile)

Express polyhedra by vertices or (in)equalities. Also, find intersections and unions.

intersectionHull(varargin)

lcon2vert(A,b,Aeq,beq,TOL,checkbounds)

updated 6 months ago

### Tim Benham (view profile)

Computes the Chebyshev center and Chebyshev radius of a polytope.

chebycenter(A,b,r0)

updated 12 months ago

### YuFei Guo (view profile)

Test if points are inside/outside/on single material or multi-material triangulated polyhedron

Tutorial and examples of PINPOLYHEDRON function

first_step.m

updated 1 year ago

### Jaroslaw Tuszynski (view profile)

Tests if points are inside of triangulated volume.

Tutorial and tests of IN_POLYHEDRON function

in_polyhedron.m

updated 4 years ago

### Ankur Pawar (view profile)

Linearly spaced points between two point and ,point in Convex Hull test.

inConvHull(vert,face,testPoints)

pointsOnLine(point1,point2,numPoints)

sphericalDodecahedron

updated 4 years ago

### Tim Benham (view profile)

Computes the analytic center of a set of linear equations.

ancenter(A,b)

updated 6 years ago

### Per BergstrÃ¶m (view profile)

The program plots convex closed regions in 2D/3D.

plotregion.m

example5.m

example3.m

updated 6 years ago

### Bill McKeeman (view profile)

Display regular and semi regular geometric figures.

N-D Geometrical Figures

angles(e)

buckytumble

updated almost 8 years ago

### Edward Zechmann (view profile)

This program makes icosahedra of class 1, type 2, and frequency f.

build_icosa(x, y, z)

icosahedron_nodes(f, r)

make_icosahedron(f, r, sphere, make_plot, faceopaque)

updated 10 years ago

### Michael Kleder (view profile)

Computes the center of gravity of a convex polyhedron in any number of dimensions.

centroid(P)

updated 10 years ago

### Michael Kleder (view profile)

Create inequality constraints to bound the convex hull of the given points.

vert2con(V)

updated almost 13 years ago

### Malcolm A. MacIver (view profile)

Volume and area of a 3D convex hull.

area3d(v)