From: Wolfgang Bangerth Date: Tue, 8 Jul 2025 19:54:08 +0000 (-0600) Subject: Update step-1. X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=refs%2Fpull%2F18642%2Fhead;p=dealii.git Update step-1. --- diff --git a/examples/step-1/doc/intro.dox b/examples/step-1/doc/intro.dox index df92925053..a7254a71b9 100644 --- a/examples/step-1/doc/intro.dox +++ b/examples/step-1/doc/intro.dox @@ -168,8 +168,8 @@ consider them equivalent. What this program shows, then, is how to create a Triangulation object, and to operate on it. The underlying concept of a -Triangulation is that it is a *container*, i.e., a class that stores a -*collection of cells*. As is common in modern programming languages, +Triangulation is that it is a *container*, i.e., a class that stores +a *collection of cells*. As is common in modern programming languages, the key operation on containers is that one can *iterate* over its elements, and that's exactly what we will do below. @@ -184,8 +184,14 @@ of the tutorial. (Since there are so many loops over cells in finite element programs, the @ref Iterators topic talks about them in more detail.) -The program is otherwise small enough that it doesn't need a whole lot -of introduction. +In the program shown below, we will use meshes of quadrilaterals +because, historically, this is what deal.II supported in 2d. However, +deal.II's Triangulation class is quite happy to also store triangles +these days (and tetrahedra, wedges, pyramids, and hexehedra in 3d), +and you can find a section further down below on this page explaining +how you can switch from quadrilaterals to triangles. The program is +otherwise small enough that it doesn't need a whole lot of +introduction. @dealiiVideoLecture{5,6}