EDBT 2026 Demo / reviewers in the wild / expert
Nadja Goerigk
dblp:221/2353
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2Artificial intelligence and machine learning · 1
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.
| Theoretical computer science
2 papers |
Computational geometry · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational geometry
steiner points |
0.7 | 2 | 2018 | Generalised Bagemihl polyhedra and a tight bound on the number of interior Steiner points · Comput. Aided Des. 2018 On tetrahedralisations of generalised Chazelle polyhedra with interior Steiner points · Comput. Aided Des. 2018 |
Computational geometry › polytopes
polyhedra |
0.3 | 1 | 2018 | Generalised Bagemihl polyhedra and a tight bound on the number of interior Steiner points · Comput. Aided Des. 2018 |
Computational geometry › mesh generation
tetrahedralization |
0.3 | 1 | 2018 | On tetrahedralisations of generalised Chazelle polyhedra with interior Steiner points · Comput. Aided Des. 2018 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Trajectory Planning for Automated Merging on HighwaysabstractThis article introduces a new approach for trajectory planning for merging on highways. The aim of the algorithm, is to find a comfortable driving strategy to merge in a gap on the target lane. Therfore, the proposed algorithm determines a bunch of trajectories to reach surrounding gaps. The trajectory with the lowest costs for each gap is chosen. To obtain the longitudinal component of the trajectory, a five-part section-wise defined polynomial in Frenet space is used to generate comfortable driving behaviour, with as few changes in the acceleration profile as possible. Based on the prediction of surrounding traffic, different variations of deceleration and acceleration are combined. For each longitudinal part, a lateral component to perform a lane change into the target gap is evaluated. The concept allows to evaluate the influence of the longitudinal driving strategy on the dynamics required to change lanes. The algorithm is evaluated in a MATLAB simulation including a runtime estimation. Johannes Potzy, Nadja Goerigk, Thomas Heil, Dennis Fassbender, Karl-Heinz Siedersberger |
VEHITS | 2 |
| 2018 | On tetrahedralisations of generalised Chazelle polyhedra with interior Steiner points
Hang Si, Nadja Goerigk |
Comput. Aided Des. | 2 |
| 2018 | Generalised Bagemihl polyhedra and a tight bound on the number of interior Steiner points
Hang Si, Nadja Goerigk |
Comput. Aided Des. | 2 |