Planar Minkowski Sums
Reference Manual

Ron Wein

Introduction

This package consist of functions for computing the Minkowksi sum of two polygons in the plane. Namely, given two polygons P,Q ∈ ℝ² it computes P ⊕ Q = { p + q  |  p ∈ P, q ∈ Q }.

In addition, the package also includes functions for offsetting a polygon, namely computing its Minkowski sum with a disc of a given radius, and for insetting a polygon (namely computing its inner offset). It is possible to compute the exact representation of the offset (or the inset), or to approximate it with guaranteed error bounds, in order to speed up the computation time.

Functions

CGAL::minkowski_sum_2
CGAL::approximated_offset_2
CGAL::approximated_inset_2
CGAL::offset_polygon_2
CGAL::inset_polygon_2

Concepts

PolygonConvexDecomposition_2

Classes

CGAL::Small_side_angle_bisector_decomposition_2<Kernel,Container>
CGAL::Optimal_convex_decomposition_2<Kernel,Container>
CGAL::Hertel_Mehlhorn_convex_decomposition_2<Kernel,Container>
CGAL::Greene_convex_decomposition_2<Kernel,Container>

24.4   Alphabetical List of Reference Pages