LLsort

by Tim C. Lueth, SG-Lib Toolbox: SolidGeometry 5.6 - Auxiliary function
Introduced first in SolidGeometry 1.1, Creation date: 2013-09-24, Last change: 2025-09-14

sorts a kinematic chain list similar to an edge list

Description

Very powerful procedure to separate link lists or edge lists into
Without a fixed joint list, LLsort plots the structure
Without a vertex list, LL sorts generates all joints on a circle
====================================================
Important is a Joint classification list (LLAnalyze)
V(1)=sorted list of joints
v(2)=number of following joints
v(3)=number of predecessing joints
v(4)=no branch point
v(5)=open end point

Example Illustration

missing image of LLsort(LL,GL,VL)

Syntax

[CIL,LLN,V]=LLsort([LL,GL,VL])

Input Parameter

LL: Link list (n x 2) of joints
GL: Base list of static joints, optional [];
VL: Vertex list, optional

Output Parameter

CIL: Connection index list
LLN: Sorted Link List
V: Node index list including classification




Copyright 2013-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

Last html export of this page out of FM database by TL: 2025-09-21