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

版本 1.0.0.4 (28.0 KB) 作者: André Flakke
Finds the boundary of a domain filled with 2D or 3D simplices using the nodal connectivity list.
0.0
(0)
69.0 次下载
更新时间 2018/12/31

查看许可证

% 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.

引用格式

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

MATLAB 版本兼容性
创建方式 R2017a
兼容任何版本
平台兼容性
Windows macOS Linux
类别
在 Help Center 和 MATLAB Answers 中查找有关 Triangulation Representation 的更多信息

Community Treasure Hunt

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

Start Hunting!

版本 已发布 发行说明
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