Find Boundary of Domain Filled with 2D or 3D Simplices

Versione 1.0.0.4 (28 KB) da André Flakke
Finds the boundary of a domain filled with 2D or 3D simplices using the nodal connectivity list.
0.0
(0)
73 download
Aggiornato 31 dic 2018

Visualizza la licenza

% The function takes a nodal connectivity list
% formed from a triangulation of a domain by triangles or tetrahedrons
% , for example using the built-in 'delaunay()' of Matlab.
% The function returns a matrix 'dtri' with the nodal
% connectivity list of the boundary triangulation consisting of the face triangles
% as given by 'dtri'.
% NOTE: The algorithm does not support any other mesh than those filled with linear triangles or tetrahedrons.

Cita come

André Flakke (2025). Find Boundary of Domain Filled with 2D or 3D Simplices (https://it.mathworks.com/matlabcentral/fileexchange/67177-find-boundary-of-domain-filled-with-2d-or-3d-simplices), MATLAB Central File Exchange. Recuperato .

Compatibilità della release di MATLAB
Creato con R2017a
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Categorie
Scopri di più su Triangulation Representation in Help Center e MATLAB Answers
Tag Aggiungi tag

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Versione Pubblicato Note della release
1.0.0.4

Added support for domains filled with (2D) triangles. In addition, functions for computing volumes, areas and line segments using the nodal connectivity list and point cloud, are provided.

1.0.0.3

Changed title.

1.0.0.2

The previous version had a quite large runtime complexity. This version uses roughly 218, 38 and 3 seconds respectively, finding the boundary of a mesh filled with respectively 3077, 1296 and 384 tetrahedrons on a standard laptop.

1.0.0.0