Ruben Wiersma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ruben Wiersma has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Olga Sorkine-Hornung
ETH Zurich, Zurich, Switzerland
4 shared publications - Alexandre Binninger
ETH Zurich, Zurich, Switzerland
3 shared publications - Elmar Eisemann
Delft University of Technology, Netherlands
3 shared publications - Klaus Hildebrandt
Computer Graphics and Visualization Lab, TU Delft, Delft, The Netherlands
2 shared publications - Tanguy Magne
ETH Zurich, Department of Computer Science
2 shared publications - Ahmad Nasikun
Universitas Gadjah Mada
1 shared publication
Latest Publications
- Open Access
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Rotation-Equivariant Neural Jacobian Fields for Generalizable 3D Mesh Deformations
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessRotation-Equivariant Neural Jacobian Fields for Generalizable 3D Mesh Deformations
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Gradient Descent in the ALPS: Abstracted Low-Poly Stylization and Fabrication
The low-poly style is a popular genre of vector graphics that depicts objects and scenes as flat-shaded meshes of low polygon count, often with a limited palette. In this paper, we propose a method to generate 2D low-poly meshes to abstract images. While it has been possible to achieve this look with general-purpose image generators and vector-based diffusion models, the resulting images are not guaranteed to be valid polygonal meshes. A key problem is that polygons overlap or intersect and, in the case of pixel-based image generators, the shapes are often not polygons. Moreover, the colors are not guaranteed to be constrained to a fixed palette. Aside from aesthetic considerations, this has practical consequences: it complicates editing and fabricating the results. We solve this problem by representing an image as a 2D polygonal mesh and optimizing the topology, geometry and coloring of the mesh using score distillation sampling, while enforcing geometric constraints, such as manifoldness and bijectivity. This presents unique challenges due to the discrete nature of the topology, which we handle using a fine-to-coarse strategy based on mesh simplification. By also constraining the colors to a fixed palette, we are able to produce various fabrications such as mosaics, embroidery, crocheting, patchwork and stencils from the resulting vector images. Code is at https://github.com/rubenwiersma/alps.
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessGradient Descent in the ALPS: Abstracted Low-Poly Stylization and Fabrication
The low-poly style is a popular genre of vector graphics that depicts objects and scenes as flat-shaded meshes of low polygon count, often with a limited palette. In this paper, we propose a method to generate 2D low-poly meshes to abstract images. While it has been possible to achieve this look with general-purpose image generators and vector-based diffusion models, the resulting images are not guaranteed to be valid polygonal meshes. A key problem is that polygons overlap or intersect and, in the case of pixel-based image generators, the shapes are often not polygons. Moreover, the colors are not guaranteed to be constrained to a fixed palette. Aside from aesthetic considerations, this has practical consequences: it complicates editing and fabricating the results. We solve this problem by representing an image as a 2D polygonal mesh and optimizing the topology, geometry and coloring of the mesh using score distillation sampling, while enforcing geometric constraints, such as manifoldness and bijectivity. This presents unique challenges due to the discrete nature of the topology, which we handle using a fine-to-coarse strategy based on mesh simplification. By also constraining the colors to a fixed palette, we are able to produce various fabrications such as mosaics, embroidery, crocheting, patchwork and stencils from the resulting vector images. Code is at https://github.com/rubenwiersma/alps.
- Open Access
- 28 May 2026
- Published by Wiley in Computer Graphics Forum
Single Line Drawing Generation via Semantics‐Driven Optimization
Line drawings are a highly expressive art form that requires the artist to abstract and distill the essence of their subject. We present the first semantics‐driven method for automatically generating single‐line drawings in vector format, guided either by a text prompt describing the concept or an input image depicting it. Our approach leverages score distillation sampling to optimize the parameters of a uniform rational B‐spline (URBS) curve, ensuring that the drawing consists of a single continuous stroke by design. This representation provides fine‐grained control over the level of detail, while additional loss terms allow us to steer the final artistic style. We demonstrate that our method outperforms state‐of‐the‐art text‐to‐image models and optimization pipelines for this task, producing results that are both more aesthetically pleasing and more faithful to the style of continuous line drawing artists. Furthermore, because our method generates a vectorized curve, it directly supports downstream fabrication processes such as embroidery, laser engraving and wire bending. Our code and results are available at https://github.com/tanguymagne/SLDgen.
- 28 May 2026
- Published by Wiley in Computer Graphics Forum
Open AccessSingle Line Drawing Generation via Semantics‐Driven Optimization
Line drawings are a highly expressive art form that requires the artist to abstract and distill the essence of their subject. We present the first semantics‐driven method for automatically generating single‐line drawings in vector format, guided either by a text prompt describing the concept or an input image depicting it. Our approach leverages score distillation sampling to optimize the parameters of a uniform rational B‐spline (URBS) curve, ensuring that the drawing consists of a single continuous stroke by design. This representation provides fine‐grained control over the level of detail, while additional loss terms allow us to steer the final artistic style. We demonstrate that our method outperforms state‐of‐the‐art text‐to‐image models and optimization pipelines for this task, producing results that are both more aesthetically pleasing and more faithful to the style of continuous line drawing artists. Furthermore, because our method generates a vectorized curve, it directly supports downstream fabrication processes such as embroidery, laser engraving and wire bending. Our code and results are available at https://github.com/tanguymagne/SLDgen.
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Uncertainty for SVBRDF Acquisition using Frequency Analysis
- 27 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessUncertainty for SVBRDF Acquisition using Frequency Analysis
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-19
TetWeave: Isosurface Extraction using On-The-Fly Delaunay Tetrahedral Grids for Gradient-Based Mesh Optimization
We introduce TetWeave, a novel isosurface representation for gradient-based mesh optimization that jointly optimizes the placement of a tetrahedral grid used for Marching Tetrahedra and a novel directional signed distance at each point. TetWeave constructs tetrahedral grids on-the-fly via Delaunay triangulation, enabling increased flexibility compared to predefined grids. The extracted meshes are guaranteed to be watertight, two-manifold and intersection-free. The flexibility of TetWeave enables a resampling strategy that places new points where reconstruction error is high and allows to encourage mesh fairness without compromising on reconstruction error. This leads to high-quality, adaptive meshes that require minimal memory usage and few parameters to optimize. Consequently, TetWeave exhibits near-linear memory scaling relative to the vertex count of the output mesh — a substantial improvement over predefined grids. We demonstrate the applicability of TetWeave to a broad range of challenging tasks in computer graphics and vision, such as multi-view 3D reconstruction, mesh compression and geometric texture generation. Our code is available at https://github.com/AlexandreBinninger/TetWeave.
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-19
Open AccessTetWeave: Isosurface Extraction using On-The-Fly Delaunay Tetrahedral Grids for Gradient-Based Mesh Optimization
We introduce TetWeave, a novel isosurface representation for gradient-based mesh optimization that jointly optimizes the placement of a tetrahedral grid used for Marching Tetrahedra and a novel directional signed distance at each point. TetWeave constructs tetrahedral grids on-the-fly via Delaunay triangulation, enabling increased flexibility compared to predefined grids. The extracted meshes are guaranteed to be watertight, two-manifold and intersection-free. The flexibility of TetWeave enables a resampling strategy that places new points where reconstruction error is high and allows to encourage mesh fairness without compromising on reconstruction error. This leads to high-quality, adaptive meshes that require minimal memory usage and few parameters to optimize. Consequently, TetWeave exhibits near-linear memory scaling relative to the vertex count of the output mesh — a substantial improvement over predefined grids. We demonstrate the applicability of TetWeave to a broad range of challenging tasks in computer graphics and vision, such as multi-view 3D reconstruction, mesh compression and geometric texture generation. Our code is available at https://github.com/AlexandreBinninger/TetWeave.
- Open Access
- 23 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-11
A Fast Geometric Multigrid Method for Curved Surfaces
- 23 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessA Fast Geometric Multigrid Method for Curved Surfaces
- Open Access
Deep vanishing point detection: Geometric priors make dataset variations vanish
Deep learning has improved vanishing point detection in images. Yet, deep networks require expensive annotated datasets trained on costly hardware and do not generalize to even slightly different domains, and minor problem variants. Here, we address these issues by injecting deep vanishing point detection networks with prior knowledge. This prior knowledge no longer needs to be learned from data, saving valuable annotation efforts and compute, unlocking realistic few-sample scenarios, and reducing the impact of domain changes. Moreover, the interpretability of the priors allows to adapt deep networks to minor problem variations such as switching between Manhattan and non-Manhattan worlds. We seamlessly incorporate two geometric priors: (i) Hough Transform -- mapping image pixels to straight lines, and (ii) Gaussian sphere -- mapping lines to great circles whose intersections denote vanishing points. Experimentally, we ablate our choices and show comparable accuracy to existing models in the large-data setting. We validate our model's improved data efficiency, robustness to domain changes, adaptability to non-Manhattan settings.
Open AccessDeep vanishing point detection: Geometric priors make dataset variations vanish
Deep learning has improved vanishing point detection in images. Yet, deep networks require expensive annotated datasets trained on costly hardware and do not generalize to even slightly different domains, and minor problem variants. Here, we address these issues by injecting deep vanishing point detection networks with prior knowledge. This prior knowledge no longer needs to be learned from data, saving valuable annotation efforts and compute, unlocking realistic few-sample scenarios, and reducing the impact of domain changes. Moreover, the interpretability of the priors allows to adapt deep networks to minor problem variations such as switching between Manhattan and non-Manhattan worlds. We seamlessly incorporate two geometric priors: (i) Hough Transform -- mapping image pixels to straight lines, and (ii) Gaussian sphere -- mapping lines to great circles whose intersections denote vanishing points. Experimentally, we ablate our choices and show comparable accuracy to existing models in the large-data setting. We validate our model's improved data efficiency, robustness to domain changes, adaptability to non-Manhattan settings.
- Open Access
- 12 August 2020
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 39 (4)
CNNs on surfaces using rotation-equivariant features
This paper is concerned with a fundamental problem in geometric deep learning that arises in the construction of convolutional neural networks on surfaces. Due to curvature, the transport of filter kernels on surfaces results in a rotational ambiguity, which prevents a uniform alignment of these kernels on the surface. We propose a network architecture for surfaces that consists of vector-valued, rotation-equivariant features. The equivariance property makes it possible to locally align features, which were computed in arbitrary coordinate systems, when aggregating features in a convolution layer. The resulting network is agnostic to the choices of coordinate systems for the tangent spaces on the surface. We implement our approach for triangle meshes. Based on circular harmonic functions, we introduce convolution filters for meshes that are rotation-equivariant at the discrete level. We evaluate the resulting networks on shape correspondence and shape classifications tasks and compare their performance to other approaches.
- 12 August 2020
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 39 (4)
Open AccessCNNs on surfaces using rotation-equivariant features
This paper is concerned with a fundamental problem in geometric deep learning that arises in the construction of convolutional neural networks on surfaces. Due to curvature, the transport of filter kernels on surfaces results in a rotational ambiguity, which prevents a uniform alignment of these kernels on the surface. We propose a network architecture for surfaces that consists of vector-valued, rotation-equivariant features. The equivariance property makes it possible to locally align features, which were computed in arbitrary coordinate systems, when aggregating features in a convolution layer. The resulting network is agnostic to the choices of coordinate systems for the tangent spaces on the surface. We implement our approach for triangle meshes. Based on circular harmonic functions, we introduce convolution filters for meshes that are rotation-equivariant at the discrete level. We evaluate the resulting networks on shape correspondence and shape classifications tasks and compare their performance to other approaches.
- Open Access
- 24 July 2020
- Published by Springer Nature in Heritage Science
- Vol. 8 (1) , 1-11
Revealing unique inscriptions of a Nazi collaborator in Doodencel 601 of the Oranjehotel
During the Second World War the German occupants of the Netherlands made ample use of the Scheveningen prison near The Hague, popularly nicknamed the Oranjehotel. One former death cell in this infamous prison (Doodencel 601) has been preserved in its original condition, showing wartime inscriptions on the cell walls. Interestingly, a small section of the wall has been given an additional plaster layer, presumably covering inscriptions. Here, we report on the visualization of this enigmatic text, which so far had escaped the reach of historians. Our visualization methodology was threefold. First, we determined the cell-wall stratigraphy and its composition based on a sample cross-section. Second, we prepared a physical model wall, mimicking the layering of the original cell wall. Third, we tested a combination of raking light photography and infrared thermography on the model wall. Applying this methodology on the original wall revealed the inscriptions, including the author’s name Daniël de Blocq van Scheltinga, a prominent Nazi collaborator, as well as a calendar and an important date of his post-war trial in the fall of 1945. Our visualizations flawlessly dovetail with archival findings. Together, they offer an intimate view of an early post-war inmate of the Scheveningen prison, whose message was covered up once the cell was transformed into a war monument in 1946.
- 24 July 2020
- Published by Springer Nature in Heritage Science
- Vol. 8 (1) , 1-11
Open AccessRevealing unique inscriptions of a Nazi collaborator in Doodencel 601 of the Oranjehotel
During the Second World War the German occupants of the Netherlands made ample use of the Scheveningen prison near The Hague, popularly nicknamed the Oranjehotel. One former death cell in this infamous prison (Doodencel 601) has been preserved in its original condition, showing wartime inscriptions on the cell walls. Interestingly, a small section of the wall has been given an additional plaster layer, presumably covering inscriptions. Here, we report on the visualization of this enigmatic text, which so far had escaped the reach of historians. Our visualization methodology was threefold. First, we determined the cell-wall stratigraphy and its composition based on a sample cross-section. Second, we prepared a physical model wall, mimicking the layering of the original cell wall. Third, we tested a combination of raking light photography and infrared thermography on the model wall. Applying this methodology on the original wall revealed the inscriptions, including the author’s name Daniël de Blocq van Scheltinga, a prominent Nazi collaborator, as well as a calendar and an important date of his post-war trial in the fall of 1945. Our visualizations flawlessly dovetail with archival findings. Together, they offer an intimate view of an early post-war inmate of the Scheveningen prison, whose message was covered up once the cell was transformed into a war monument in 1946.
- Open Access
- 26 February 2020
- Published by Association for Computing Machinery (ACM)
- p. 1338
Are We Consistent?
- 26 February 2020
- Published by Association for Computing Machinery (ACM)
- p. 1338
Open AccessAre We Consistent?