Syntax
[VL,FL]=VLFLgrid8P2(PL,b)
Input Parameter
PL : | | List of 8 Points of a cuboid. |
b : | | Thickness of the solid grid structure |
Output Parameter
VL : | | Vertex list of the grid |
FL : | | Facet list of the grid |
Copyright 2012-2025 Tim C. Lueth. All rights reserved. The code is the property of Tim C. Lueth and may not be redistributed or modified without explicit written permission. This software may be used free of charge for academic research and teaching purposes only. Commercial use, redistribution, modification, or reverse engineering is strictly prohibited. Access to source code is restricted and granted only under specific agreements. For licensing inquiries or commercial use, please contact: Tim C. Lueth
Algorithm (Workflow)
This algorithm constructs a grid structure from a list of 8 points representing a cuboid. It uses the thickness parameter to define the solid grid structure.
Input Parameters
- PL: A list of 8 points that define the vertices of a cuboid. Each point is represented as a column in a matrix.
- b: The thickness of the solid grid structure.
Output Results
- VL: The vertex list of the grid.
- FL: The facet list of the grid.
Algorithm Steps
- Call
VLFLexpandPL
with the first four points of PL
and thickness b
to generate the initial vertex and facet lists NVL
and NFL
.
- Assign
NVL
to VL
and NFL
to FL
.
- Call
VLFLexpandPL
with the last four points of PL
and thickness b
to generate new vertex and facet lists NVL
and NFL
.
- Concatenate the new vertex and facet lists with the existing ones using
VLFLcat
.
- For each pair of corresponding points from the first and last four points of
PL
(i.e., points 1 and 5, 2 and 6, 3 and 7, 4 and 8), call VLFLbar2P
with thickness b
to generate connecting bars.
- Concatenate the resulting vertex and facet lists from each bar with the existing lists using
VLFLcat
.
Algorithm explaination created using ChatGPT on 2025-08-19 00:51. (Please note: No guarantee for the correctness of this explanation)
Last html export of this page out of FM database by TL: 2025-09-21