Discrete & Computational Geometry, Volume 32

Volume 32, Number 1, May 2004

Peter McMullen:
Regular Polytopes of Full Rank. 1-35
Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang:
Computing the Writhing Number of a Polygonal Knot. 37-53
Egon Schulte:
Chiral Polyhedra in Ordinary Space, I. 55-99
Károly Bezdek, Robert Connelly:
The Kneser-Poulsen Conjecture for Spherical Polytopes. 101-106
Boris Aronov, Micha Sharir:
Cell Complexities in Hyperplane Arrangements. 107-115
Yana Mohanty:
Construction of a 3/4-Ideal Hyperbolic Tetrahedron out of Ideal Tetrahedra. 117-128
Jean B. Lasserre:
The Integer Hull of a Convex Rational Polytope. 129-139
Joseph A. Johnson, George D. Poole, John E. Wetzel:
A Small Cover for Convex Unit Arcs. 141-147
Petra Wiederhold, Richard G. Wilson:
The Alexandroff Dimension of Quotients of R ². 149-160

Mark de Berg:
Guest Editor's Foreword. 165-166
József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy:
Long Monotone Paths in Line Arrangements. 167-176
Timothy M. Chan:
Euclidean Bounded-Degree Spanning Tree Ratios. 177-194
Jirí Matousek, Uli Wagner:
New Constructions of Weak epsilon-Nets. 195-206
Artur Czumaj, Hairong Zhao:
Fault-Tolerant Geometric Spanners. 207-230
Kree Cole-McLaughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci:
Loops in Reeb Graphs of 2-Manifolds. 231-244
Joachim Giesen, Uli Wagner:
Shape Dimension and Intrinsic Metric from Samples of Manifolds. 245-267
Sariel Har-Peled, Kasturi R. Varadarajan:
High-Dimensional Shape Fitting in Linear Time. 269-288

Robert Bryant, Herbert Edelsbrunner, Patrice Koehl, Michael Levitt:
The Area Derivative of a Space-Filling Diagram. 293-308
Randall Dougherty, Vance Faber, Michael Murphy:
Unflippable Tetrahedral Complexes. 309-315
Ulrich Betke:
Relaxation, New Combinatorial and Polynomial Algorithms for the Linear Feasibility Problem. 317-338
Jonathan Richard Shewchuk:
Stabbing Delaunay Tetrahedralizations. 339-343
Grigoriy Blekherman:
Convexity Properties of the Cone of Nonnegative Polynomials. 345-371
Dmitry N. Kozlov:
Directed Trees in a String, Real Polynomials with Triple Roots, and Chain Mails. 373-382
Jean-Marie Morvan, Boris Thibert:
Approximation of the Normal Vector Field and the Area of a Smooth Surface. 383-400
Siu-Wing Cheng, Otfried Cheong, Hazel Everett, René van Oostrum:
Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons. 401-415
Mohab Safey El Din, Éric Schost:
Properness Defects of Projections and Computation of at Least One Point in Each Connected Component of a Real Algebraic Set. 417-430

Margaret M. Bayer, Carl W. Lee, Bernd Sturmfels:
Guest Editors' Preface. 435-436
Matthias Beck:
The Partial-Fractions Method for Counting Solutions to Integral Linear Systems. 437-446
René Brandenberg, Abhi Dattasharma, Peter Gritzmann, David G. Larman:
Isoradial Bodies. 447-457
Jesús A. De Loera, Tyrrell B. McAllister:
Vertices of Gelfand-Tsetlin Polytopes. 459-470
Mike Develin:
A Complexity Bound on Faces of the Hull Complex. 471-479
Richard Ehrenborg, Stephanie van Willigenburg:
Enumerative Properties of Ferrers Graphs. 481-492
Gábor Hetyei:
Tchebyshev Posets. 493-520
Peter McMullen:
Mixed Fibre Polytopes. 521-532
Kathryn L. Nyman, Ed Swartz:
Inequalities for the h-Vectors and Flag h-Vectors of Geometric Lattices. 533-548
Shmuel Onn, Uriel G. Rothblum:
Convex Combinatorial Optimization. 549-566
David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Walter Whiteley:
Non-Crossing Frameworks with Non-Crossing Reciprocals. 567-600
Andreas Paffenholz, Günter M. Ziegler:
The E _t-Construction for Lattices, Spheres and Polytopes. 601-621
Lauren L. Rose:
Graphs, Syzygies, and Multivariate Splines. 623-637