Discrete & computational geometry

Keyphrases

Publications

volume 70, number 1, 2023

Hana Dal Poz Kouřimská
Discrete Yamabe Problem for Polyhedral Surfaces. Discrete & computational geometry 70 (1) (2023)

volume 70, number 2, 2023

René Corbet, Michael Kerber, Michael Lesnick, Georg Osang
Computing the Multicover Bifiltration. Discrete & computational geometry 70 (2) (2023)

volume 70, number 3, 2023

Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer
Maximum Matchings in Geometric Intersection Graphs. Discrete & computational geometry 70 (3) (2023)
Nóra Frankl, Andrey Kupavskii
Nearly k -Distance Sets. Discrete & computational geometry 70 (3) (2023)
Marek Filakovský, Lukáš Vokřínek
Computing Homotopy Classes for Diagrams. Discrete & computational geometry 70 (3) (2023)

volume 70, number 4, 2023

David Bryant, Katharina T Huber, Vincent Moulton, Paul F Tupper
Diversities and the Generalized Circumradius. Discrete & computational geometry 70 (4) (2023)
Rachel Greenfeld, Terence Tao
Undecidable Translational Tilings with Only Two Tiles, or One Nonabelian Tile. Discrete & computational geometry 70 (4) (2023)

volume 69, number 4, 2023

Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L Schmid, Sue Whitesides
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. Discrete & computational geometry 69 (4) (2023)
Kolja Junginger, Evanthia Papadopoulou
Deletion in Abstract Voronoi Diagrams in Expected Linear Time and Related Problems. Discrete & computational geometry 69 (4) (2023)

volume 70, number 1, 2022

Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Paweł Rzążewski
Completeness for the Complexity Class ∀ ∃ R and Area-Universality. Discrete & computational geometry 70 (1) (2022)

volume 69, number 1, 2022

Georg Loho, Raman Sanyal
Tropical Carathéodory with Matroids. Discrete & computational geometry 69 (1) (2022)
Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, Mathijs Wintraecken
Local Criteria for Triangulating General Manifolds. Discrete & computational geometry 69 (1) (2022)
Maximilian Jaroschek, Manuel Kauers, Laura Kovács
Lonely Points in Simplices. Discrete & computational geometry 69 (1) (2022)
Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, Mathijs Wintraecken
Local Criteria for Triangulating General Manifolds. Discrete & computational geometry 69 (1) (2022)

volume 69, number 3, 2022

Edoardo Dotti, Simon T Drewitz, Ruth Kellerhals
Cusp Density and Commensurability of Non-arithmetic Hyperbolic Coxeter Orbifolds. Discrete & computational geometry 69 (3) (2022)
Alan Arroyo, Fabian Klute, Irene Parada, Birgit Vogtenhuber, Raimund Seidel, Tilo Wiedera
Inserting One Edge into a Simple Drawing is Hard. Discrete & computational geometry 69 (3) (2022)

volume 68, number 3, 2022

Man-Kwun Chiu, Matias Korman, Martin Suderland, Takeshi Tokuyama
Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays. Discrete & computational geometry 68 (3) (2022)

volume 68, number 4, 2022

Sergio Cabello, Danny Z Chen
Guest Editors' Foreword. Discrete & computational geometry 68 (4) (2022)
Aruni Choudhary, Wolfgang Mulzer
No-Dimensional Tverberg Theorems and Algorithms. Discrete & computational geometry 68 (4) (2022)
Uli Wagner, Emo Welzl
Connectivity of Triangulation Flip Graphs in the Plane. Discrete & computational geometry 68 (4) (2022)

volume 67, number 2, 2022

Stefan Felsner, Alexander Pilz, Patrick Schnider
Arrangements of Approaching Pseudo-Lines. Discrete & computational geometry 67 (2) (2022)

volume 67, number 4, 2022

Márton Naszódi, Moritz Venzin
Covering Convex Bodies and the Closest Vector Problem. Discrete & computational geometry 67 (4) (2022)

volume 67, number 1, 2021

Giulia Codenotti, Francisco Santos, Matthias Schymura
The Covering Radius and a Discrete Surface Area for Non-Hollow Simplices. Discrete & computational geometry 67 (1) (2021)
István Tomon
A Sharp Threshold Phenomenon in String Graphs. Discrete & computational geometry 67 (1) (2021)

volume 67, number 2, 2021

Clément Berenfeld, John Harvey, Marc Hoffmann, Krishnan Shankar
Estimating the Reach of a Manifold via its Convexity Defect Function. Discrete & computational geometry 67 (2) (2021)

volume 67, number 3, 2021

Frederik Garbe, Jan Hladký, Joonkyung Lee
Two Remarks on Graph Norms. Discrete & computational geometry 67 (3) (2021)

volume 66, number 2, 2021

Patricia Cahn, Alexandra Kjuchukova
Linking Numbers in Three-Manifolds. Discrete & computational geometry 66 (2) (2021)

volume 66, number 4, 2021

Daniele Dona
Number of Directions Determined by a Set in F q 2 and Growth in Aff ( F q ). Discrete & computational geometry 66 (4) (2021)

volume 65, number 4, 2021

Herbert Edelsbrunner, Georg Osang
The Multi-Cover Persistence of Euclidean Balls. Discrete & computational geometry 65 (4) (2021)

volume 66, number 1, 2020

Jean-Daniel Boissonnat, Olivier Devillers, Kunal Dutta, Marc Glisse
Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets. Discrete & computational geometry 66 (1) (2020)

volume 65, number 1, 2020

Stefan Felsner, Manfred Scheucher
Arrangements of Pseudocircles: Triangles and Drawings. Discrete & computational geometry 65 (1) (2020)

volume 65, number 4, 2019

Roman Prosanov
On a Relation Between Packing and Covering Densities of Convex Bodies. Discrete & computational geometry 65 (4) (2019)

volume 62, number 2, 2019

Yasushi Nagai
A General Framework for Tilings, Delone Sets, Functions, and Measures and Their Interrelation. Discrete & computational geometry 62 (2) (2019)

volume 62, number 4, 2018

Herbert Edelsbrunner, Anton Nikitenko
Poisson-Delaunay Mosaics of Order k. Discrete & computational geometry 62 (4) (2018)

volume 61, number 2, 2018

Joshua Cruz, Chad Giusti, Vladimir Itskov, Bill Kronholm
On open and closed convex codes. Discrete & computational geometry 61 (2) (2018)

volume 61, number 4, 2018

Michael Kerber, Hannah Schreiber
Barcodes of Towers and a Streaming Algorithm for Persistent Homology. Discrete & computational geometry 61 (4) (2018)

volume 59, number 1, 2017

Aaron Lin, Mehdi Makhul, Hossein Nassajian Mojarrad, Josef Schicho, Konrad Swanepoel, Frank de Zeeuw
On Sets Defining Few Ordinary Circles. Discrete & computational geometry 59 (1) (2017)

volume 58, number 1, 2017

Bruno Federici, Agelos Georgakopoulos
Hyperbolicity vs. Amenability for Planar Graphs. Discrete & computational geometry 58 (1) (2017)

volume 58, number 2, 2017

Chris Godsil, David E Roberson, Brendan Rooney, Robert Šámal, Antonios Varvitsiotis
Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings. Discrete & computational geometry 58 (2) (2017)

volume 56, number 1, 2016

Peter Franek, Marek Krčál
On Computability and Triviality of Well Groups. Discrete & computational geometry 56 (1) (2016)

volume 56, number 3, 2016

Franz Aurenhammer, Gernot Walzl
Straight Skeletons and Mitered Offsets of Nonconvex Polytopes. Discrete & computational geometry 56 (3) (2016)

volume 55, 2016

Tibor Jordán, Viktória E Kaszanitzky, Shin-Ichi Tanigawa
Gain-Sparsity and Symmetry-Forced Rigidity in the Plane. Discrete & computational geometry 55 (2016)
Wöden Kusner
On the Densest Packing of Polycylinders in Any Dimension. Discrete & computational geometry 55 (2016)

volume 53, number 4, 2015

Ciprian Borcea, Ileana Streinu
Liftings and stresses for planar periodic frameworks. Discrete & computational geometry 53 (4) (2015)

volume 52, number 4, 2014

Carl Georg Heise, Konstantinos Panagiotou, Oleg Pikhurko, Anusch Taraz
Coloring [Formula: see text]-Embeddable [Formula: see text]-Uniform Hypergraphs. Discrete & computational geometry 52 (4) (2014)