EUROGRAPHICS Association

Displaying 1-19 of 19 results

  • White Papers // Apr 2013

    Mind the Time: Unleashing the Temporal Aspects in Pattern Discovery

    Temporal data mining is a core concept of knowledge discovery in databases handling time-oriented data. State-of-the-art methods are capable of preserving the temporal order of events as well as the information in between. The temporal nature of the events themselves, however, can likely be misinterpreted by current algorithms. The authors...

    Provided By EUROGRAPHICS Association

  • White Papers // Apr 2012

    Developing an Extended Task Framework for Exploratory Data Analysis Along the Structure of Time

    Exploratory data analysis of time-oriented data is an important goal that visual analytics has to tackle. When users from real-world domains are asked about time-oriented tasks, they often refer to the unique structure of time (e.g., calendars, primitives, etc.). Several task frameworks have been developed, but none of them combines...

    Provided By EUROGRAPHICS Association

  • White Papers // Jul 2011

    Gesture-Based Design of 2D Contours: An Alternative to Sketching?

    In addition to being a very expressive media, 2D sketches representing the contour of a shape are commonly used as a basis for 3D sketch-based modeling. This paper investigates an alternative to the standard way of creating such sketches: instead of carefully following the contour with a pen and erasing...

    Provided By EUROGRAPHICS Association

  • White Papers // Jan 2011

    A Digital Rights Enabled Graphics Processing System

    With the emergence of 3D graphics/arts assets commerce on the Internet, to protect their intellectual property and to restrict their usage have become a new design challenge. This paper presents a novel protection model for commercial graphics data by integrating digital rights management into the graphics processing unit and creating...

    Provided By EUROGRAPHICS Association

  • White Papers // Jan 2011

    Partial Matching of 3D Shapes With Priority-Driven Search

    Priority-driven search is an algorithm for retrieving similar shapes from a large database of 3D objects. Given a query object and a database of target objects, all represented by sets of local 3D shape features, the algorithm produces a ranked list of the c best target objects sorted by how...

    Provided By EUROGRAPHICS Association

  • White Papers // Jan 2011

    ClearPath: Highly Parallel Collision Avoidance for Multi-Agent Simulation

    The authors present a new local collision avoidance algorithm between multiple agents for real-time simulations. The approach extends the notion of velocity obstacles from robotics and formulates the conditions for collision free navigation as a quadratic optimization problem. They use a discrete optimization method to efficiently compute the motion of...

    Provided By EUROGRAPHICS Association

  • White Papers // Aug 2010

    As-Rigid-as-Possible Surface Modeling

    Modeling tasks, such as surface deformation and editing, can be analyzed by observing the local behavior of the surface. The authors argue that defining a modeling operation by asking for rigidity of the local transformations is useful in various settings. Such formulation leads to a non-linear, yet conceptually simple energy...

    Provided By EUROGRAPHICS Association

  • White Papers // Aug 2010

    Conformal Flattening by Curvature Prescription and Metric Scaling

    Triangular meshes are a popular representation for 3D models. They are used in a wide range of applications, many of which require the parameterization of the model to a planar domain. Examples are texture mapping, detail mapping, morphing and remeshing, to mention just a few. Parameterization is also an important...

    Provided By EUROGRAPHICS Association

  • White Papers // May 2010

    A Parallel Multigrid Poisson Solver for Fluids Simulation on Large Grids

    The authors present a highly efficient numerical solver for the Poisson equation on irregular voxelized domains supporting an arbitrary mix of Neumann and Dirichlet boundary conditions. The approach employs a multigrid cycle as a preconditioner for the conjugate gradient method, which enables the use of a lightweight, purely geometric multigrid...

    Provided By EUROGRAPHICS Association

  • White Papers // May 2010

    Large Data Visualization on Distributed Memory Multi-GPU Clusters

    Data sets of immense size are regularly generated on large scale computing resources. Even among more traditional methods for acquisition of volume data, such as MRI and CT scanners, data which is too large to be effectively visualized on standard workstations is now commonplace. One solution to this problem is...

    Provided By EUROGRAPHICS Association

  • White Papers // Apr 2010

    Utilizing Treemaps for Multicriterial Search of 3D Objects

    The authors propose a treemap based interface for presentation of search results according to multiple search criteria. Different colors are used to represent the relevance of each item in the database according to the different search criteria, while at the same time the treemap based representation allows the user to...

    Provided By EUROGRAPHICS Association

  • White Papers // Mar 2010

    Towards a Software Transactional Memory for Graphics Processors

    The introduction of general purpose computing on many-core graphics processor systems, and the general shift in the industry towards parallelism, has created a demand for ease of parallelization. Software Transactional Memory (STM) simplifies development of concurrent code by allowing the programmer to mark sections of code to be executed concurrently...

    Provided By EUROGRAPHICS Association

  • White Papers // Jan 2010

    Inverse Procedural Modeling by Automatic Generation of L-Systems

    The authors present an important step towards the solution of the problem of inverse procedural modeling by generating parametric context-free L-systems that represent an input 2D model. The L-system rules efficiently code the regular structures and the parameters represent the properties of the structure transformations. The algorithm takes as input...

    Provided By EUROGRAPHICS Association

  • White Papers // Jan 2010

    Integrated Feature-Based and Geometric CAD Data Exchange

    This paper presents a general concept, Geometry per Feature (GPF) that achieves such integration, along with algorithms for implementing it. First this paper gives a general background of feature based design and of the UPR FBDE architecture. this paper then give a precise problem statement, present three solution alternatives: delta...

    Provided By EUROGRAPHICS Association

  • White Papers // Jan 2010

    A Tri-Space Visualization Interface for Analyzing Time-Varying Multivariate Volume Data

    The dataset generated by a large-scale numerical simulation may include thousands of timesteps and hundreds of variables describing different aspects of the modeled physical phenomena. In order to analyze and understand such data, scientists need the capability to explore simultaneously in the temporal, spatial, and variable domains of the data....

    Provided By EUROGRAPHICS Association

  • White Papers // Jan 2010

    Visualization of Time-Varying Volumetric Data Using Differential Time-Histogram Table

    This paper introduces a novel data structure called Differential Time-Histogram Table (DTHT) for visualization of time-varying scalar data. This data structure only stores voxels that are changing between time-steps or during transfer function updates. It allows efficient updates of data necessary for rendering during a sequence of queries common during...

    Provided By EUROGRAPHICS Association

  • White Papers // Apr 2009

    Design and Evaluation of a Hardware Accelerated Ray Tracing Data Structure

    The increase in graphics card performance and processor core count has allowed significant performance acceleration for ray tracing applications. Future graphics architectures are expected to continue increasing the number of processor cores, further improving performance by exploiting data parallelism. However, current ray tracing implementations are based on recursive searches which...

    Provided By EUROGRAPHICS Association

  • White Papers // Feb 2009

    Interactive Physical Simulation on Multicore Architectures

    In this paper the authors propose a parallelization of interactive physical simulations. Their approach relies on a task parallelism where the code is instrumented to mark tasks and shared data between tasks, as well as parallel loops even if they have dynamic conditions. Prior to running a simulation step, they...

    Provided By EUROGRAPHICS Association

  • White Papers // Feb 2009

    Fast Parallel Unbiased Diffeomorphic Atlas Construction on Multi-Graphics Processing Units

    Unbiased diffeomorphic atlas construction has proven to be a powerful technique for medical image analysis, particularly in brain imaging. The method operates on a large set of images, mapping them all into a common coordinate system, and creating an unbiased common template for studying intra-population variability and inter-population differences. The...

    Provided By EUROGRAPHICS Association

  • White Papers // May 2010

    A Parallel Multigrid Poisson Solver for Fluids Simulation on Large Grids

    The authors present a highly efficient numerical solver for the Poisson equation on irregular voxelized domains supporting an arbitrary mix of Neumann and Dirichlet boundary conditions. The approach employs a multigrid cycle as a preconditioner for the conjugate gradient method, which enables the use of a lightweight, purely geometric multigrid...

    Provided By EUROGRAPHICS Association

  • White Papers // Jan 2011

    A Digital Rights Enabled Graphics Processing System

    With the emergence of 3D graphics/arts assets commerce on the Internet, to protect their intellectual property and to restrict their usage have become a new design challenge. This paper presents a novel protection model for commercial graphics data by integrating digital rights management into the graphics processing unit and creating...

    Provided By EUROGRAPHICS Association

  • White Papers // Aug 2010

    As-Rigid-as-Possible Surface Modeling

    Modeling tasks, such as surface deformation and editing, can be analyzed by observing the local behavior of the surface. The authors argue that defining a modeling operation by asking for rigidity of the local transformations is useful in various settings. Such formulation leads to a non-linear, yet conceptually simple energy...

    Provided By EUROGRAPHICS Association

  • White Papers // Aug 2010

    Conformal Flattening by Curvature Prescription and Metric Scaling

    Triangular meshes are a popular representation for 3D models. They are used in a wide range of applications, many of which require the parameterization of the model to a planar domain. Examples are texture mapping, detail mapping, morphing and remeshing, to mention just a few. Parameterization is also an important...

    Provided By EUROGRAPHICS Association

  • White Papers // Jan 2010

    Inverse Procedural Modeling by Automatic Generation of L-Systems

    The authors present an important step towards the solution of the problem of inverse procedural modeling by generating parametric context-free L-systems that represent an input 2D model. The L-system rules efficiently code the regular structures and the parameters represent the properties of the structure transformations. The algorithm takes as input...

    Provided By EUROGRAPHICS Association

  • White Papers // Jan 2011

    Partial Matching of 3D Shapes With Priority-Driven Search

    Priority-driven search is an algorithm for retrieving similar shapes from a large database of 3D objects. Given a query object and a database of target objects, all represented by sets of local 3D shape features, the algorithm produces a ranked list of the c best target objects sorted by how...

    Provided By EUROGRAPHICS Association

  • White Papers // Jan 2011

    ClearPath: Highly Parallel Collision Avoidance for Multi-Agent Simulation

    The authors present a new local collision avoidance algorithm between multiple agents for real-time simulations. The approach extends the notion of velocity obstacles from robotics and formulates the conditions for collision free navigation as a quadratic optimization problem. They use a discrete optimization method to efficiently compute the motion of...

    Provided By EUROGRAPHICS Association

  • White Papers // Jan 2010

    Integrated Feature-Based and Geometric CAD Data Exchange

    This paper presents a general concept, Geometry per Feature (GPF) that achieves such integration, along with algorithms for implementing it. First this paper gives a general background of feature based design and of the UPR FBDE architecture. this paper then give a precise problem statement, present three solution alternatives: delta...

    Provided By EUROGRAPHICS Association

  • White Papers // Jan 2010

    A Tri-Space Visualization Interface for Analyzing Time-Varying Multivariate Volume Data

    The dataset generated by a large-scale numerical simulation may include thousands of timesteps and hundreds of variables describing different aspects of the modeled physical phenomena. In order to analyze and understand such data, scientists need the capability to explore simultaneously in the temporal, spatial, and variable domains of the data....

    Provided By EUROGRAPHICS Association

  • White Papers // Mar 2010

    Towards a Software Transactional Memory for Graphics Processors

    The introduction of general purpose computing on many-core graphics processor systems, and the general shift in the industry towards parallelism, has created a demand for ease of parallelization. Software Transactional Memory (STM) simplifies development of concurrent code by allowing the programmer to mark sections of code to be executed concurrently...

    Provided By EUROGRAPHICS Association

  • White Papers // Jan 2010

    Visualization of Time-Varying Volumetric Data Using Differential Time-Histogram Table

    This paper introduces a novel data structure called Differential Time-Histogram Table (DTHT) for visualization of time-varying scalar data. This data structure only stores voxels that are changing between time-steps or during transfer function updates. It allows efficient updates of data necessary for rendering during a sequence of queries common during...

    Provided By EUROGRAPHICS Association

  • White Papers // Jul 2011

    Gesture-Based Design of 2D Contours: An Alternative to Sketching?

    In addition to being a very expressive media, 2D sketches representing the contour of a shape are commonly used as a basis for 3D sketch-based modeling. This paper investigates an alternative to the standard way of creating such sketches: instead of carefully following the contour with a pen and erasing...

    Provided By EUROGRAPHICS Association

  • White Papers // Apr 2010

    Utilizing Treemaps for Multicriterial Search of 3D Objects

    The authors propose a treemap based interface for presentation of search results according to multiple search criteria. Different colors are used to represent the relevance of each item in the database according to the different search criteria, while at the same time the treemap based representation allows the user to...

    Provided By EUROGRAPHICS Association

  • White Papers // Feb 2009

    Fast Parallel Unbiased Diffeomorphic Atlas Construction on Multi-Graphics Processing Units

    Unbiased diffeomorphic atlas construction has proven to be a powerful technique for medical image analysis, particularly in brain imaging. The method operates on a large set of images, mapping them all into a common coordinate system, and creating an unbiased common template for studying intra-population variability and inter-population differences. The...

    Provided By EUROGRAPHICS Association

  • White Papers // Apr 2009

    Design and Evaluation of a Hardware Accelerated Ray Tracing Data Structure

    The increase in graphics card performance and processor core count has allowed significant performance acceleration for ray tracing applications. Future graphics architectures are expected to continue increasing the number of processor cores, further improving performance by exploiting data parallelism. However, current ray tracing implementations are based on recursive searches which...

    Provided By EUROGRAPHICS Association

  • White Papers // May 2010

    Large Data Visualization on Distributed Memory Multi-GPU Clusters

    Data sets of immense size are regularly generated on large scale computing resources. Even among more traditional methods for acquisition of volume data, such as MRI and CT scanners, data which is too large to be effectively visualized on standard workstations is now commonplace. One solution to this problem is...

    Provided By EUROGRAPHICS Association

  • White Papers // Apr 2013

    Mind the Time: Unleashing the Temporal Aspects in Pattern Discovery

    Temporal data mining is a core concept of knowledge discovery in databases handling time-oriented data. State-of-the-art methods are capable of preserving the temporal order of events as well as the information in between. The temporal nature of the events themselves, however, can likely be misinterpreted by current algorithms. The authors...

    Provided By EUROGRAPHICS Association

  • White Papers // Apr 2012

    Developing an Extended Task Framework for Exploratory Data Analysis Along the Structure of Time

    Exploratory data analysis of time-oriented data is an important goal that visual analytics has to tackle. When users from real-world domains are asked about time-oriented tasks, they often refer to the unique structure of time (e.g., calendars, primitives, etc.). Several task frameworks have been developed, but none of them combines...

    Provided By EUROGRAPHICS Association

  • White Papers // Feb 2009

    Interactive Physical Simulation on Multicore Architectures

    In this paper the authors propose a parallelization of interactive physical simulations. Their approach relies on a task parallelism where the code is instrumented to mark tasks and shared data between tasks, as well as parallel loops even if they have dynamic conditions. Prior to running a simulation step, they...

    Provided By EUROGRAPHICS Association