Manual/Plugins/List/Fill Area

Fill_area

Type	Script - Other
Requires	Knotter [[Version/|]]
Download	fill_area.tar.gz
Browse Files	fill_area

Parameters

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.

Outline

Instead of filling the area will create an outline of it.

Inset/Outset

Whether it should grow inside or outside the selected area

Thickness

Thickness of the outline.

Note that the outline is still filled as a grid so Grid Size should be less than Thickness to get a nice effect.

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.