FLtest2

by Tim C. Lueth, SG-Lib Toolbox: SolidGeometry 5.6 - SG/Solids
Introduced first in SolidGeometry 1.0, Creation date: 2012-07-16, Last change: 2025-08-19

returns a Vertex and Facet list from an Vertex list and Edge list

Example Illustration

missing image of FLtest2(p1,p2,p3,OVL,OEL,IVL,IEL)

Syntax

[VLA,FLA,VLB,FLB]=FLtest2(p1,p2,p3,OVL,OEL,[IVL,IEL])

Input Parameter

`p1`:
`p2`:
`p3`:
`OVL`:
`OEL`:
`IVL`:
`IEL`:

Output Parameter

`VLA`:
`FLA`:
`VLB`:
`FLB`:

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, FLtest2, processes vertex and edge lists to return two sets of vertex and facet lists. It is part of the SG-Library and was created by Tim Lueth in 2012.

Input Parameters

p1, p2, p3: These are points used to define a plane or region in space.
OVL: Original Vertex List, a matrix of vertex coordinates.
OEL: Original Edge List, a matrix defining edges between vertices.
IVL (optional): Additional Vertex List, used if provided.
IEL (optional): Additional Edge List, used if provided.

Output Results

VLA: Vertex List A, a subset of vertices.
FLA: Facet List A, facets associated with VLA.
VLB: Vertex List B, another subset of vertices.
FLB: Facet List B, facets associated with VLB.

Algorithm Steps

Set a tolerance level tol=0.0001 and round the OVL to this tolerance using rounddiv.
Initialize empty lists for VLA, FLA, VLB, and FLB.
Check if additional vertex and edge lists (IVL, IEL) are provided. If so, process them similarly to OVL.
If IEL is not empty, concatenate OVL, OEL, IVL, and IEL using VLELcat2. Otherwise, use OVL and OEL as they are.
Remove duplicate vertices using unique and update edge lists accordingly.
Create a Delaunay triangulation dt using the vertex and edge lists.
Determine which triangles are inside the defined region using inOutStatus.
Recalculate missing z-values for vertices using VLof3PXYL with points p1, p2, and p3.
Assign vertices and facets to VLA and FLA for inside triangles, and to VLB and FLB for outside triangles.
Shorten the vertex and facet lists using VLFLshort.
Store constraints from the Delaunay triangulation in CLA.

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