### Abstract

Many problems in geometric modeling can be described using variational formulations that define the smoothness of the shape and its behavior w.r.t. the posed modeling constraints. For example, high-quality C^{2} surfaces that obey boundary conditions on positions, tangents and curvatures can be conveniently defined as solutions of high-order geometric PDEs; the advantage of such a formulation is its conceptual representation-independence. In practice, solving high-order problems efficiently and accurately for surfaces approximated by meshes is notoriously difficult. For modeling applications, the preferred approach is to use discrete geometric schemes which are efficient and robust, but their convergence properties are less well understood compared to higher-order FEM. In this paper, we explore discretizations of common geometric PDEs on meshes using mixed finite elements, where additional variables for the derivatives in the problem are introduced. Such formulations use first-order derivatives only, allowing a discretization with simple linear elements. Various boundary conditions can be naturally discretized in this setting. We formalize continuous region constraints commonly used in modeling applications, and show that these seamlessly fit into the mixed framework. We demonstrate that some of the commonly used discrete geometric discretizations can be regarded as a particular case of mixed finite elements. We study the convergence behavior of our discretizations, and how they can be applied to implement common modeling tasks. Journal compilation

Original language | English (US) |
---|---|

Pages (from-to) | 1565-1574 |

Number of pages | 10 |

Journal | Computer Graphics Forum |

Volume | 29 |

Issue number | 5 |

DOIs | |

State | Published - 2010 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Networks and Communications

### Cite this

*Computer Graphics Forum*,

*29*(5), 1565-1574. https://doi.org/10.1111/j.1467-8659.2010.01765.x