Recursive longest-edge bisection
Given element and nodal data, this routine can be used to refine the selected elements. Only 4-node tetrahedron elements are allowed. During the refinement, only the edge which is the longest one of all the elements that share it will be cut, otherwise, recursive search will be performed in surrounding elements until such refinement can be performed.
% [ix, nix, x, nx, u, r] = recr_bisc_tet4( id, ix, nix, x, nx, u, r)
% ------------------------------------------------------------------
% Recursively bisect the longest edge of targeted elements
% WZ. Shan, 03/03/2009
% ----------------------------------------------------------------
% Input:
% id: indices of targeted elements
% ix: element connectivity, [p1, p2, p3, p4]
% nix : number of elements
% x : nodal coordinates, [x, y, z]
% nx : number of nodes
% u : nodal displacements, [ux, uy, uz]
% r : nodal force, [rx, ry, rz]
% Output:
% updated input value, See above
Cite As
Wenzhe Shan (2024). Recursive longest-edge bisection (https://www.mathworks.com/matlabcentral/fileexchange/24381-recursive-longest-edge-bisection), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
- Image Processing and Computer Vision > Image Processing Toolbox > Image Segmentation and Analysis > Object Analysis >
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Version | Published | Release Notes | |
---|---|---|---|
1.0.0.0 |