VLELcat2
by Tim C. Lueth, SG-Lib Toolbox: SolidGeometry 5.6 - EL/Edge Lists
Introduced first in SolidGeometry 1.0, Creation date: 2012-07-16, Last change: 2025-09-14
Simple concatenation of two vertex lists and edge lists.
Description
Does not remove unused vertice, also VLELcat does not do this
See Also: VLELcat
Example Illustration
Syntax
[VL,EL,E2]=VLELcat2(V1,E1,V2,E2)
Input Parameter
V1: | | Vertex list 1 |
E1: | | Edge list 1 |
V2: | | Vertex list 2 |
E2: | | Edge list 2 |
Output Parameter
VL: | | [V1;V2] |
EL: | | [E1;E2+size(V1,1)] |
E2: | | E2+size(V1,1) |
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 function, VLELcat2, is designed to concatenate two sets of vertex lists and edge lists. It is part of the SolidGeometry library and was created by Tim Lueth. The function does not remove unused vertices.
Input Parameters
- V1: The first vertex list. It is a matrix where each row represents a vertex.
- E1: The first edge list. It is a matrix where each row represents an edge, defined by indices of vertices in V1.
- V2: The second vertex list. Similar to V1, it is a matrix where each row represents a vertex.
- E2: The second edge list. Similar to E1, it is a matrix where each row represents an edge, defined by indices of vertices in V2.
Output Results
- VL: The concatenated vertex list, which is simply the vertical concatenation of V1 and V2. This is achieved by the operation [V1;V2].
- EL: The concatenated edge list. It is formed by concatenating E1 with the adjusted E2. The adjustment to E2 is necessary to account for the new indices of vertices from V2 in the combined vertex list. This is done by adding the number of vertices in V1 to each index in E2, using the operation E2+size(V1,1).
- E2: The adjusted second edge list, where each index is incremented by the number of vertices in V1. This ensures that the edges in E2 correctly reference the vertices in the concatenated vertex list VL.
The function performs these operations without removing any unused vertices, maintaining the integrity of the original vertex and edge lists.
Algorithm explaination created using ChatGPT on 2025-08-18 22:27. (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