Difference between revisions of "Manual/Plugins/List/Fill Area"
Jump to navigation
Jump to search
Line 3: | Line 3: | ||
|name=Fill Area | |name=Fill Area | ||
|screenshot=Plugin Dialog Fill Area.png | |screenshot=Plugin Dialog Fill Area.png | ||
− | |download=http://sourceforge.net/projects/knotter/files/plugins/fill_area.tar.gz | + | |download=http://sourceforge.net/projects/knotter/files/plugins/fill_area.tar.gz |
}} | }} | ||
Revision as of 17:09, 13 June 2013
Type | Script - Other |
---|---|
Requires | Knotter 0.9.3 |
Download | fill_area.tar.gz |
Detects an area from the active selection and fills it with a dense graph.
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.
Explanation of the polygon algorithms
Here are illustrated how the polygon algorithms affect the outcome of the fill.
Convex Hull