Discrete & Computational Geometry, Volume 39

Volume 39, Number 1-3, March 2008

• Jacob E. Goodman, János Pach, Richard Pollack:
  Foreword. 1-2
  Electronic Edition (link) BibTeX
• Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote:
  There Are Not Too Many Magic Configurations. 3-16
  Electronic Edition (link) BibTeX
• Pankaj K. Agarwal, Rolf Klein, Christian Knauer, Stefan Langerman, Pat Morin, Micha Sharir, Michael A. Soss:
  Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. 17-37
  Electronic Edition (link) BibTeX
• Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu:
  Robust Shape Fitting via Peeling and Grating Coresets. 38-58
  Electronic Edition (link) BibTeX
• Iskander Aliev:
  Siegel's Lemma and Sum-Distinct Sets. 59-66
  Electronic Edition (link) BibTeX
• Imre Bárány, Alfredo Hubard, Jesús Jerónimo:
  Slicing Convex Sets and Measures by a Hyperplane. 67-75
  Electronic Edition (link) BibTeX
• Alexander I. Barvinok, Isabella Novik:
  A Centrally Symmetric Version of the Cyclic Polytope. 76-99
  Electronic Edition (link) BibTeX
• Saugata Basu, Thierry Zell:
  On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities. 100-122
  Electronic Edition (link) BibTeX
• Louis J. Billera, Samuel K. Hsiao, J. Scott Provan:
  Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres. 123-137
  Electronic Edition (link) BibTeX
• Jean-Daniel Boissonnat, David Cohen-Steiner, Gert Vegter:
  Isotopic Implicit Surface Meshing. 138-157
  Electronic Edition (link) BibTeX
• Ciprian Borcea, Xavier Goaoc, Sylvain Petitjean:
  Line Transversals to Disjoint Balls. 158-173
  Electronic Edition (link) BibTeX
• Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich:
  Generating All Vertices of a Polyhedron Is Hard. 174-190
  Electronic Edition (link) BibTeX
• Benjamin Braun:
  Norm Bounds for Ehrhart Polynomial Roots. 191-193
  Electronic Edition (link) BibTeX
• Otfried Cheong, Xavier Goaoc, Andreas Holmsen, Sylvain Petitjean:
  Helly-Type Theorems for Line Transversals to Disjoint Unit Balls. 194-212
  Electronic Edition (link) BibTeX
• Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
  Grid Vertex-Unfolding Orthogonal Polyhedra. 213-238
  Electronic Edition (link) BibTeX
• Tobias Gerken:
  Empty Convex Hexagons in Planar Point Sets. 239-272
  Electronic Edition (link) BibTeX
• Paolo Gronchi, Marco Longinetti:
  Affinely Regular Polygons as Extremals of Area Functionals. 273-297
  Electronic Edition (link) BibTeX
• John Hershberger:
  Improved Output-Sensitive Snap Rounding. 298-318
  Electronic Edition (link) BibTeX
• Jeong-Yup Lee, Boris Solomyak:
  Pure Point Diffractive Substitution Delone Sets Have the Meyer Property. 319-338
  Electronic Edition (link) BibTeX
• Ezra Miller, Igor Pak:
  Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings. 339-388
  Electronic Edition (link) BibTeX
• Uwe Nagel:
  Empty Simplices of Polytopes and Graded Betti Numbers. 389-410
  Electronic Edition (link) BibTeX
• Eran Nevo:
  Rigidity and the Lower Bound Theorem for Doubly Cohen-Macaulay Complexes. 411-418
  Electronic Edition (link) BibTeX
• Partha Niyogi, Stephen Smale, Shmuel Weinberger:
  Finding the Homology of Submanifolds with High Confidence from Random Samples. 419-441
  Electronic Edition (link) BibTeX
• Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
  Odd Crossing Number and Crossing Number Are Not the Same. 442-454
  Electronic Edition (link) BibTeX
• Florian Pfender:
  Visibility Graphs of Point Sets in the Plane. 455-459
  Electronic Edition (link) BibTeX
• Krzysztof Przeslawski, David Yost:
  Decomposability of Polytopes. 460-468
  Electronic Edition (link) BibTeX
• Ross M. Richardson, Van H. Vu, Lei Wu:
  An Inscribing Model for Random Polytopes. 469-499
  Electronic Edition (link) BibTeX
• Yevgeny Schreiber, Micha Sharir:
  An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions. 500-579
  Electronic Edition (link) BibTeX
• Jonathan Richard Shewchuk:
  General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties. 580-637
  Electronic Edition (link) BibTeX

Volume 39, Number 4, June 2008

• Fatima Boudaoud, Fabrizio Caruso, Marie-Françoise Roy:
  Certificates of Positivity in the Bernstein Basis. 639-655
  Electronic Edition (link) BibTeX
• Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann:
  Efficient Algorithms for Maximum Regression Depth. 656-677
  Electronic Edition (link) BibTeX
• Dusko Jojic:
  Weighted Derivations and the cd -Index. 678-689
  Electronic Edition (link) BibTeX
• Nir Halman:
  Discrete and Lexicographic Helly-Type Theorems. 690-719
  Electronic Edition (link) BibTeX
• Yuri Rabinovich:
  On Average Distortion of Embedding Metrics into the Line. 720-733
  Electronic Edition (link) BibTeX
• Saugata Basu, Michael Kettner:
  A Sharper Estimate on the Betti Numbers of Sets Defined by Quadratic Inequalities. 734-746
  Electronic Edition (link) BibTeX
• Jeff Edmonds:
  Embedding into l_infinity² Is Easy, Embedding into l _infinity³ Is NP-Complete. 747-765
  Electronic Edition (link) BibTeX
• Roman N. Karasev:
  Piercing Families of Convex Sets with the d -Intersection Property in R ^d . 766-777
  Electronic Edition (link) BibTeX
• Michael O. Albertson, Debra L. Boutin:
  Automorphisms and Distinguishing Numbers of Geometric Cliques. 778-785
  Electronic Edition (link) BibTeX
• Tobias Kreisel, Sascha Kurz:
  There Are Integral Heptagons, no Three Points on a Line, no Four on a Circle. 786-790
  Electronic Edition (link) BibTeX
• Géza Tóth:
  Note on the Pair-crossing Number and the Odd-crossing Number. 791-799
  Electronic Edition (link) BibTeX