VLULplot

by Tim C. Lueth, SG-Lib Toolbox: SolidGeometry 5.6 - Visualization
Introduced first in SolidGeometry 1.0, Creation date: 2012-04-21, Last change: 2025-09-14

Plots the union list of an object, union face by union face



See Also: ULofVLFL , FLofUL , TofVLUL , TofVLULez , VLFLtextattachVLUL , VLULuniontype

Example Illustration

 missing image of VLULplot (VL,UL,c,Amin,p)

Syntax

VLULplot(VL,UL,[c,Amin,p])

Input Parameter

VL: Vertex list of the object
UL: Union list of the object
c: color of unions
Amin: Minimal size to plot
p: delay between unions; -1 == step by keyboard




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, VLULplot, is designed to visualize the union list of an object, face by face. It is part of the SolidGeometry library and was introduced by Tim Lueth in 2012. The function takes in several parameters to control the visualization process.

Input Parameters

Algorithm Steps

  1. Initialize default values for color (c), minimal area (Amin), and delay (p) if they are not provided.
  2. Determine the number of unions (n) and the number of faces (k) from the union list (UL).
  3. Check if Amin is a matrix. If so, set kl to Amin and adjust k accordingly. Otherwise, set kl to 1 through k.
  4. If p is -1 and Amin is not provided, call VLFLplot to plot the entire object and return.
  5. Initialize variables for timing and control of the plotting loop.
  6. Loop through each union (i from 1 to k):
  7. If the loop is exited early (i < k), print a message indicating that the plotting was aborted due to the area being smaller than Amin, and note the number of unions not plotted.
Algorithm explaination created using ChatGPT on 2025-08-19 08: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