Manual/Plugins/List/Fill Area

Detects an area from the active selection and fills it with a dense graph.

Parameters

Dialog for this plugin

Delete original selection

If checked, the nodes selected when this plugin is triggered will be removed from the graph.

Polygon

Algorithm used to detect the area to be filled:

Convex Hull

The area will be the minimum convex polygon that contains all the nodes.

Single Edge Loop

The selected nodes are assumed to be all connected by a single loop of edges.

If this precondition is not met, the result will be inaccurate.

Grid Size

The size of the grid used to fill the area.

Explanation of the polygon algorithms

Here are illustrated how the polygon algorithms affect the outcome of the fill.

Convex Hull

• 

  Start with a set of vertices, edges between them are disregarded.

• 

  The algorithm calculates the convex hull.

• 

  The area inside the convex hull is filled.

Single Edge Loop

• 

  Start with a predefined polygon. There must not be extra edges or missing edges.

• 

  The area inside the polygon hull is filled.