Repository logo
  • Communities & Collections
  • All of DSpace
  • English
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Guthe, Michael"

Now showing 1 - 3 of 3
Results Per Page
Sort Options
  • Loading...
    Thumbnail Image
    Item
    Real-Time Curvature-aware Re-Parametrization and Tessellation of Bézier Surfaces
    (The Eurographics Association, 2021) Buchenau, Christoph; Guthe, Michael; Andres, Bjoern and Campen, Marcel and Sedlmair, Michael
    Interactive tessellation of parametric surfaces has many applications in both engineering and entertainment computing. The most common primitives are bi-cubic Bézier patches which are, among others, an intermediate representation of subdivision surfaces for rendering. The current state-of-the-art employs hardware tessellation where a uniform subdivison pattern is used per patch. If the curvature varies strongly over a patch, this results in an over-tessellation of flat areas. Based on the observation that the second derivative changes linearly over the patch, we show that it is possible to reparameterize the patches such that the tessellation adapts to the curvature. This way, we reduce the number of primitives by an average of 15% for the same error bound.
  • Loading...
    Thumbnail Image
    Item
    Using Landmarks for Near-Optimal Pathfinding on the CPU and GPU
    (The Eurographics Association, 2020) Reischl, Maximilian; Knauer, Christian; Guthe, Michael; Lee, Sung-hee and Zollmann, Stefanie and Okabe, Makoto and Wuensche, Burkhard
    We present a new approach for path finding in weighted graphs using pre-computed minimal distance fields. By selecting the most promising minimal distance field at any given node and switching between them, our algorithm tries to find the shortest path. As we show, this approach scales very well for different topologies, hardware and graph sizes and has a mean length error below 1% while using reasonable amounts of memory. By keeping a simple structure and minimal backtracking, we are able to use the same approach on the massively parallel GPU, reducing the run time even further.
  • Loading...
    Thumbnail Image
    Item
    VMV 2023: Frontmatter
    (The Eurographics Association, 2023) Guthe, Michael; Grosch, Thorsten; Guthe, Michael; Grosch, Thorsten

Eurographics Association © 2013-2025  |  System hosted at Graz University of Technology      
DSpace software copyright © 2002-2025 LYRASIS

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback