Cell Complexities in Hyperplane Arrangements
- 期刊名称Discrete and Computational Geometry
- 作者Boris Aronov; Micha Sharir
- 卷第32卷
- 期第1期
- 印刷ISSN0179-5376
- 电子ISSN1432-0444
- 文件大小152.35KB
- 发表时间2004-05
- DOI10.1007/s00454-003-0854-z
- 页码107-115
Crossing numbers of imbalanced graphsJános Pach; József Solymosi; Gábor Tardos · 2010
Coloring axis-parallel rectanglesJános Pach; Gábor Tardos · 2010
Cutting GlassPach, J.; Tardos, G. · Discrete & Computational Geometry · 2000
Tilings with noncongruent trianglesKupavskii, Andrey; Pach, János; Tardos, Gábor · European Journal of Combinatorics · 2018
CONTROLLING LIPSCHITZ FUNCTIONSKupavskii, Andrey; Pach, János; Tardos, Gábor · Mathematika · 2018
Indecomposable CoveringsPach, János; Tardos, Gábor; Tóth, Géza · Canadian Mathematical Bulletin · 2009
Separating convex sets by straight linesJános Pach; Gábor Tardos · 2001
Two poset polytopesRichard P. Stanley · Discrete and Computational Geometry · 1986
Voronoi diagrams and arrangementsHerbert Edelsbrunner; Raimund Seidel · Discrete and Computational Geometry · 1986
Can you cover your shadows?H. E. Debrunner; P. Mani-Levitska · Discrete and Computational Geometry · 1986
Computing circular separabilityJoseph O'Rourke; S. Rao Kosaraju; Nimrod Megiddo · Discrete and Computational Geometry · 1986
Smooth, easy to compute interpolating splinesJohn D. Hobby · Discrete and Computational Geometry · 1986
On polyhedra with transitivity propertiesJ. M. Wills · Discrete and Computational Geometry · 1986
Approximation of convex discs by polygonsA. Florian · Discrete and Computational Geometry · 1986
Diameter partitioningDavid Avis · Discrete and Computational Geometry · 1986