Demo Data from SIGIR 2026 / reviewers in the wild / expert
Mikhail Bogdanov
dblp:142/9967
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 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.
| Theoretical computer science
2 papers |
Computational geometry · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational geometry › triangulation
delaunay triangulation |
0.4 | 2 | 2016 | Delaunay Triangulations on Orientable Surfaces of Low Genus · SoCG 2016 Hyperbolic delaunay complexes and voronoi diagrams made practical · SoCG 2013 |
Computational geometry
covering space |
0.2 | 1 | 2016 | Delaunay Triangulations on Orientable Surfaces of Low Genus · SoCG 2016 |
Computational geometry › voronoi diagram
hyperbolic voronoi diagram |
0.2 | 1 | 2013 | Hyperbolic delaunay complexes and voronoi diagrams made practical · SoCG 2013 |
Computational geometry
voronoi diagram |
0.2 | 1 | 2013 | Hyperbolic delaunay complexes and voronoi diagrams made practical · SoCG 2013 |
Computational geometry › robust geometric computation
exact geometric computation |
0.0 | 1 | 2013 | Hyperbolic delaunay complexes and voronoi diagrams made practical · SoCG 2013 |
Computational geometry › robust geometric computation › exact geometric computation
rational arithmetic |
0.0 | 1 | 2013 | Hyperbolic delaunay complexes and voronoi diagrams made practical · SoCG 2013 |
Methods — techniques the papers use, named apart from their topics
lifting · 0.2isometric embedding · 0.2covering spaces · 0.2space of spheres · 0.2poincaré ball model · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Delaunay Triangulations on Orientable Surfaces of Low GenusabstractEarlier work on Delaunay triangulation of point sets on the 2D flat torus, which is locally isometric to the Euclidean plane, was based on lifting the point set to a locally isometric 9-sheeted covering space of the torus. Under mild conditions the Delaunay triangulation of the lifted point set, consisting of 9 copies of the input set, projects to the Delaunay triangulation of the input set. We improve and generalize this work. First we present a new construction based on an 8-sheeted covering space, which shows that eight copies suffice for the standard flat torus. Then we generalize this construction to the context of compact orientable surfaces of higher genus, which are locally isometric to the hyperbolic plane. We investigate more thoroughly the Bolza surface, homeomorphic to a sphere with two handles, both because it is the hyperbolic surface with lowest genus, and because triangulations on the Bolza surface have applications in various fields such as neuromathematics and cosmological models. While the general properties (existence results of appropriate covering spaces) show similarities with the results for the flat case, explicit constructions and their proofs are much more complex, even in the case of the apparently simple Bolza surface. One of the main reasons is the fact that two hyperbolic translations do not commute in general. To the best of our knowledge, the results in this paper are the first ones of this kind. The interest of our contribution lies not only in the results, but most of all in the construction of covering spaces itself and the study of their properties. Mikhail Bogdanov, Monique Teillaud, Gert Vegter |
SoCG | 1 |
| 2013 | Hyperbolic delaunay complexes and voronoi diagrams made practicalabstractWe study Delaunay complexes and Voronoi diagrams in the Poincaré ball, a conformal model of the hyperbolic space, in any dimension. We elaborate on our earlier work on the space of spheres [CCCG'92], giving a detailed description of algorithms. We also study algebraic and arithmetic issues, observing that only rational computations are needed. All proofs are based on geometric reasoning, they do not resort to any use of the analytic formula of the hyperbolic distance. This allows for an exact and efficient implementation in 2D. All degenerate cases are handled. The implementation will be submitted to the CGAL editorial board for future integration into the CGAL library. Mikhail Bogdanov, Olivier Devillers, Monique Teillaud |
SoCG | 1 |