Decomposition and intersection of simple splinegons (Q1105375): Difference between revisions

A splinegon is a polygon whose edges have been replaced by ``well- behaved'' curves. We show how to decompose a simple splinegon into a union of monotone pieces and into a union of differences of unions of convex pieces. We also show how to use a fast triangulation algorithm to test whether two given simple splinegons intersect. We conclude with examples of splinegons that make the extension of algorithms from polygons to splinegons difficult.