The goal of this exercice session is to implement two algorithms for computing graph layouts.
|
MeshParameterization
and SpringDrawing which provides methods
for rendering the original mesh and computing the corresponding 2D and 3D layouts.
![]() |
IterativeTutteLayout that allows to compute a planar layout of the mesh; you will be asked to complete
the method oneIteration() that perform one iteration of the Tutte algorithm to compute the 2D coordinates of the vertices (they are stored in the field Point_2[] points).
FR91Layout that allows you to compute a (2D) layout of the input network obtained with the FR91 algorithm
(for more details, see the slides the lecture 4). You will be asked to complete
the method oneIteration().
