Demo Data from EDBT 2026 / reviewers in the wild / expert
Nader Salman
dblp:61/7215
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory of computation · 1 · 1 first-author
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 · 91% Computational photography and imaging · 9% |
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
delaunay refinement |
0.1 | 1 | 2009 | High resolution surface reconstruction from overlapping multiple-views · SCG 2009 |
Geometric modeling and processing
mesh generation |
0.1 | 1 | 2009 | High resolution surface reconstruction from overlapping multiple-views · SCG 2009 |
Geometric modeling and processing
surface reconstruction |
0.1 | 1 | 2009 | High resolution surface reconstruction from overlapping multiple-views · SCG 2009 |
Computational photography and imaging › depth estimation
depth map fusion |
0.0 | 1 | 2009 | High resolution surface reconstruction from overlapping multiple-views · SCG 2009 |
Methods — techniques the papers use, named apart from their topics
stereo vision · 0.1restricted delaunay triangulation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Feature Preserving Mesh Generation from 3D Point CloudsabstractAbstract We address the problem of generating quality surface triangle meshes from 3D point clouds sampled on piecewise smooth surfaces. Using a feature detection process based on the covariance matrices of Voronoi cells, we first extract from the point cloud a set of sharp features. Our algorithm also runs on the input point cloud a reconstruction process, such as Poisson reconstruction, providing an implicit surface. A feature preserving variant of a Delaunay refinement process is then used to generate a mesh approximating the implicit surface and containing a faithful representation of the extracted sharp edges. Such a mesh provides an enhanced trade‐off between accuracy and mesh complexity. The whole process is robust to noise and made versatile through a small set of parameters which govern the mesh sizing, approximation error and shape of the elements. We demonstrate the effectiveness of our method on a variety of models including laser scanned datasets ranging from indoor to outdoor scenes. Nader Salman, Mariette Yvinec, Quentin Mérigot |
Comput. Graph. Forum | 1 |
| 2009 | High resolution surface reconstruction from overlapping multiple-viewsabstractExtracting a computer model of a real scene from a sequence of views, is one of the most challenging and fundamental problems in computer vision. Stereo vision algorithms allow us to extract from the images a sparse 3D point cloud on the scene surfaces. However, computing an accurate mesh of the scene based on such poor quality data points (noise, sparsity) is very difficult. Here we describe a simple yet original approach that uses both the stereo vision extracted point cloud and the calibrated images. Our method is a three-stage process in which the first stage merges, filters and smoothes the input 3D points. The second stage builds for each calibrated image a triangular depth-map and fuses the set of depth-maps into a triangle soup that minimize violations of size and visibility constraints. Finally, a mesh is computed from the triangle soup using a reconstruction method that combines restricted Delaunay triangulation and Delaunay refinement. Nader Salman, Mariette Yvinec |
SCG | 1 |