On angles in higher order Brillouin tessellations and related tilings in the plane
H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, M. Saghafian, Discrete and Computational Geometry (2023).

Iterated medial triangle subdivision in surfaces of constant curvature
F.R. Brunck, Discrete and Computational Geometry 70 (2023) 1059–1089.

Continuous and discrete radius functions on Voronoi tessellations and Delaunay mosaics
R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, Discrete and Computational Geometry 67 (2022) 811–842.

Barycentric cuts through a convex body
Z. Patakova, M. Tancer, U. Wagner, Discrete and Computational Geometry 68 (2022) 1133–1154.

Connectivity of triangulation flip graphs in the plane
U. Wagner, E. Welzl, Discrete &; Computational Geometry 68 (2022) 1227–1284.

The Z2-Genus of Kuratowski minors
R. Fulek, J. Kyndl, Discrete and Computational Geometry 68 (2022) 425–447.

Vanishing of all equivariant obstructions and the mapping degree
S. Avvakumov, S. Kudrya, Discrete &; Computational Geometry 66 (2021) 1202–1216.

The multi-cover persistence of Euclidean balls
H. Edelsbrunner, G.F. Osang, Discrete and Computational Geometry 65 (2021) 1296–1313.

Triangulating submanifolds: An elementary and quantified version of Whitney’s method
J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, Discrete &; Computational Geometry 66 (2021) 386–434.

On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs
A. Akopyan, A.I. Bobenko, W.K. Schief, J. Techter, Discrete and Computational Geometry 66 (2021) 938–976.

Local conditions for triangulating submanifolds of Euclidean space
J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, M. Wintraecken, Discrete and Computational Geometry 66 (2021) 666–686.

Sheaf-theoretic stratification learning from geometric and topological perspectives
A. Brown, B. Wang, Discrete and Computational Geometry 65 (2021) 1166–1198.

A proof of the orbit conjecture for flipping edge-labelled triangulations
A. Lubiw, Z. Masárová, U. Wagner, Discrete &; Computational Geometry 61 (2019) 880–898.

Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions
H. Edelsbrunner, B.T. Fasy, G. Rote, Discrete &; Computational Geometry 49 (2013) 797–822.

Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete &; Computational Geometry 6 (1991) 407–422.

Points and triangles in the plane and halving planes in space
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, Discrete &; Computational Geometry 6 (1991) 435–442.

The complexity of many cells in arrangements of planes and related problems
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &; Computational Geometry 5 (1990) 197–216.

The complexity and construction of many faces in arrangements of lines and of segments
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &; Computational Geometry 5 (1990) 161–196.

The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n2
H. Edelsbrunner, M. Sharir, Discrete &; Computational Geometry 5 (1990) 35–42.

Combinatorial complexity bounds for arrangements of curves and spheres
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete &; Computational Geometry 5 (1990) 99–160.