GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2015
    In:  Journal of Computer Science and Technology Vol. 30, No. 3 ( 2015-5), p. 540-552
    In: Journal of Computer Science and Technology, Springer Science and Business Media LLC, Vol. 30, No. 3 ( 2015-5), p. 540-552
    Type of Medium: Online Resource
    ISSN: 1000-9000 , 1860-4749
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2015
    detail.hit.zdb_id: 56696-2
    detail.hit.zdb_id: 2224868-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2021
    In:  Advances in Aerodynamics Vol. 3, No. 1 ( 2021-12)
    In: Advances in Aerodynamics, Springer Science and Business Media LLC, Vol. 3, No. 1 ( 2021-12)
    Abstract: In unstructured finite volume method, loop on different mesh components such as cells, faces, nodes, etc is used widely for the traversal of data. Mesh loop results in direct or indirect data access that affects data locality significantly. By loop on mesh, many threads accessing the same data lead to data dependence. Both data locality and data dependence play an important part in the performance of GPU simulations. For optimizing a GPU-accelerated unstructured finite volume Computational Fluid Dynamics (CFD) program, the performance of hot spots under different loops on cells, faces, and nodes is evaluated on Nvidia Tesla V100 and K80. Numerical tests under different mesh scales show that the effects of mesh loop modes are different on data locality and data dependence. Specifically, face loop makes the best data locality, so long as access to face data exists in kernels. Cell loop brings the smallest overheads due to non-coalescing data access, when both cell and node data are used in computing without face data. Cell loop owns the best performance in the condition that only indirect access of cell data exists in kernels. Atomic operations reduced the performance of kernels largely in K80, which is not obvious on V100. With the suitable mesh loop mode in all kernels, the overall performance of GPU simulations can be increased by 15%-20%. Finally, the program on a single GPU V100 can achieve maximum 21.7 and average 14.1 speed up compared with 28 MPI tasks on two Intel CPUs Xeon Gold 6132.
    Type of Medium: Online Resource
    ISSN: 2524-6992
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2021
    detail.hit.zdb_id: 2960941-0
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Elsevier BV ; 2015
    In:  Computer Aided Geometric Design Vol. 35-36 ( 2015-05), p. 163-179
    In: Computer Aided Geometric Design, Elsevier BV, Vol. 35-36 ( 2015-05), p. 163-179
    Type of Medium: Online Resource
    ISSN: 0167-8396
    Language: English
    Publisher: Elsevier BV
    Publication Date: 2015
    detail.hit.zdb_id: 1478710-6
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Elsevier BV ; 2012
    In:  International Journal of Radiation Oncology*Biology*Physics Vol. 82, No. 5 ( 2012-4), p. e749-e756
    In: International Journal of Radiation Oncology*Biology*Physics, Elsevier BV, Vol. 82, No. 5 ( 2012-4), p. e749-e756
    Type of Medium: Online Resource
    ISSN: 0360-3016
    Language: English
    Publisher: Elsevier BV
    Publication Date: 2012
    detail.hit.zdb_id: 1500486-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2015
    In:  Computational Visual Media Vol. 1, No. 3 ( 2015-9), p. 253-265
    In: Computational Visual Media, Springer Science and Business Media LLC, Vol. 1, No. 3 ( 2015-9), p. 253-265
    Type of Medium: Online Resource
    ISSN: 2096-0433 , 2096-0662
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2015
    detail.hit.zdb_id: 2844021-3
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 2013
    In:  ACM Transactions on Graphics Vol. 32, No. 4 ( 2013-07-21), p. 1-14
    In: ACM Transactions on Graphics, Association for Computing Machinery (ACM), Vol. 32, No. 4 ( 2013-07-21), p. 1-14
    Abstract: This paper introduces a particle-based approach for anisotropic surface meshing. Given an input polygonal mesh endowed with a Riemannian metric and a specified number of vertices, the method generates a metric-adapted mesh. The main idea consists of mapping the anisotropic space into a higher dimensional isotropic one, called "embedding space". The vertices of the mesh are generated by uniformly sampling the surface in this higher dimensional embedding space, and the sampling is further regularized by optimizing an energy function with a quasi-Newton algorithm. All the computations can be re-expressed in terms of the dot product in the embedding space, and the Jacobian matrices of the mappings that connect different spaces. This transform makes it unnecessary to explicitly represent the coordinates in the embedding space, and also provides all necessary expressions of energy and forces for efficient computations. Through energy optimization, it naturally leads to the desired anisotropic particle distributions in the original space. The triangles are then generated by computing the Restricted Anisotropic Voronoi Diagram and its dual Delaunay triangulation. We compare our results qualitatively and quantitatively with the state-of-the-art in anisotropic surface meshing on several examples, using the standard measurement criteria.
    Type of Medium: Online Resource
    ISSN: 0730-0301 , 1557-7368
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2013
    detail.hit.zdb_id: 2006336-2
    detail.hit.zdb_id: 625686-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 2020
    In:  ACM Transactions on Graphics Vol. 39, No. 3 ( 2020-06-30), p. 1-17
    In: ACM Transactions on Graphics, Association for Computing Machinery (ACM), Vol. 39, No. 3 ( 2020-06-30), p. 1-17
    Abstract: We propose a framework for the interactive simulation of nonlinear deformable objects. The primary feature of our system is the seamless integration of deformable simulation and collision culling, which are often independently handled in existing animation systems. The bridge connecting them is the medial axis transform (MAT), a high-fidelity volumetric approximation of complex 3D shapes. From the physics simulation perspective, MAT leads to an expressive and compact reduced nonlinear model. We employ a semireduced projective dynamics formulation, which well captures high-frequency local deformations of high-resolution models while retaining a low computation cost. Our key observation is that the most compelling (nonlinear) deformable effects are enabled by the local constraints projection, which should not be aggressively reduced, and only apply model reduction at the global stage. From the collision detection (CD)/collision culling (CC) perspective, MAT is geometrically versatile using linear-interpolated spheres (i.e., the so-called medial primitives (MPs)) to approximate the boundary of the input model. The intersection test between two MPs is formulated as a quadratically constrained quadratic program problem. We give an algorithm to solve this problem exactly, which returns the deepest penetration between a pair of intersecting MPs. When coupled with spatial hashing, collision (including self-collision) can be efficiently identified on the GPU within a few milliseconds even for massive simulations. We have tested our system on a variety of geometrically complex and high-resolution deformable objects, and our system produces convincing animations with all of the collisions/self-collisions well handled at an interactive rate.
    Type of Medium: Online Resource
    ISSN: 0730-0301 , 1557-7368
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2020
    detail.hit.zdb_id: 2006336-2
    detail.hit.zdb_id: 625686-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 8
    Online Resource
    Online Resource
    Wiley ; 2018
    In:  Computer Graphics Forum Vol. 37, No. 7 ( 2018-10), p. 301-311
    In: Computer Graphics Forum, Wiley, Vol. 37, No. 7 ( 2018-10), p. 301-311
    Abstract: Extracting a faithful and compact representation of an animated surface mesh is an important problem for computer graphics. However, the surface‐based methods have limited approximation power for volume preservation when the animated sequences are extremely simplified. In this paper, we introduce Deformable Medial Axis Transform (DMAT), which is deformable medial mesh composed of a set of animated spheres. Starting from extracting an accurate and compact representation of a static MAT as the template and partitioning the vertices on the input surface as the correspondences for each medial primitive, we present a correspondence‐based approximation method equipped with an As‐Rigid‐As‐Possible (ARAP) deformation energy defined on medial primitives. As a result, our algorithm produces DMAT with consistent connectivity across the whole sequence, accurately approximating the input animated surfaces.
    Type of Medium: Online Resource
    ISSN: 0167-7055 , 1467-8659
    URL: Issue
    Language: English
    Publisher: Wiley
    Publication Date: 2018
    detail.hit.zdb_id: 1482655-0
    detail.hit.zdb_id: 246488-3
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 9
    Online Resource
    Online Resource
    Hindawi Limited ; 2016
    In:  BioMed Research International Vol. 2016 ( 2016), p. 1-19
    In: BioMed Research International, Hindawi Limited, Vol. 2016 ( 2016), p. 1-19
    Abstract: By using prior information of planning CT images and feature-based nonuniform meshes, this paper demonstrates that volumetric images can be efficiently registered with a very small portion of 2D projection images of a Cone-Beam Computed Tomography (CBCT) scan. After a density field is computed based on the extracted feature edges from planning CT images, nonuniform tetrahedral meshes will be automatically generated to better characterize the image features according to the density field; that is, finer meshes are generated for features. The displacement vector fields (DVFs) are specified at the mesh vertices to drive the deformation of original CT images. Digitally reconstructed radiographs (DRRs) of the deformed anatomy are generated and compared with corresponding 2D projections. DVFs are optimized to minimize the objective function including differences between DRRs and projections and the regularity. To further accelerate the above 3D-2D registration, a procedure to obtain good initial deformations by deforming the volume surface to match 2D body boundary on projections has been developed. This complete method is evaluated quantitatively by using several digital phantoms and data from head and neck cancer patients. The feature-based nonuniform meshing method leads to better results than either uniform orthogonal grid or uniform tetrahedral meshes.
    Type of Medium: Online Resource
    ISSN: 2314-6133 , 2314-6141
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2016
    detail.hit.zdb_id: 2698540-8
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 10
    Online Resource
    Online Resource
    Elsevier BV ; 2023
    In:  Computers & Graphics Vol. 115 ( 2023-10), p. 511-521
    In: Computers & Graphics, Elsevier BV, Vol. 115 ( 2023-10), p. 511-521
    Type of Medium: Online Resource
    ISSN: 0097-8493
    Language: English
    Publisher: Elsevier BV
    Publication Date: 2023
    detail.hit.zdb_id: 1499979-1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...