Lecture

Quadratic Fitting: Coefficients and Solutions

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

CS-457: Geometric computing

This course will cover mathematical concepts and efficient numerical methods for geometric computing. We will explore the beauty of geometry and develop algorithms to simulate and optimize 2D and 3D geometric models with an emphasis towards computational d ...

Description

This lecture covers the computation of mass and Laplacian matrices for mesh processing, including the assembly of these matrices using face quantities, the computation of cotangents in triangles, and the Laplace equation solution for mesh deformation. It also discusses the stopping criteria for mean curvature flow and the iterative process of solving the Laplace equation to update vertex positions.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Mark Pauly

Mark Pauly is a full professor at the School of Computer and Communication Sciences at EPFL. Prior to joining EPFL, he was assistant professor at the CS department of ETH Zurich since April 2005. From August 2003 to March 2005 he was a postdoctoral scholar at Stanford University, where he also held a position as visiting assistant professor during the summer of 2005. He received his Ph.D. degree (with distinction) in 2003 from ETH Zurich and his M.S. degree (with highest honors) in 1999 from TU Kaiserslautern. His research interests include computer graphics and animation, shape modeling and analysis, geometry processing, architectural geometry, and digital fabrication. He received the ETH medal for outstanding dissertation, was awarded the Eurographics Young Researcher Award in 2006 and the Eurographics Outstanding Technical Contributions Award in 2016.

Official source

Related concepts (14)

Geometry processing

Geometry processing, or mesh processing, is an area of research that uses concepts from applied mathematics, computer science and engineering to design efficient algorithms for the acquisition, reconstruction, analysis, manipulation, simulation and transmission of complex 3D models. As the name implies, many of the concepts, data structures, and algorithms are directly analogous to signal processing and .

Mean curvature flow

In the field of differential geometry in mathematics, mean curvature flow is an example of a geometric flow of hypersurfaces in a Riemannian manifold (for example, smooth surfaces in 3-dimensional Euclidean space). Intuitively, a family of surfaces evolves under mean curvature flow if the normal component of the velocity of which a point on the surface moves is given by the mean curvature of the surface. For example, a round sphere evolves under mean curvature flow by shrinking inward uniformly (since the mean curvature vector of a sphere points inward).

Cotangent bundle

In mathematics, especially differential geometry, the cotangent bundle of a smooth manifold is the vector bundle of all the cotangent spaces at every point in the manifold. It may be described also as the dual bundle to the tangent bundle. This may be generalized to with more structure than smooth manifolds, such as complex manifolds, or (in the form of cotangent sheaf) algebraic varieties or schemes. In the smooth case, any Riemannian metric or symplectic form gives an isomorphism between the cotangent bundle and the tangent bundle, but they are not in general isomorphic in other categories.

Cotangent space

In differential geometry, the cotangent space is a vector space associated with a point on a smooth (or differentiable) manifold ; one can define a cotangent space for every point on a smooth manifold. Typically, the cotangent space, is defined as the dual space of the tangent space at , , although there are more direct definitions (see below). The elements of the cotangent space are called cotangent vectors or tangent covectors. All cotangent spaces at points on a connected manifold have the same dimension, equal to the dimension of the manifold.

Curve-shortening flow

In mathematics, the curve-shortening flow is a process that modifies a smooth curve in the Euclidean plane by moving its points perpendicularly to the curve at a speed proportional to the curvature. The curve-shortening flow is an example of a geometric flow, and is the one-dimensional case of the mean curvature flow. Other names for the same process include the Euclidean shortening flow, geometric heat flow, and arc length evolution. As the points of any smooth simple closed curve move in this way, the curve remains simple and smooth.

Related lectures (13)

Meshing Algorithms Overview

Provides an overview of meshing algorithms for generating quality meshes in CAD software.

Introduction to Rhino Surfaces and Meshes

Introduces working with surfaces, polysurfaces, and solids in Rhino, covering rendering, material editing, and mesh creation.

Elastic Solid Energy Computation Log in to Mediaspace to watch this video

Covers the computation of elastic energy in solid mechanics and equilibrium steps using conjugate gradients.

Introduction to Rhino: Surfaces and Meshes

Introduces the fundamentals of working with NURBS and surfaces in Rhino, covering tools for creating curves, surfaces, and meshes.

Remeshing: Geometric Computing Log in to Mediaspace to watch this video