Loading...
Please wait, while we are loading the content...
ACS Algorithms for Complex Shapes with Certified Numerics and Topology A CGAL Package for the Exact and Efficient Construction of Planar Minkowski Sums and Offsets using the Convolution Method
| Content Provider | Semantic Scholar |
|---|---|
| Author | Wein, Ron |
| Copyright Year | 2007 |
| Abstract | We provide a Cgal package for computing Minkowski sums and offset polygons in 2D. Our package includes functions for computing the Minkowski sum of two planar polygons, and for computing the sum of a polygon and a disc (an operation known as offsetting the polygon). The package contains algorithms that use the prevailing computation methods, based on convex polygon decomposition, and algorithms that use the more effective convolution method (see ACS-TR-241300-04). |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://acs.cs.rug.nl/acstr/ACS-TR-243400-02.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |