Browsing 36-Issue 2 by Subject "Geometric algorithms"

Now showing items 1-7 of 7

    • Chamber Recognition in Cave Data Sets 

      Schertler, Nico; Buchroithner, Manfred; Gumhold, Stefan (The Eurographics Association and John Wiley & Sons Ltd., 2017)
      Quantitative analysis of cave systems represented as 3D models is becoming more and more important in the field of cave sciences. One open question is the rigorous identification of chambers in a data set, which has a deep ...

    • Design Transformations for Rule-based Procedural Modeling 

      Lienhard, Stefan; Lau, Cheryl; Müller, Pascal; Wonka, Peter; Pauly, Mark (The Eurographics Association and John Wiley & Sons Ltd., 2017)
      We introduce design transformations for rule-based procedural models, e.g., for buildings and plants. Given two or more procedural designs, each specified by a grammar, a design transformation combines elements of the ...

    • Diffusion Diagrams: Voronoi Cells and Centroids from Diffusion 

      Herholz, Philipp; Haase, Felix; Alexa, Marc (The Eurographics Association and John Wiley & Sons Ltd., 2017)
      We define Voronoi cells and centroids based on heat diffusion. These heat cells and heat centroids coincide with the common definitions in Euclidean spaces. On curved surfaces they compare favorably with definitions based ...

    • A GPU-Adapted Structure for Unstructured Grids 

      Zayer, Rhaleb; Steinberger, Markus; Seidel, Hans-Peter (The Eurographics Association and John Wiley & Sons Ltd., 2017)
      A key advantage of working with structured grids (e.g., images) is the ability to directly tap into the powerful machinery of linear algebra. This is not much so for unstructured grids where intermediate bookkeeping data ...

    • kDet: Parallel Constant Time Collision Detection for Polygonal Objects 

      Weller, René; Debowski, Nicole; Zachmann, Gabriel (The Eurographics Association and John Wiley & Sons Ltd., 2017)
      We define a novel geometric predicate and a class of objects that enables us to prove a linear bound on the number of intersecting polygon pairs for colliding 3D objects in that class. Our predicate is relevant both in ...

    • On Realism of Architectural Procedural Models 

      Beneš, Jan; Kelly, Tom; Děchtěrenko, Filip; Křivánek, Jaroslav; Müller, Pascal (The Eurographics Association and John Wiley & Sons Ltd., 2017)
      The goal of procedural modeling is to generate realistic content. The realism of this content is typically assessed by qualitatively evaluating a small number of results, or, less frequently, by conducting a user study. ...

    • ShapeGenetics: Using Genetic Algorithms for Procedural Modeling 

      Haubenwallner, Karl; Seidel, Hans-Peter; Steinberger, Markus (The Eurographics Association and John Wiley & Sons Ltd., 2017)
      In this paper, we show that genetic algorithms (GA) can be used to control the output of procedural modeling algorithms. We propose an efficient way to encode the choices that have to be made during a procedural generation ...