FLfeatureEdgeSurface

by Tim C. Lueth, SG-Lib Toolbox: SolidGeometry 5.6 - FS/Feature Surfaces
Introduced first in SolidGeometry 2.1, Creation date: 2014-12-30, Last change: 2025-09-14

returns a surface facet list based on a given surface triangulation

Description

This function analyses the feature edges of a surface, reconnects them into contours, and uses delaunay triangulation on the same points to recalculate the surface. It uses
TRfeatureEdgeFacets
PLELofFeatureEdges2
FLofVLELn
for reconstruction.

See Also: FLfeatureEdgeSurface , FLfeatureEdgeSurface2 , PLELofFeatureEdges , PLELofFeatureEdges2 , TRfeatureEdgeFacets , FEplot

Example Illustration

 missing image of FLfeatureEdgeSurface(TR3,angle)

Syntax

FL=FLfeatureEdgeSurface(TR3,angle)

Input Parameter

TR3: Surface volume triangulation
angle: filter angle for feature edges

Output Parameter

FL: Facet List w.r.t TR3.Points

Examples

Create a solid and recreate the surface
SG=SGsample(7);
VLFLplots(SG.VL, FLfeatureEdgeSurface(triangulation(SG.FL,SG.VL),0.01),'g');




Copyright 2014-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, FLfeatureEdgeSurface, is designed to analyze and reconstruct the feature edges of a surface based on a given surface triangulation. It uses several helper functions to achieve this, including TRfeatureEdgeFacets, PLELofFeatureEdges2, and FLofVLELn.

Input Parameters

Output

Algorithm Steps

  1. Extract the vertex list VL from the triangulation TR3.
  2. Call PLELofFeatureEdges2 with TR3 and angle to obtain the edge list ELFL and segment information list SIL.
  3. Determine the number of unique segments n from SIL.
  4. Initialize an empty facet list FL.
  5. For each segment i from 1 to n:
  6. If no output is requested, plot the vertex list and facet list using VLFLplots with the color 'g' (green).
Algorithm explaination created using ChatGPT on 2025-08-19 01:32. (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