Browsing by Author "Campen, Marcel"

Now showing items 1-6 of 6

    • Exact Constraint Satisfaction for Truly Seamless Parametrization 

      Mandad, Manish; Campen, Marcel (The Eurographics Association and John Wiley & Sons Ltd., 2019)
      In the field of global surface parametrization a recent focus has been on so-called seamless parametrization. This term refers to parametrization approaches which, while using an atlas of charts to enable the handling of ...

    • Rational Bézier Guarding 

      Khanteimouri, Payam; Mandad, Manish; Campen, Marcel (The Eurographics Association and John Wiley & Sons Ltd., 2022)
      We present a reliable method to generate planar meshes of nonlinear rational triangular elements. The elements are guaranteed to be valid, i.e. defined by injective rational functions. The mesh is guaranteed to conform ...

    • SGP 2022 CGF 41-5: Frontmatter 

      Campen, Marcel; Spagnuolo, Michela (The Eurographics Association and John Wiley & Sons Ltd., 2022)

    • Simpler Quad Layouts using Relaxed Singularities 

      Lyon, Max; Campen, Marcel; Kobbelt, Leif (The Eurographics Association and John Wiley & Sons Ltd., 2021)
      A common approach to automatic quad layout generation on surfaces is to, in a first stage, decide on the positioning of irregular layout vertices, followed by finding sensible layout edges connecting these vertices and ...

    • Surface Map Homology Inference 

      Born, Janis; Schmidt, Patrick; Campen, Marcel; Kobbelt, Leif (The Eurographics Association and John Wiley & Sons Ltd., 2021)
      A homeomorphism between two surfaces not only defines a (continuous and bijective) geometric correspondence of points but also (by implication) an identification of topological features, i.e. handles and tunnels, and how ...

    • TinyAD: Automatic Differentiation in Geometry Processing Made Simple 

      Schmidt, Patrick; Born, Janis; Bommes, David; Campen, Marcel; Kobbelt, Leif (The Eurographics Association and John Wiley & Sons Ltd., 2022)
      Non-linear optimization is essential to many areas of geometry processing research. However, when experimenting with different problem formulations or when prototyping new algorithms, a major practical obstacle is the need ...