[ 201GEOMSP2V12 ] VL Special Topics Geometry

Es ist eine neuere Version 2018W dieser LV im Curriculum Bachelor's programme Technical Mathematics 2018W vorhanden.
(*) Unfortunately this information is not available in english.
Workload Education level Study areas Responsible person Hours per week Coordinating university
3 ECTS B3 - Bachelor's programme 3. year Mathematics Bert J├╝ttler 2 hpw Johannes Kepler University Linz
Detailed information
Original study plan Bachelor's programme Technical Mathematics 2012W
  • Get experience in working on a C++ software development project. Obtain technical and programming skills related to scientific computing.
  • Obtain insight into Geometric objects in B-spline form and their applications. Understand fundamental algorithms for B-splines and their algorithmic implementation.
Subject B-spline curves, surfaces and volumes and their applications in modeling and simulation, and their algorithmic implementation in C++.
Criteria for evaluation
Language  English
Study material Gerald Farin, Curves and Surfaces for CAGD

Les Piegl, Wayne Tiller, The NURBS Book

Cottrell, J. Austin, Thomas J.R. Hughes, Yuri Bazilevs, Isogeometric Analysis: Toward Integration of CAD and FEA

Edward Scheinerman, C++ for Mathematicians: An Introduction for Students and Professionals

Bjarne Stroustrup, The C++ Programming Language (

Vinu V. Das, Principles of Data Structures Using C and C++

Dasgupta, Papadimitriou, and Vazirani, Algorithms (

Changing subject? Yes
Further information Required previous knowledge include basics on linear algebra and geometry, and some knowledge in programming in general.

This is a follow-up seminar related to the Special Topics Geometry course offered during 2013W. Participants will be assigned topics related to implementation of geometry and simulation algorithms.

Having followed "Geometric algorithms for scientific computing in C++" duing 2013W is an advantage but not a requirement.

Corresponding lecture (*)TM1WLVOSPVL: VO Spezialvorlesung (3 ECTS)
On-site course
Maximum number of participants -
Assignment procedure Direct assignment