A complete application in a minute — tailored resume and cover letter, ready to send.
1000scholars invites a Postdoctoral researcher to join the JUNN project in the Provence-Alpes-Côte d'Azur region. The role focuses on extending space partitioning structures for non-planar geometry, using CGAL, C++, and lidar-style data, with an emphasis on efficient updates to 3D city models.
The candidate will prototype expressive data structures, study update-local modification strategies, and collaborate with Luxcarta and GeometryFactory partners to ensure scalable performance in a demanding
In a world facing profound upheavals—ecological, energy-related, economic, health-related, social, and more—territories are at the heart of the most complex decisions. The stakeholders within these territories are under increasing pressure to anticipate, adapt, and invent new approaches to planning and development. It is now essential to be able to anticipate territorial evolution and simulate different management scenarios in order to assess, and even compare, their impacts. This is the objective of the Digital Twin of France and its Territories (JUNN) project, initiated and co-led by the IGN (National Institute of Geographic and Forest Information), Cerema (Center for Studies and Expertise on Risks, Environment, Mobility and Urban Planning), and Inria (National Institute for Research in Digital Science and Technology). The 3D reconstruction of urban objects – in particular the buildings - from remote sensing data - typically Airborne Lidar Scans (ALS) - constitutes one of the core research axes of the JUNN project. Urban reconstruction from Lidar point cloud is a multifaceted problem in which output models are expected to be (i) accurate (adherence to the input data) and (ii) of high geometric quality (conciseness, conforming to urban-specific formalisms and geometric guarantees), and algorithms that produce these models must be (iii) automatic, (iv) fast and scalable, (v) generic to adapt to the variety of urban landscapes, and (vi) geometrically memory-efficient for easy updates of the reconstructed objects along time. The existing methods [1,2,3] offer efficient solutions to criteria (i-iv), but tend to overlook criteria (v) and (vi). In particular, these methods rely upon the construction of space partitioning data structures in 2D and/or 3D that take the form of line and plane arrangements [4,5,6,7]. These data structures allow a limited piecewise-planar description of buildings only, without the capacity of finely approximating non planar components or approaching them by more complex parametric shapes. Once constructed, these data structures can also not be easily modified.
The goal of this position is to investigate a new generation of space partitioning data structures that address the limitations mentioned previously. The candidate will design them in the perspective of replacing the traditional data structures used in the JUNN project, working in collaboration with Luxcarta and GeometryFactory partners and using the CGAL library [8]. The candidate will work on two complementary research directions. The candidate will investigate how to generalize line and plane arrangements to more expressive data structures that can better capture the geometry of non-planar shapes, e.g. curved facades and freeform roofs. The hybridization of line and plane arrangements with fine mesh-based structures, as proposed in [9], or the use of parametric shapes with a CSG-based construction tree are two options to explore. This generalization will have to be efficient. In particular, it should not degrade the performance in terms of construction time and scalability of the current line and plane arrangements. The candidate will also investigate the design of update-friendly data structures that can be easily modified once constructed. This characteristic is crucial for efficiently updating the 3D city models, i.e. by only locally modifying the geometry of objects where changes have been detected without reconstructing the entire objects and scenes. Binary Space Partitioning trees, as used in [5,6], could be a solution to this challenge if coupled with an efficient parsing strategy of the geometric atomic elements forming the data structures (e.g. planes and lines).
More info can be found on the JUNN project at https://team.inria.fr/titane/the-jnft-project-2026-2030/
and on the PostDoc position at https://team.inria.fr/titane/files/2026/03/sujet_JNFT_geometric_data_structures.pdf
The ideal candidate should have a Ph.D. in computer science with a strong background in 3D geometry (geometry processing and/or computational geometry), Computer Vision and applied mathematics, be able to program in C/C++, be fluent in English, and be creative and rigorous.