Combinatorial complexity bounds for arrangements of curves and spheres

Type: Article

Publication Date: 1990-03-01

Citations: 334

DOI: https://doi.org/10.1007/bf02187783

Locations

  • Discrete & Computational Geometry - View - PDF

Similar Works

Action Title Year Authors
+ Balanced Line Separators of Unit Disk Graphs 2017 Paz Carmi
Man Kwun Chiu
Matthew J. Katz
Matias Korman
Yoshio Okamoto
André van Renssen
Marcel Roeloffzen
Taichi Shiitada
Shakhar Smorodinsky
+ Balanced Line Separators of Unit Disk Graphs 2017 Paz Carmi
Man Kwun Chiu
Matthew J. Katz
Matias Korman
Yoshio Okamoto
André van Renssen
Marcel Roeloffzen
Taichi Shiitada
Shakhar Smorodinsky
+ PDF Chat Improved Bounds for Incidences Between Points and Circles 2014 Micha Sharir
Adam Sheffer
Joshua Zahl
+ PDF Chat Improved Lower Bound on the Number of Pseudoline Arrangements 2024 Justin Dallant
+ PDF Chat Extremal problems on triangle areas in two and three dimensions 2009 Adrian Dumitrescu
Micha Sharir
Csaba D. Tóth
+ Hyperplane arrangements with large average diameter: a computational approach 2019 Antoine Deza
Hiroyuki Miyata
Sonoko Moriyama
Feng Xie
+ PDF Chat An Improved Constant Factor for the Unit Distance Problem 2022 Péter Ágoston
Dömötör Pálvölgyi
+ The Complexity of Recognizing Geometric Hypergraphs 2023 Daniel Bertschinger
Nicolas El Maalouly
Linda Kleist
Tillmann Miltzow
Simon Weber
+ How do curved spheres intersect in 3-space? 2012 Sergey Avvakumov
+ An improved constant factor for the unit distance problem 2020 Péter Ágoston
Dömötör Pálvölgyi
+ PDF Chat Improved bounds for incidences between points and circles 2013 Micha Sharir
Adam Sheffer
Joshua Zahl
+ PDF Chat Improved bounds for incidences between points and circles 2013 Micha Sharir
Adam Sheffer
Joshua Zahl
+ PDF Chat Approximating Minimum Manhattan Networks in Higher Dimensions 2013 Aparna Das
Emden R. Gansner
Michael Kaufmann
Stephen Kobourov
Joachim Spoerhase
Alexander Wolff
+ How do curved spheres intersect in 3-space? 2012 Sergey Avvakumov
+ Combinatorial and computational results for line arrangements in space 1989 Herbert Edelsbrunner
+ A note on the unit distance problem for planar configurations with $\mathbb{Q}$-independent direction set 2015 Mark Herman
Jonathan Pakianathan
+ The Complexity of Recognizing Geometric Hypergraphs 2023 Daniel Bertschinger
Nicolas El Maalouly
Linda Kleist
Tillmann Miltzow
Simon Weber
+ An improved constant factor for the unit distance problem. 2020 Péter Ágoston
Dömötör Pálvölgyi
+ PDF Chat Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes 2011 Menelaos I. Karavelas
Eleni Tzanaki
+ On Arrangements of Orthogonal Circles 2019 Steven Chaplick
Henry Förster
Myroslav Kryven
Alexander Wolff