Got Questions? Get Answers.
Discover MakerZone

MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn more

Discover what MATLAB® can do for your career.

Opportunities for recent engineering grads.

Apply Today

Thread Subject:
Constrained 3D Delaunay Triangulation

Subject: Constrained 3D Delaunay Triangulation

From: Liana

Date: 2 Apr, 2011 23:56:04

Message: 1 of 2

Hi,

I wonder if there is any 3D analogue of the following function aimed at 2D Constrained Detaunay Triangulation:
X = rand(10,3);
dt = DelaunayTri(X);
isInside = inOutStatus(dt); % Find the indices of inside triangles

I'd like to find out the same function for constrained 3D Delaunay Triangulation.

Thanks!

Subject: Constrained 3D Delaunay Triangulation

From: Liana

Date: 3 Apr, 2011 06:43:04

Message: 2 of 2

Well, I solved the problem myself as follows:
% Run DElaunay Triangulation algorithm second time just for obstacle vertices
obst = DelaunayTri(handles.obsVertices);
% Get the convex hull
ch = convexHull(obst);
%
testpts = [ 0 0 0; 10 10 15];
% Use 'inhull' function developed by John D'Errico
in = inhull(testpts,handles.obsVertices,ch);

"Liana" wrote in message <in8d2k$r15$1@fred.mathworks.com>...
> Hi,
>
> I wonder if there is any 3D analogue of the following function aimed at 2D Constrained Detaunay Triangulation:
> X = rand(10,3);
> dt = DelaunayTri(X);
> isInside = inOutStatus(dt); % Find the indices of inside triangles
>
> I'd like to find out the same function for constrained 3D Delaunay Triangulation.
>
> Thanks!

Tags for this Thread

No tags are associated with this thread.

What are tags?

A tag is like a keyword or category label associated with each thread. Tags make it easier for you to find threads of interest.

Anyone can tag a thread. Tags are public and visible to everyone.

Contact us