Syntax
EL=ELomitedgesVLEL(VL,EL)
Input Parameter
VL : | | Vertex list |
EL : | | Edge List, must be sorted |
Output Parameter
EL : | | New Edge list, maybe shorter |
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 algorithm is designed to process edge lists derived from grid structures and remove edges that have the same direction, which are often unnecessary for polygonal descriptions.
Input Parameters
- VL: Vertex List - A list of vertices that define the points in the grid structure.
- EL: Edge List - A list of edges that connect the vertices. This list must be sorted before being processed by the function.
Output
- EL: A new Edge List that may be shorter than the input list, as it omits edges with the same direction.
Function Explanation
The function ELomitedgesVLEL
calls another function ELomitVLEL
with the same input parameters, VL
and EL
. The purpose of this function is to filter out edges that have the same direction, thereby potentially reducing the number of edges in the list.
Assumptions
- The input edge list
EL
is already sorted.
- The function
ELomitVLEL
is responsible for the actual logic of omitting edges with the same direction.
Algorithm explaination created using ChatGPT on 2025-08-18 22:16. (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