VLGraham

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

returns the convex hull of a point list by Graham (outdated)

Description

This procedure calculates from an unsorted point list the sorted point list of the convex hull related to the Graham Algorithms (1972). It is a powerful function.
Remember also important list functions such as: unique, union, intersect, setdiff, ismember.

See Also: VLGrahamPVL

Example Illustration

missing image of VLGraham(VL)

Syntax

[CHVL,n]=VLGraham(VL)

Input Parameter

VL: Unsorted point list

Output Parameter

CHVL: Sorted point list of the convex hull
n: length of the convex hull

Examples


VLGraham(VLaddz(PLstar(10)))



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

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