A procedure for computing the symmetric difference of regions defined by polygonal curves

DOI10.1016/J.JSC.2013.10.008MaRDI QIDQ2437305zbMATH OpenOpenAlexFDO

Authors Miguel Belbut Gaspar, Nelson Martins-Ferreira

Publication date 3 March 2014

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2013.10.008

zbMATH Keywords

unionintersectionoperationsymmetric differenceregions in the planeset differencegraph with symmetryoriented closed simple curves

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• A CONVEX DEFICIENCY TREE ALGORITHM FOR CURVED POLYGONS
• Robust polygon modelling
• A parallel algorithm for computing polygon set operations
• Inner and outer rounding of Boolean operations on lattice polygonal regions
• On the approximate computation of the geometric difference of sets

Cites work

• Conflict-free coloring of points and simple regions in the plane
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles

This page was built for publication: A procedure for computing the symmetric difference of regions defined by polygonal curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437305)