PLFLofVLELdelaunay
by Tim C. Lueth, SG-Lib Toolbox: SolidGeometry 5.6 - VLFL/Surfaces
Introduced first in SolidGeometry 2.4, Creation date: 2015-08-21, Last change: 2025-09-14
closes a planar surface of VLEL by delaunay
Description
This function could be named also as FLofVLELdelaunay(VL,EL). In contrast to FLofPLEL it uses delaunayTriangulation insteadt of the outdated DelaunayTri
See Also: FLofPLEL
Example Illustration
Syntax
[PL,FL,EL]=PLFLofVLELdelaunay(VL,EL)
Input Parameter
VL: | | Vertex list [nx3] |
EL: | | Edge consraints |
Output Parameter
PL: | | Point List |
FL: | | Tesselated facet list |
EL: | | Same Edge List |
Copyright 2015-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, named PLFLofVLELdelaunay, is designed to close a planar surface using Delaunay triangulation. It is part of the SG-Library and was introduced in SolidGeometry 2.4. The function takes a vertex list and edge constraints as input and outputs a point list, a tessellated facet list, and the same edge list.
Input Parameters
- VL: Vertex list, an
nx3 matrix where each row represents a vertex in 3D space.
- EL: Edge constraints, which define the edges that should be preserved in the triangulation.
Output Results
- PL: Point List, which is essentially the same as the input vertex list.
- FL: Tessellated facet list, which contains the indices of vertices that form each triangular facet.
- EL: Same Edge List, which is the input edge constraints.
Algorithm Steps
- Convert the vertex list
VL into a point list PL using the function PLofVL.
- Check if the edge constraints
EL are empty:
- If
EL is empty, create a Delaunay triangulation TR2 using only the point list PL.
- If
EL is not empty, create a Delaunay triangulation TR2 using both the point list PL and the edge constraints EL.
- Extract the connectivity list from
TR2 for the interior triangles and assign it to FL.
- If no output arguments are specified, visualize the results using several plotting functions:
- Use
SGfigure to create a new figure and set the view angle.
- Plot the original vertex and facet list in green using
VLFLplot.
- Plot the point and facet list in red using
VLFLplot.
- Plot the edge constraints in black using
VLELplots.
- Apply lighting effects using
VLFLplotlight.
Algorithm explaination created using ChatGPT on 2025-08-19 00:12. (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