Journal: Discrete & Computational Geometry

Volume 39, Issue 4

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

Volume 39, Issue 1-3

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