Loading...
Please wait, while we are loading the content...
Similar Documents
Algorithms for Complex Shapes with Certified Numerics and Topology The New cgal ’ s Arrangement Package Efi
| Content Provider | Semantic Scholar |
|---|---|
| Author | Fogel Wein, Ron Zukerman, Baruch Haran, Idit |
| Copyright Year | 2006 |
| Abstract | Arrangements of planar curves are fundamental structures in computational geometry. Recently, the arrangement package of cgal, the Computational Geometry Algorithms Library, has been redesigned and re-implemented exploiting several advanced programming techniques. The resulting software package, which constructs and maintains planar arrangements, is easier to use, to extend, and to adapt to a variety of applications. It is more efficient spaceand time-wise, and more robust. The implementation is complete in the sense that it handles degenerate input, and it produces exact results. The new package will be distributed as part of the forthcoming public version of cgal 3.2. In this report we list the new features and major improvements of the new package compared to the old packages replaced by the new one. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://acs.cs.rug.nl/acstr/ACS-TR-123204-01.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
