Category Archives: Tutorial

Tutorial 11 – Electric fields on surfaces

As described in the lecture a charge distribution \(\rho\colon \mathrm M \to \mathbb R\) in a uniformly conducting surface \(M\) induces an electric field \(E\), which satisfies Gauss’s and Faraday’s law\[\mathrm{div}\,E = \rho, \quad \mathrm{curl}\, E = 0.\]In particular, on a simply … Continue reading

Posted in Tutorial | Comments Off on Tutorial 11 – Electric fields on surfaces

Tutorial 10 – Discrete minimal surfaces

In the lecture we have defined what we mean by a discrete minimal surface. The goal of this tutorial is to visualize such minimal surfaces. Let \(\mathrm M\) be a discrete surface with boundary and let \(V, E, F\) denote the set of vertices, … Continue reading

Posted in Tutorial | Comments Off on Tutorial 10 – Discrete minimal surfaces

Tutorial 9 – The Dirichlet problem

In the lecture we saw that the Dirichlet energy has a unique minimizer among all functions with prescribed boundary values. In this tutorial we want to visualize these minimizers in the discrete setting. Let \(\mathrm M\subset \mathbb R^2\) be a triangulated surface … Continue reading

Posted in Tutorial | Comments Off on Tutorial 9 – The Dirichlet problem

Tutorial 8 – Flows on functions

Last time we looked at the gradient flows of functions defined on the torus \(\mathrm T^n\). This time we will look at flows on the space of Fourier polynomials \(\mathcal F_N\). Let us first restrict ourselves to the real-valued Fourier polynomials \(\mathcal F_N^{\mathbb R} \subset … Continue reading

Posted in Tutorial | Comments Off on Tutorial 8 – Flows on functions

Tutorial 7 – Visualization of gradient fields

In class we discussed how to generate smoothed random functions on the discrete torus and how to compute their discrete gradient and the symplectic gradient. In this tutorial we want to visualize the corresponding flow. As described in a previous … Continue reading

Posted in Tutorial | Comments Off on Tutorial 7 – Visualization of gradient fields

Tutorial 6: Close-to-conformal parametrizations of Hopf tori

In this tutorial we want to construct Hopf cylinders and Hopf tori. These are flat surfaces in \(\mathrm S^3\) and allow for an easy conformal parametrization when mapped to Euclidean 3-space by stereographic projection. For tori we will encounter a problem similar to … Continue reading

Posted in Tutorial | Comments Off on Tutorial 6: Close-to-conformal parametrizations of Hopf tori

Tutorial 5: Lawson’s minimal surfaces and the Sudanese Möbius band

In the last tutorial we constructed certain minimal surfaces in hyperbolic space. These hyperbolic helicoids were generated by a 1-parameter family of geodesics: while moving on a geodesic – the axis of the helicoid – another geodesic perpendicular to the axis was … Continue reading

Posted in Tutorial | Comments Off on Tutorial 5: Lawson’s minimal surfaces and the Sudanese Möbius band

Tutorial 4: Hyperbolic helicoids

A ruled surface is a surface in \(\mathbb R^3\) that arises from a 1-parameter family of straight lines, i.e. these surfaces are obtained by moving a straight line though the Euclidean space. E.g. a normal vector field of a curve defines such … Continue reading

Posted in Tutorial | Comments Off on Tutorial 4: Hyperbolic helicoids

Tutorial 3: Framed Closed Curves

A closed discrete curve \(\gamma\) is map from a discrete circle \(\mathfrak S_n^1 =\{z\in\mathbb C \mid z^n = 1\}\), \(n\in \mathbb N\), into some space \(\mathrm M\). In some situations it is more convenient to consider the discrete circle just as \(\mathbb Z/n\mathbb Z\),\[\mathbb … Continue reading

Posted in Tutorial | Comments Off on Tutorial 3: Framed Closed Curves

Tutorial 2: Framed Discrete Curves

A discrete curve \(\gamma\) in a space \(\mathrm M\) is just a finite sequence of points in \(\mathrm M\), \(\gamma = (\gamma_0,…,\gamma_{n-1})\). In case we have discrete curve \(\gamma\) in \(\mathbb R^3\) we can simply draw \(\gamma\) by joining the points by straight … Continue reading

Posted in Tutorial | Comments Off on Tutorial 2: Framed Discrete Curves