Demo Data from SIGIR 2026 / reviewers in the wild / expert
Cornelis Vuik
dblp:128/5115 · also Kees Vuik
· DBLP profile ↗
7ranked-venue papers
3as first author
2since 2021 · last 2023
0000-0002-5988-9153ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
1 paper |
Geometric modeling and processing · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational science and engineering · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing
mesh generation |
0.7 | 1 | 2023 | Towards a High Quality Shrink Wrap Mesh Generation Algorithm Using Mathematical Morphology · Comput. Aided Des. 2023 |
Computational science and engineering › computational fluid dynamics
aerodynamic simulation |
0.2 | 1 | 2023 | Towards a High Quality Shrink Wrap Mesh Generation Algorithm Using Mathematical Morphology · Comput. Aided Des. 2023 |
Computational science and engineering
computational fluid dynamics |
0.2 | 1 | 2023 | Towards a High Quality Shrink Wrap Mesh Generation Algorithm Using Mathematical Morphology · Comput. Aided Des. 2023 |
Geometric modeling and processing › mesh processing
mesh simplification |
0.2 | 1 | 2023 | Towards a High Quality Shrink Wrap Mesh Generation Algorithm Using Mathematical Morphology · Comput. Aided Des. 2023 |
Methods — techniques the papers use, named apart from their topics
mathematical morphology · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Towards a High Quality Shrink Wrap Mesh Generation Algorithm Using Mathematical MorphologyabstractVarious computational fluid dynamic simulations in engineering, such as external aerodynamics, only need the silhouette of an input geometry. Often, it is a laborious process that can take up many human hours. In addition, the CAD geometries are too complex and contain intricate features and topological holes. We showcase an effortless way to shrink-wrap triangulated surfaces with the sole intent of topology and surface simplification. Building upon the concepts of mathematical morphology and newer advancements in geometry processing, we present a straightforward and robust algorithm that can guarantee genus-zero surfaces. Our techniques are equally applicable to general polyhedral meshes and well-suited for handling both oriented and unoriented point clouds. We provide examples using unoriented point clouds to demonstrate the versatility of our algorithms. We have designed our algorithms with a wide variety of applications in mind. However, we specifically highlight their capability for aerodynamic simulations, fluid volume extraction, and surface simplification. Additionally, we emphasize the practicality and ease of implementing the proposed algorithms, and we chain additional algorithms to develop variants of our wrap algorithm. Vijai Kumar Suriyababu, Cornelis Vuik, Matthias Möller |
Comput. Aided Des. | 2 |
| 2023 | On an improved PDE-based elliptic parameterization method for isogeometric analysis using preconditioned Anderson acceleration
Ye Ji 0001, Kewang Chen, Matthias Möller, Cornelis Vuik |
Comput. Aided Geom. Des. | 4 |
| 2018 | Elliptic grid generation techniques in the framework of isogeometric analysis applications
Jochen Hinz, Matthias Möller, Cornelis Vuik |
Comput. Aided Geom. Des. | 3 |
| 2013 | 3D Bubbly Flow Simulation on the GPU - Iterative Solution of a Linear System Using Sub-domain and Level-Set DeflationabstractSolving an ill-conditioned linear system with a two level preconditioned Conjugate Gradient method on the GPU presents many options. The viability of these options is studied for different bubbly flow problems. On the basis of experiments conducted, we propose strategies that make our approach computationally suitable. We use the Truncated Neumann series based preconditioning scheme in combination with Deflation for implementing the two-level preconditioned Conjugate Gradient method and test different configurations on a unit cube with varying number of bubbles. Our results exhibit up to an order of magnitude speedup on the GPU. Our preconditioning scheme combined with deflation proves competitive (in terms of computation time and convergence) when compared to deflation with Incomplete Cholesky preconditioning. Rohit Gupta 0009, Martin B. van Gijzen, Cornelis Vuik |
PDP | 3 |
| 2001 | Coarse grid acceleration of a parallel block preconditioner
Cornelis Vuik, Jason Frank |
Future Gener. Comput. Syst. | 1 |
| 2001 | A parallel block-preconditioned GCR method for incompressible flow problems
Cornelis Vuik, Jason Frank, A. Segal |
Future Gener. Comput. Syst. | 1 |
| 1998 | Parallelism in ILU-preconditioned GMRES
Cornelis Vuik, R. R. P. van Nooyen, P. Wesseling |
Parallel Comput. | 1 |