Demo Data from VLDB 2026 / reviewers in the wild / expert
Georges Nader
dblp:186/2002
· DBLP profile ↗
7ranked-venue papers
5as first author
3since 2021 · last 2026
0000-0002-7856-6448ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 7 · 5 first-author · 3 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
3 papers |
Computational fabrication · 47% Geometric modeling and processing · 43% Image and video coding · 11% |
Topics — the 7 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational fabrication › textile fabrication
machine knitting |
0.5 | 1 | 2021 | KnitKit: a flexible system for machine knitting of customizable textiles · ACM Trans. Graph. 2021 |
Image and video coding › image quality assessment
just noticeable distortion |
0.2 | 1 | 2016 | Just Noticeable Distortion Profile for Flat-Shaded 3D Mesh Surfaces · IEEE Trans. Vis. Comput. Graph. 2016 |
Geometric modeling and processing
mesh processing |
0.2 | 1 | 2016 | Just Noticeable Distortion Profile for Flat-Shaded 3D Mesh Surfaces · IEEE Trans. Vis. Comput. Graph. 2016 |
Geometric modeling and processing › mesh processing
mesh simplification |
0.2 | 1 | 2016 | Just Noticeable Distortion Profile for Flat-Shaded 3D Mesh Surfaces · IEEE Trans. Vis. Comput. Graph. 2016 |
Computational fabrication › appearance fabrication
caustic design |
0.1 | 1 | 2018 | Instant transport maps on 2D grids · ACM Trans. Graph. 2018 |
Geometric modeling and processing › mesh processing
remeshing |
0.1 | 1 | 2018 | Instant transport maps on 2D grids · ACM Trans. Graph. 2018 |
Geometric modeling and processing › mesh processing
mesh compression |
0.1 | 1 | 2016 | Just Noticeable Distortion Profile for Flat-Shaded 3D Mesh Surfaces · IEEE Trans. Vis. Comput. Graph. 2016 |
Methods — techniques the papers use, named apart from their topics
knitnet data structure · 0.5graph rewriting · 0.5numerical inversion · 0.3iterative solver · 0.3psychophysical experiment · 0.2contrast sensitivity function · 0.2contrast masking · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A Hybrid Neural-Microfacet BRDF Model for Real-Time RenderingabstractAbstract Over the past decade, microfacet‐based BRDF models have formed the foundation of real‐time rendering pipelines. Despite their widespread use, they often fail to reproduce subtle appearance effects arising from complex light–surface interactions, which have led to the emergence of specialized physics‐based models for specific optical phenomena (e.g., diffraction, iridescence, multilayers). Although more accurate, these models lose versatility and lack performance for real‐time rendering. Recently introduced, neural models have demonstrated their ability to approximate BRDF reference data coming from measurements, simulations, or even complex shading networks. However, most current neural models require relatively large networks, making them costly for real‐time rendering. In this paper, we introduce a hybrid model that combines a GGX‐type microfacet model and a neural model to leverage the best features of both representations. The neural component corrects the appearance approximated by the microfacet component, allowing much smaller network than in existing neural models. We show that, at identical memory cost, our model approximates measurements better than state‐of‐the‐art neural models for a low evaluation overhead compared to a microfacet‐based model. Furthermore, our hybrid model remains easily editable by artists and benefits from an important sampling scheme, making it attractive for both offline and real‐time rendering. Louis de Oliveira, Anastasia Karpova, Georges Nader, Antoine Houdard, Pierre Mézières, Damien Rioux-Lavoie, Romain Pacanowski |
Comput. Graph. Forum | 3 |
| 2024 | Real-Time Neural Materials using Block-Compressed FeaturesabstractAbstract Neural materials typically consist of a collection of neural features along with a decoder network. The main challenge in integrating such models in real‐time rendering pipelines lies in the large size required to store their features in GPU memory and the complexity of evaluating the network efficiently. We present a neural material model whose features and decoder are specifically designed to be used in real‐time rendering pipelines. Our framework leverages hardware‐based block compression (BC) texture formats to store the learned features and trains the model to output the material information continuously in space and scale. To achieve this, we organize the features in a block‐based manner and emulate BC6 decompression during training, making it possible to export them as regular BC6 textures. This structure allows us to use high resolution features while maintaining a low memory footprint. Consequently, this enhances our model's overall capability, enabling the use of a lightweight and simple decoder architecture that can be evaluated directly in a shader. Furthermore, since the learned features can be decoded continuously, it allows for random uv sampling and smooth transition between scales without needing any subsequent filtering. As a result, our neural material has a small memory footprint, can be decoded extremely fast adding a minimal computational overhead to the rendering pipeline. Clément Weinreich, Leonardo de Oliveira, Antoine Houdard, Georges Nader |
Comput. Graph. Forum | 4 |
| 2021 | KnitKit: a flexible system for machine knitting of customizable textilesabstractIn this work, we introduce KnitKit , a flexible and customizable system for the computational design and production of functional, multi-material, and three-dimensional knitted textiles. Our system greatly simplifies the knitting of 3D objects with complex, varying patterns that use multiple yarns and stitch patterns by separating the high-level design specification in terms of geometry, stitch patterns, materials or colors from the low-level, machine-specific knitting instruction generation. Starting from a triangular 3D mesh and a 2D texture that specifies knitting patterns on top of the geometry, our system generates the required machine instructions in three major steps. First, the input is processed and the KnitNet data structure is generated. This graph structure serves as an abstract interface between the high-level geometric and knitting configuration and the low-level, machine-specific knitting instructions. Second, a graph rewriting procedure is applied on the KnitNet that produces a sequence of abstract machine actions. Finally, the low-level machine instructions are generated by adapting those abstract actions to a specific machine context. We showcase the potential of this computational approach by designing and fabricating a variety of objects with complex geometries, multiple yarns, and multiple stitch patterns. Georges Nader, Yu Han Quek, Pei Zhi Chia, Oliver Weeger, Sai-Kit Yeung |
ACM Trans. Graph. | 1 |
| 2018 | Instant transport maps on 2D gridsabstractIn this paper, we introduce a novel and extremely fast algorithm to compute continuous transport maps between 2D probability densities discretized on uniform grids. The core of our method is a novel iterative solver computing the L 2 optimal transport map from a grid to the uniform density in the 2D Euclidean plane. A transport map between arbitrary densities is then recovered through numerical inversion and composition. In this case, the resulting map is only approximately optimal, but it is continuous and density preserving. Our solver is derivative-free, and it converges in a few cheap iterations. We demonstrate interactive performance in various applications such as adaptive sampling, feature sensitive remeshing, and caustic design. Georges Nader, Gaël Guennebaud |
ACM Trans. Graph. | 1 |
| 2016 | Visual Contrast Sensitivity and Discrimination for 3D Meshes and their ApplicationsabstractAbstract In this paper, we first introduce an algorithm for estimating the visual contrast on a 3D mesh. We then perform a series of psychophysical experiments to study the effects of contrast sensitivity and contrast discrimination of the human visual system for the task of differentiating between two contrasts on a 3D mesh. The results of these experiments allow us to propose a perceptual model that is able to predict whether a change in local contrast on 3D mesh, induced by a local geometric distortion, is visible or not. Finally, we illustrate the utility of the proposed perceptual model in a number of applications: we compute the Just Noticeable Distortion (JND) profile for smooth‐shaded 3D meshes and use the model to guide mesh processing algorithms. Georges Nader, Kai Wang 0002, Franck Hétroy-Wheeler, Florent Dupont |
Comput. Graph. Forum | 1 |
| 2016 | Just Noticeable Distortion Profile for Flat-Shaded 3D Mesh SurfacesabstractIt is common that a 3D mesh undergoes some lossy operations (e.g., compression, watermarking and transmission through noisy channels), which can introduce geometric distortions as a change in vertex position. In most cases the end users of 3D meshes are human beings; therefore, it is important to evaluate the visibility of introduced vertex displacement. In this paper we present a model for computing a Just Noticeable Distortion (JND) profile for flat-shaded 3D meshes. The proposed model is based on an experimental study of the properties of the human visual system while observing a flat-shaded 3D mesh surface, in particular the contrast sensitivity function and contrast masking. We first define appropriate local perceptual properties on 3D meshes. We then detail the results of a series of psychophysical experiments where we have measured the threshold needed for a human observer to detect the change in vertex position. These results allow us to compute the JND profile for flat-shaded 3D meshes. The proposed JND model has been evaluated via a subjective experiment, and applied to guide 3D mesh simplification as well as to determine the optimal vertex coordinates quantization level for a 3D model. Georges Nader, Kai Wang 0002, Franck Hétroy-Wheeler, Florent Dupont |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2014 | Adaptive multi-scale analysis for point-based surface editingabstractAbstract This paper presents a tool that enables the direct editing of surface features in large point‐clouds or meshes. This is made possible by a novel multi‐scale analysis of unstructured point‐clouds that automatically extracts the number of relevant features together with their respective scale all over the surface. Then, combining this ingredient with an adequate multi‐scale decomposition allows us to directly enhance or reduce each feature in an independent manner. Our feature extraction is based on the analysis of the scale‐variations of locally fitted surface primitives combined with unsupervised learning techniques. Our tool may be applied either globally or locally, and millions of points are handled in real‐time. The resulting system enables users to accurately edit complex geometries with minimal interaction. Georges Nader, Gaël Guennebaud, Nicolas Mellado |
Comput. Graph. Forum | 1 |