Operations (some)

original	merge	a-b	b-a	intersect	exor	makering	negative_cor	positive_cor

• Introduction
• screenshots
• Copyright License?
• C ++ source, executables and documentation for download
• Acknowledgments, Feedback, mailing list
• documentation (algorithm)
• documentation commands and graphical interface and GDSII format and KEY format

• GDSII files (tree of structures containing polygons and polylines on layers).
• KEY files (own made extended GDSII in ascii format)

supports : circles, arcs, text, polygons(including arc segments), polylines(including arc segments) , boxes, structures, references to structures, all with a width parameter,
user defined properties to primitives and structures.
• DAVID MANN files (david man flash format for mask plotting)

Features:

• It allows to draw primitives on a chosen layer, and to manipulate them. A (limited) undo mechanism is available to support this.
• stack oriented tools allows zooming while drawing new primitives and editing them. This also makes it possible to draw extremely accurate.
• primitives on the layers or/can be transparent
• colors and fill patterns can be set on a layer basis
• drawing order of layers can be changed
• a hiearchy of pictures, named structures, can be handled and manipulated seperately
• saving as a bitmap and other formats.
• measuring distances
• adding user defined properties to primitives

Operation:

• boolean OR AND EXOR A-B B-A
• positive and negative process offset
• circle recognition in polygon and polyline data.
• move copy delete etc.
• transformations (scaling , rotation , moving)
• flatten the hiearchy of the drawing
• drivers for CNC (laser and milling machinery)

The algorithm description

1. convert all polygons to graph structures
2. combine all graph segments in to one big graph
3. calculate all intersections between the graphs using a scanbeam and insert them as extra vertices/segments
1. first at 0 degrees angle, snapping vertices and lines that are within the snapping range in vertical direction.
2. secondly at 90 degrees angle, snapping vertices and lines that are within the snapping range in horizontal direction.

(just swapping x,y coordinates)
4. set appropriate segment flags for all boolean operations at once using a scanbeam
5. extract for the given boolean operation the resulting graphs (hole graphs and outside graphs).
6. link holes into outside graphs using a scanbeam.
7. extract resulting polygons from the graph structures again

The graphical and the command line version of the program, are based on a command interpreter. In order to make the code more platform independent and to make it possible to record the commands to a file for later repetition. Click for   Command Help to see an overview of the complete set of commands.

The graphical interface help system is based on HTML here (graphical help system)   you will find the context sensitive help.
The GDSII and KEY format description is also part of it.