Waldemar Celes
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Waldemar Celes has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Andrei Alhadeff
Pontifical Catholic University
1 shared publication- André Moreira
Tecgraf Institute/PUC-Rio, Brazil
1 shared publication - Francisco Queiroz
University of Leeds
1 shared publication F´bIo Markus Miranda
1 shared publicationGisele Holtz
1 shared publicationGlaucio H. Paulino
Georgia Institute of Technology
1 shared publication
Latest Publications
- Open Access
- 11 August 2026
- Published by Springer Nature in Journal of the Brazilian Society of Mechanical Sciences and Engineering
- Vol. 48 (9) , 663
TopSim: an extensible plugin-based framework for solving general-purpose large-scale engineering problems in a parallel computational environment
This paper presents TopSim, an extensible C++ framework for developing numerical simulations in parallel and distributed environments. The framework’s contribution is architectural rather than algorithmic, arising from the integration of three key architectural features within a unified execution model: (1) a service-oriented plugin architecture configured at runtime, enabling code reuse and the replacement of numerical methods without modifications to the framework kernel; (2) an integrated data structure, TopS , which simultaneously provides a compact representation of the topological model and serves as a shared communication protocol among plugins; and (3) the encapsulation of distributed-memory programming tasks, such as mesh communication, attribute synchronization, and distributed linear algebra operations, through TopSim’s distributed-memory backbone, namely ParTopS , TopMat , and TopVec . The framework’s consistency, extensibility, and distributed performance are evaluated through mechanics-oriented benchmarks, including linear and geometrically nonlinear structural analyses, a topology optimization example based on a three-dimensional hexagonal-prism (honeycomb) finite-element discretization, and distributed scaling experiments. In the distributed algebraic microbenchmarks, TopSim’s native distributed linear algebra (DLA) algorithms achieved lower absolute elapsed times than the corresponding PETSc DLA algorithms across most of the configurations tested. In the end-to-end finite-element benchmarks, absolute elapsed time depended on the per-core workload: the TopSim-native configuration performed better when the workload exceeded 10K elements per core. In terms of scalability, the TopSim-native configuration exhibited weaker strong scaling but consistently better weak scaling than the TopSim-PETSc configuration. Overall, the results demonstrate that TopSim can incorporate new simulation capabilities with minimal modifications to the plugin architecture while maintaining competitive distributed performance.
- 11 August 2026
- Published by Springer Nature in Journal of the Brazilian Society of Mechanical Sciences and Engineering
- Vol. 48 (9) , 663
Open AccessTopSim: an extensible plugin-based framework for solving general-purpose large-scale engineering problems in a parallel computational environment
This paper presents TopSim, an extensible C++ framework for developing numerical simulations in parallel and distributed environments. The framework’s contribution is architectural rather than algorithmic, arising from the integration of three key architectural features within a unified execution model: (1) a service-oriented plugin architecture configured at runtime, enabling code reuse and the replacement of numerical methods without modifications to the framework kernel; (2) an integrated data structure, TopS , which simultaneously provides a compact representation of the topological model and serves as a shared communication protocol among plugins; and (3) the encapsulation of distributed-memory programming tasks, such as mesh communication, attribute synchronization, and distributed linear algebra operations, through TopSim’s distributed-memory backbone, namely ParTopS , TopMat , and TopVec . The framework’s consistency, extensibility, and distributed performance are evaluated through mechanics-oriented benchmarks, including linear and geometrically nonlinear structural analyses, a topology optimization example based on a three-dimensional hexagonal-prism (honeycomb) finite-element discretization, and distributed scaling experiments. In the distributed algebraic microbenchmarks, TopSim’s native distributed linear algebra (DLA) algorithms achieved lower absolute elapsed times than the corresponding PETSc DLA algorithms across most of the configurations tested. In the end-to-end finite-element benchmarks, absolute elapsed time depended on the per-core workload: the TopSim-native configuration performed better when the workload exceeded 10K elements per core. In terms of scalability, the TopSim-native configuration exhibited weaker strong scaling but consistently better weak scaling than the TopSim-PETSc configuration. Overall, the results demonstrate that TopSim can incorporate new simulation capabilities with minimal modifications to the plugin architecture while maintaining competitive distributed performance.
- 5 May 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 562
Fast and accurate simulation of deformable solid dynamics with message passing neural networks
- 5 May 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 562
Fast and accurate simulation of deformable solid dynamics with message passing neural networks
- 11 August 2025
- Published by Elsevier in Computers & Graphics
- Vol. 132
Semi-implicit representation of discrete black oil reservoir models
- 11 August 2025
- Published by Elsevier in Computers & Graphics
- Vol. 132
Semi-implicit representation of discrete black oil reservoir models
- Open Access
- 21 February 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (1) , 1-15
Direct Rendering of Intrinsic Triangulations
Existing intrinsic triangulation frameworks represent powerful tools for geometry processing; however, they all require the extraction of the common subdivision between extrinsic and intrinsic triangulations for visualization and optimized data transfer. We describe an efficient and effective algorithm for directly rendering intrinsic triangulations that avoids extracting common subdivisions. Our strategy is to use GPU shaders to render the intrinsic triangulation while rasterizing extrinsic triangles. We rely on a point-location algorithm supported by a compact data structure, which requires only two values per extrinsic triangle to represent the correspondence between extrinsic and intrinsic triangulations. This data structure is easier to maintain than previous proposals while supporting all the standard topological operations for improving the intrinsic mesh quality, such as edge flips, triangle refinements, and vertex displacements. Computational experiments show that the proposed data structure is numerically robust and can process nearly degenerate triangulations. We also propose a meshless strategy to accurately transfer data from intrinsic to extrinsic triangulations without relying on the extraction of common subdivisions.
- 21 February 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (1) , 1-15
Open AccessDirect Rendering of Intrinsic Triangulations
Existing intrinsic triangulation frameworks represent powerful tools for geometry processing; however, they all require the extraction of the common subdivision between extrinsic and intrinsic triangulations for visualization and optimized data transfer. We describe an efficient and effective algorithm for directly rendering intrinsic triangulations that avoids extracting common subdivisions. Our strategy is to use GPU shaders to render the intrinsic triangulation while rasterizing extrinsic triangles. We rely on a point-location algorithm supported by a compact data structure, which requires only two values per extrinsic triangle to represent the correspondence between extrinsic and intrinsic triangulations. This data structure is easier to maintain than previous proposals while supporting all the standard topological operations for improving the intrinsic mesh quality, such as edge flips, triangle refinements, and vertex displacements. Computational experiments show that the proposed data structure is numerically robust and can process nearly degenerate triangulations. We also propose a meshless strategy to accurately transfer data from intrinsic to extrinsic triangulations without relying on the extraction of common subdivisions.
- 1 November 2019
- Published by Elsevier in Computers & Graphics
- Vol. 84, 66-76
Interactive directional ambient occlusion and shadow computations for volume ray casting
- 1 November 2019
- Published by Elsevier in Computers & Graphics
- Vol. 84, 66-76
Interactive directional ambient occlusion and shadow computations for volume ray casting
- 26 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 26 (10) , 3109-3127
A Systematic Review of Visualization in Building Information Modeling
Building Information Modeling (BIM) employs data-rich 3D CAD models for large-scale facility design, construction, and operation. These complex datasets contain a large amount and variety of information, ranging from design specifications to real-time sensor data. They are used by architects and engineers for various analysis and simulations throughout a facility's life cycle. Many techniques from different visualization fields could be used to analyze these data. However, the BIM domain still remains largely unexplored by the visualization community. The goal of this article is to encourage visualization researchers to increase their involvement with BIM. To this end, we present the results of a systematic review of visualization in current BIM practice. We use a novel taxonomy to identify main application areas and analyze commonly employed techniques. From this domain characterization, we highlight future research opportunities brought forth by the unique features of BIM. For instance, exploring the synergies between scientific and information visualization to integrate spatial and non-spatial data. We hope this article raises awareness to interesting new challenges the BIM domain brings to the visualization community.
- 26 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 26 (10) , 3109-3127
A Systematic Review of Visualization in Building Information Modeling
Building Information Modeling (BIM) employs data-rich 3D CAD models for large-scale facility design, construction, and operation. These complex datasets contain a large amount and variety of information, ranging from design specifications to real-time sensor data. They are used by architects and engineers for various analysis and simulations throughout a facility's life cycle. Many techniques from different visualization fields could be used to analyze these data. However, the BIM domain still remains largely unexplored by the visualization community. The goal of this article is to encourage visualization researchers to increase their involvement with BIM. To this end, we present the results of a systematic review of visualization in current BIM practice. We use a novel taxonomy to identify main application areas and analyze commonly employed techniques. From this domain characterization, we highlight future research opportunities brought forth by the unique features of BIM. For instance, exploring the synergies between scientific and information visualization to integrate spatial and non-spatial data. We hope this article raises awareness to interesting new challenges the BIM domain brings to the visualization community.
- 18 January 2016
- Published by Springer Nature in Engineering with Computers
- Vol. 32 (3) , 533-552
Massively parallel adaptive mesh refinement and coarsening for dynamic fracture simulations
- 18 January 2016
- Published by Springer Nature in Engineering with Computers
- Vol. 32 (3) , 533-552
Massively parallel adaptive mesh refinement and coarsening for dynamic fracture simulations
- 1 August 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15301834,p. 93-100
Accurate Volume Rendering of Unstructured Hexahedral Meshes
Important engineering applications use unstructured hexahedral meshes for numerical simulations. Hexahedral cells, when compared to tetrahedral ones, tend to be more numerically stable and to require less mesh refinement. However, volume visualization of unstructured hexahedral meshes is challenging due to the trilinear variation of scalar fields inside the cells. The conventional solution consists in subdividing each hexahedral cell into five or six tetrahedra, approximating a trilinear variation by a piecewise linear function. This results in inaccurate images and increases the memory consumption. In this paper, we present an accurate ray-casting volume rendering algorithm for unstructured hexahedral meshes. In order to capture the trilinear variation along the ray, we propose the use of quadrature integration. A set of computational experiments demonstrates that our proposal produces accurate results, with reduced memory footprint. The entire algorithm is implemented on graphics cards, ensuring competitive performance.
- 1 August 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15301834,p. 93-100
Accurate Volume Rendering of Unstructured Hexahedral Meshes
Important engineering applications use unstructured hexahedral meshes for numerical simulations. Hexahedral cells, when compared to tetrahedral ones, tend to be more numerically stable and to require less mesh refinement. However, volume visualization of unstructured hexahedral meshes is challenging due to the trilinear variation of scalar fields inside the cells. The conventional solution consists in subdividing each hexahedral cell into five or six tetrahedra, approximating a trilinear variation by a piecewise linear function. This results in inaccurate images and increases the memory consumption. In this paper, we present an accurate ray-casting volume rendering algorithm for unstructured hexahedral meshes. In order to capture the trilinear variation along the ray, we propose the use of quadrature integration. A set of computational experiments demonstrates that our proposal produces accurate results, with reduced memory footprint. The entire algorithm is implemented on graphics cards, ensuring competitive performance.
- 1 January 2008
- Published by British Machine Vision Association and Society for Pattern Recognition
- p. 62.1-62.10
Accelerated Corner-Detector Algorithms
- 1 January 2008
- Published by British Machine Vision Association and Society for Pattern Recognition
- p. 62.1-62.10
Accelerated Corner-Detector Algorithms