SGsample4APredator

by Tim C. Lueth, SG-Lib Toolbox: SolidGeometry 5.6 - Samples
Introduced first in SolidGeometry 5.0, Creation date: 2020-11-08, Last change: 2025-08-19

Creates the SG for the Anycubic Z-Level testing solid

Description

The original Anycubic Z-Level testing solid for the Predator/Delta-robot ist available only as gcode
contains
SGwriteSTL(SG,'SGsample4APredator');


See Also: SGsample , CPLAnycubicPredator

Example Illustration

 missing image of SGsample4APredator

Syntax

SG=SGsample4APredator

Output Parameter

SG: Solid Geometry

Examples

Simply type
SGsample4APredator




Copyright 2020-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, SGsample4APredator, generates a solid geometry (SG) model for testing the Z-level of an Anycubic Predator 3D printer. The function does not take any input parameters and outputs a solid geometry object, SG.

Parameters and Variables

Algorithm Steps

  1. Initialize CPL as an empty matrix.
  2. Loop through each radius in Ro:
    • For each radius, append a circle with that radius to CPL.
    • Append a NaN separator to CPL.
    • Append a circle with a reduced radius (Ro(i) - B) to CPL.
    • Append another NaN separator.
  3. Remove the last NaN separator from CPL.
  4. Union the CPL with a square of size max(Do) - B/2 and thickness B.
  5. Union the CPL with another square of thickness B and size max(Do) - B/2.
  6. Union the CPL with a circle of the smallest radius in Ro.
  7. Create the solid geometry SG from the combined planar geometry CPL with height H.

Output and Visualization

Algorithm explaination created using ChatGPT on 2025-08-19 00:40. (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