Sommaire

An On-Line Potato-Sack Theorem.

Lassak, M. ; Zhang, J.

Access to full text
p. 1-8

Göttinger Digitalisierungszentrum
Shortest Watchman Routes in Simple Polygons.

Chin, Wei-Pang ; Ntafos, S.

Access to full text
p. 9-32

Göttinger Digitalisierungszentrum
A New Index for Polytopes.

Bayer, M.M. ; Klapper, A.

Access to full text
p. 33-48

Göttinger Digitalisierungszentrum
Theorems on the Existence of Separating Surfaces.

Houle, M.E.

Access to full text
p. 49-56

Göttinger Digitalisierungszentrum
Dispersed Points and Geometric Embedding of Complete Bipartite Graphs.

Maehara, H.

Access to full text
p. 57-68

Göttinger Digitalisierungszentrum
Analytic Formulas for Full Steiner Trees.

Booth, R.S.

Access to full text
p. 69-82

Göttinger Digitalisierungszentrum
Convex Polytopes Whose Projection Bodies and Difference Sets Are Polars.

Martini, H.

Access to full text
p. 83-92

Göttinger Digitalisierungszentrum
The Densest Packing of Equal Circles into a Parallel Strip.

Füredi, Z.

Access to full text
p. 95-106

Göttinger Digitalisierungszentrum
A Dimension Series for Multivariate Splines.

Billera, L.J. ; Rose, L.L.

Access to full text
p. 107-128

Göttinger Digitalisierungszentrum
Lower Bounds on the Length of Monotone Paths in Arrangements.

Matousek, J.

Access to full text
p. 129-134

Göttinger Digitalisierungszentrum
Minimum Ideal Triangulations of Hyperbolic 3-Manifolds.

Adams, C. ; Sherman, W.

Access to full text
p. 135-154

Göttinger Digitalisierungszentrum
A Jordan Surface Theorem for Three-Dimensional Digital Spaces.

Kopperman, R. ; Meyer, P.R. ; Wilson, R.G.

Access to full text
p. 155-162

Göttinger Digitalisierungszentrum
Constraints on the Angular Distribution of the Zeros of a Polynomial of Low Complexity.

Stengle, G.

Access to full text
p. 163-170

Göttinger Digitalisierungszentrum
On Two Conjectures of Franz Hering About Convex Surfaces.

Zamfirescu, T.

Access to full text
p. 171-180

Göttinger Digitalisierungszentrum
Disks with Special Properties of Densest Packings.

Schmitt, P.

Access to full text
p. 181-190

Göttinger Digitalisierungszentrum
Bounding the Number of Connected Components of a Real Algebraic Set.

Loeser, F. ; Benedetti, R. ; Rïsler, J.J.

Access to full text
p. 191-210

Göttinger Digitalisierungszentrum
On the Construction of Abstract Voronoi Diagrams.

Mehlhorn, K. ; Meiser, St. ; ó'Dúnlaing, C.

Access to full text
p. 211-224

Göttinger Digitalisierungszentrum
On the Global Structure of Crystalline Surfaces.

Taylor, J.E.

Access to full text
p. 225-262

Göttinger Digitalisierungszentrum
Bisectors of Linearly Separable Sets.

Nackman, L.R. ; Srinivasan, V.

Access to full text
p. 263-276

Göttinger Digitalisierungszentrum
Maximum Density Space Packing with Parallel Strings of Spheres.

Bezdek, A. ; Kuperberg, W. ; Makai, E.

Access to full text
p. 277-284

Göttinger Digitalisierungszentrum
A Simple and Relatively Efficient Triangulation of the n-Cube.

Haiman, M.

Access to full text
p. 287-290

Göttinger Digitalisierungszentrum
On the Convex Hull of Uniform Random Points in a Simple d-Polytope.

Wieacker, J.A. ; Affentranger, F.

Access to full text
p. 291-306

Göttinger Digitalisierungszentrum
On Levels in Arrangements and Voronoi Diagrams.

Mulmuley, K.

Access to full text
p. 307-338

Göttinger Digitalisierungszentrum
On Graver's Conjecture Concerning the Rigidity Problem of Graphs.

Maehara, H.

Access to full text
p. 339-342

Göttinger Digitalisierungszentrum
Higher-Dimensional Voronoi Diagrams in Linear Expected Time.

Dwyer, R.A.

Access to full text
p. 343-368

Göttinger Digitalisierungszentrum
A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.

Vaidya, P.M.

Access to full text
p. 369-382

Göttinger Digitalisierungszentrum
Guest Editor's Foreword.

Yao, F.

Access to full text
p. 383-384

Göttinger Digitalisierungszentrum
Cutting Hyperplane Arrangements.

Matousek, J.

Access to full text
p. 385-406

Göttinger Digitalisierungszentrum
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.

Edelsbrunner, H. ; Welzl, E. ; Agarwal, P.K. ; Schwarzkopf, O.

Access to full text
p. 407-422

Göttinger Digitalisierungszentrum
Small-Dimensional Linear Programming and Convex Hulls Made Easy.

Seidel, R.

Access to full text
p. 423-434

Göttinger Digitalisierungszentrum
Points and Triangles in the Plane and Halving Planes in Space.

Edelsbrunner, H. ; Chazelle, B. ; Guibas, L.J. ; Sharir, M. ; Wenger, R. ; Aronov, B.

Access to full text
p. 435-442

Göttinger Digitalisierungszentrum
Some Provably Hard Crossing Number Problems.

Bienstock, D.

Access to full text
p. 443-460

Göttinger Digitalisierungszentrum
An Exact Algorithm for Kinodynamic Planning in the Plane.

Canny, J. ; Rege, A. ; Reif, J.

Access to full text
p. 461-484

Göttinger Digitalisierungszentrum
Triangulating a Simple Polygon in Linear Time.

Chazelle, B.

Access to full text
p. 485-524

Göttinger Digitalisierungszentrum
Disjoint Homotopic Paths and Trees in a Planar Graph.

Schrijver, A.

Access to full text
p. 527-574

Göttinger Digitalisierungszentrum
On Translating One Polyomino To Tile the Plane.

Beauquier, D. ; Nivat, M.

Access to full text
p. 575-592

Göttinger Digitalisierungszentrum
On k-Sets in Arrangements of Curves and Surfaces.

Sharir, M.

Access to full text
p. 593-613

Göttinger Digitalisierungszentrum