Changes between Version 16 and Version 17 of SoC2010
- Timestamp:
- Mar 10, 2010, 2:53:13 PM (13 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
SoC2010
v16 v17 95 95 Students should be familiar with C++ templates, STL-style data structures, and computer arithmetic. 96 96 97 98 == BigInt == 99 Implement a "big integer" data type which supports all C++ arithmetic and binary operators to do arbitrary precision calculations. This data type might also be specialized for fixed size big integers once the algorithms are in place which gives the compiler a better chance to optimize and which gets rid of the allocator parameter. Basic operations are relatively easy to implement. 100 101 Simply wrapping libraries like GMP will be insufficient for solving this problem due to licensing issues. 102 103 Students will require knowledge of C++ and a have a good math background. Familiarity with literature (Knuth's Seminumerical Algorithms) or other code on the subject is a plus. A successful proposal will include a discussion of licensing concerns. 104 97 105 == Sweepline Algorithm == 98 106 2D medial axis, Veronoi diagrams and Delaunay triangulation are three classical problems in computational geometry. Veronoi diagrams are well known to be the dual graph of delaunay triangulation, so if you solve one you have solved the other. Medial axis is also related to the other two because it can also be solved with sweepline. All three could be solved by a single generic-parameterized implementation of a sweepline algorithm.