StgDomain Component Codex

Organisation:

VPAC

Project:

StgDomain

Location:

./StgDomain/Geometry/src/

Project Web:

https://csd.vpac.org/twiki/bin/view/Stgermain/WebHome

Copyright:

StGermain Framework. Copyright (C) 2003-2005 VPAC.

License:

https://csd.vpac.org/twiki/bin/view/Stgermain/SoftwareLicense

Parent:

Delaunay

Children:

Description:

Delaunay works on a set of 2D points. It uses the Constrained Delaunay Algorithm to generate a network between these points. Once that step is complete it generates a dual graph, a Voronoi Diagram, based on the Delaunay Triangulation. Delaunay can also generate a Convex Hull based on the set of points. This is a multi-processor implementation of Delaunay, useful on multi-processor system for large data sets, speed-critical applications or where memory resources are limited. Parallel processing of Delaunay is done by dividing the 2D set into equally-sized regions along the x-axis, then assigning each area to a different processor. The parallel approach is quicker and more efficient than the single-processor version because the memory required by the recursive, divide-and-conquer Delaunay Algorithm increases nonlinearly as the number of data-points scales-up. The algorithm is no longer constrained by the memory resources of a single processor because each processor manages only a discrete, longitudinal slice of the graph. Dividing the set introduces boundary-cases where triangles overlap regions handled by two adjacent processors. These triangles are detected then mirrored on both processors. This repeated data imposes a minimal overhead and is superimposed when recombining the slices to form the final output diagram.

Example:

Params

Name	Type	Default	Description

Dependencies

Type	Essential	Description	Name	FallbackKey