Advances in Discrete and Computational Geometry
AMSComputational geometryDiscrete geometryIMSProceedingsResearch conferenceSIAMSouth Hadley, MA (USA)
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to convex and discrete geometry (52-06) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
The articles of this volume will be reviewed individually. Indexed articles: \textit{Agarwal, Pankaj K.; Erickson, Jeff}, Geometric range searching and its relatives, 1-56 [Zbl 0916.68031] \textit{Amenta, Nina; Ziegler, Günter M.}, Deformed products and maximal shadows of polytopes, 57-90 [Zbl 0916.90205] \textit{Billera, Louis J.; Chan, Clara S.; Liu, Niandong}, Flag complexes, labelled rooted trees, and star shellings, 91-102 [Zbl 0941.52007] \textit{Chazelle, Bernard}, Discrepancy bounds for geometric set systems with square incidence matrices, 103-107 [Zbl 0916.68171] \textit{Dey, Tamal K.; Edelsbrunner, Herbert; Guha, Sumanta}, Computational topology, 109-143 [Zbl 0916.68202] \textit{Fejes Tóth, Gábor}, Recent progress on packing and covering, 145-162 [Zbl 0928.52010] \textit{Grünbaum, Branko}, Acoptic polyhedra, 163-199 [Zbl 0927.52016] \textit{Holt, Fred; Klee, Victor}, A proof of the strict monotone 4-step conjecture, 201-216 [Zbl 0916.90206] \textit{Itenberg, Ilia; Roy, Marie-Françoise}, Interactions between real algebraic geometry and discrete and computational geometry, 217-236 [Zbl 0954.14040] \textit{O'Rourke, Joseph}, Open problems in the combinatorics of visibility and illumination, 237-243 [Zbl 0934.52001] \textit{Pach, János; Solymosi, József}, Halving lines and perfect cross-matchings, 245-249 [Zbl 0934.05120] \textit{Pach, János; Thiele, Torsten; Tóth, Géza}, Three-dimensional grid drawings of graphs, 251-255 [Zbl 0920.05041] \textit{Pocchiola, Michel; Vegter, Gert}, On polygonal covers, 257-267 [Zbl 0916.68172] \textit{Richter-Gebert, Jürgen}, The universality theorems for oriented matroids and polytopes, 269-292 [Zbl 0933.52017] \textit{Senechal, Marjorie}, Periodic and aperiodic tilings of \(E^n\), 293-312 [Zbl 0927.52027] \textit{Shamos, Michael Ian}, The early years of computational geometry -- a personal memoir, 313-333 [Zbl 0916.68173] \textit{Sharir, Micha}, Arrangements of surfaces in higher dimensions, 335-353 [Zbl 0916.68174] \textit{Spencer, Joel}, Geometric discrepancy theory, 355-367 [Zbl 0954.52018] \textit{Tverberg, Helge}, Proof of Reay's conjecture on certain positive-dimensional intersections, 369-374 [Zbl 0935.52004] \textit{Wenger, Rephael}, Progress in geometric transversal theory, 375-393 [Zbl 0935.52005] \textit{Ziegler, Günter M.}, Recent progress on polytopes, 395-406 [Zbl 0919.52001] \textit{CG Impact Task Force}, Appendix: Application challenges to computational geometry, 407-463 [Zbl 0929.68119]
- Computing connectedness: disconnectedness and discreteness.
- Proceedings of the 9th international conference on geometry and graphics, Johannesburg, South Africa, July 28--31, 2000. Vol. 1
- On Map Labeling with Leaders
- scientific article; zbMATH DE number 52321 (Why is no real title available?)
- scientific article; zbMATH DE number 1872684 (Why is no real title available?)
- Surveys on Discrete and Computational Geometry
- LABELING POINTS ON A SINGLE LINE
- Upper and lower bounds on the smoothed complexity of the simplex method
This page was built for publication: Advances in Discrete and Computational Geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4220709)