viennamesh:viennamesh_puzzles

This shows you the differences between two versions of the page.

Both sides previous revision Previous revision | |||

viennamesh:viennamesh_puzzles [2015/03/17 14:39] viennastar |
viennamesh:viennamesh_puzzles [2015/03/17 15:01] (current) viennastar |
||
---|---|---|---|

Line 1: | Line 1: | ||

===== Puzzles ===== | ===== Puzzles ===== | ||

+ | |||

+ | |||

+ | ==== Project Euler: Integer Right Triangles ==== | ||

+ | |||

+ | Solve [[https://projecteuler.net/problem=39|Project Euler Problem 39]] as efficient and as elegant as possible. Document your source code and describe why your solution better than naive solutions. | ||

==== Simple Meshing Operations ==== | ==== Simple Meshing Operations ==== | ||

+ | |||

The following piece of source code shows a very simple C++ framework for triangular and quadraliteral meshing in 2D. The task for this puzzle is to complete the source-code. | The following piece of source code shows a very simple C++ framework for triangular and quadraliteral meshing in 2D. The task for this puzzle is to complete the source-code. | ||

At first the cell class should be specialized for triangles and quadraliterals. Simple tag classes are used for identification. A simple pre-implementation for a triangular cell is given but may be expanded by needed funcionality. Then two simple algorithms have to be implemented: | At first the cell class should be specialized for triangles and quadraliterals. Simple tag classes are used for identification. A simple pre-implementation for a triangular cell is given but may be expanded by needed funcionality. Then two simple algorithms have to be implemented: |

viennamesh/viennamesh_puzzles.txt ยท Last modified: 2015/03/17 15:01 by viennastar