Sommaire

A Nonuniform Matroid Which Violates the Isotopy Conjecture.

White, N. L.

Access to full text
p. 1-2

Göttinger Digitalisierungszentrum
Geometric Optimization and Dp-Completeness.

Bajaj, C. ; Li, Ming

Access to full text
p. 3-14

Göttinger Digitalisierungszentrum
Note on Induced Subgraphs of the Unit Distance Graph En.

Maehara, H.

Access to full text
p. 15-18

Göttinger Digitalisierungszentrum
Finite Sphere Packing and Sphere Covering.

Wills, J.M. ; Tóth, Fejes G. ; Gritzmann, P.

Access to full text
p. 19-40

Göttinger Digitalisierungszentrum
Rectilinear Shortest Paths in the Presence of Rectangular Barriers.

Lee, D.T. ; Rezende, P.J. de ; Wu, Y.F.

Access to full text
p. 41-54

Göttinger Digitalisierungszentrum
Incidence-Polytopes with Toroidal Cells.

Weiss, A.I.

Access to full text
p. 55-74

Göttinger Digitalisierungszentrum
A Matroid on Hypergraphs, with Applications in Scene Analysis and Geometry.

Whiteley, W.

Access to full text
p. 75-95

Göttinger Digitalisierungszentrum
Uniform Oriented Matroids Without the Isotopy Property.

Sturmfels, Bernd ; White, Neil ; Jaggi, B. ; Mani-Levitska, Peter

Access to full text
p. 97-100

Göttinger Digitalisierungszentrum
An O(n log n) Algorithm for the All-Nearest-Neighbors Problem.

Vaidya, P.M.

Access to full text
p. 101-116

Göttinger Digitalisierungszentrum
Diameter-Extremal Subsets of Spheres.

Katz, M.

Access to full text
p. 117-138

Göttinger Digitalisierungszentrum
The Complexity of Cutting Complexes.

Chazelle, B. ; Edelsbrunner, Herbert ; J., Guibas Leonidas

Access to full text
p. 139-182

Göttinger Digitalisierungszentrum
Sphere-and-Point Incidence Relations in High Dimensions with Applications to Unit Distances and Furthest-Neighbor Pairs.

Chung, F.R.K.

Access to full text
p. 183-190

Göttinger Digitalisierungszentrum
Proof of Grünbaum's Conjecture on Common Transversals for Translates.

Tverberg, H.

Access to full text
p. 191-204

Göttinger Digitalisierungszentrum
An Algorithm for Reconstructing Convex Bodies from Their Projections.

Kölzow, D. ; Kuba, A. ; Volcic, A.

Access to full text
p. 205-238

Göttinger Digitalisierungszentrum
Cutting Disjoint Disks by Straight Lines.

Alon, N. ; Katchalski, M. ; Pulleyblank, W.R.

Access to full text
p. 239-244

Göttinger Digitalisierungszentrum
The Maximum Size of a Convex Polygon in a Restricted Set of Points in the Plane.

Alon, N. ; Katchalski, M. ; Pulleyblank, W.R.

Access to full text
p. 245-252

Göttinger Digitalisierungszentrum
Some Extremal Results on Circles Containing Points.

Wenger, Rephael ; Hayward, R. ; Rappaport, David

Access to full text
p. 253-258

Göttinger Digitalisierungszentrum
A Combinatorial Result About Points and Balls in Euclidean Space.

Bárány, I. ; Schmerl, J.H. ; Sidney, S.J. ; Urrutia, J.

Access to full text
p. 259-262

Göttinger Digitalisierungszentrum
A Note on the Circle Containment Problem.

Hayward, R.

Access to full text
p. 263-264

Göttinger Digitalisierungszentrum
On Separating Two Simple Polygons by a Single Translation.

Toussaint, G.

Access to full text
p. 265-278

Göttinger Digitalisierungszentrum
Helly-Type Theorems for Spheres.

Maehara, H.

Access to full text
p. 279-286

Göttinger Digitalisierungszentrum
Disjoint Edges in Geometric Graphs.

Erdös, P. ; Alon, N.

Access to full text
p. 287-290

Göttinger Digitalisierungszentrum
The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis.

Sharir, Micha ; Pach, Janos

Access to full text
p. 291-310

Göttinger Digitalisierungszentrum
The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.

Edelsbrunner, H. ; Sharir, Micha ; Guibas, Leonidas J.

Access to full text
p. 311-336

Göttinger Digitalisierungszentrum
The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces.

Edelsbrunner, H.

Access to full text
p. 337-344

Göttinger Digitalisierungszentrum
On Representing Sylvester-Gallai Designs.

Kelly, L.M. ; Boros, E. ; Füredi, Zoltan

Access to full text
p. 345-348

Göttinger Digitalisierungszentrum
Embeddings of Graphs in Euclidean Spaces.

Reiterman, J. ; Rödl, V ; Sinajová, E.

Access to full text
p. 349-364

Göttinger Digitalisierungszentrum
Complexes Whose Boundaries Cannot Be Pushed Around.

Bloch, E.D.

Access to full text
p. 365-374

Göttinger Digitalisierungszentrum
Dissections of Regular Polygons into Triangles of Equal Areas.

Kasimatis, E.A.

Access to full text
p. 375-382

Göttinger Digitalisierungszentrum
Editor's Foreword (Special Issue on the ACM Symposium).

Chazelle, B.

Access to full text
p. 383-386

Göttinger Digitalisierungszentrum
Applications of Random Sampling in Computational Geometry, II.

Clarkson, K.L. ; Shor, Peter W.

Access to full text
p. 387-422

Göttinger Digitalisierungszentrum
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon.

Tarjan, Robert E. ; Clarkson, K.L. ; Wyk, Christopher J. van

Access to full text
p. 423-432

Göttinger Digitalisierungszentrum
Implicitly Representing Arrangements of Lines or Segments.

Edelsbrunner, H. ; Seidel, Raimund ; Sharir, Micha ; Guibas, Leonidas ; Hershberger, John ; Snoeyink, Jack, Welzl, Emo

Access to full text
p. 433-466

Göttinger Digitalisierungszentrum
Quasi-Optimal Range Searching in Spaces of Finite VC-Dimension.

Chazelle, B. ; Welzl, Emo

Access to full text
p. 467-490

Göttinger Digitalisierungszentrum
On the General Motion-Planning Problem with Two Degrees of Freedom.

Guibas, L.J. ; Micha, Sharir ; Sifrony, Shmuel

Access to full text
p. 491-522

Göttinger Digitalisierungszentrum
On Arrangements of Jordan Arcs with Three Intersections per Pair.

Edelsbrunner, H. ; Seidel, Raimund ; Sharir, Micha ; Pollack, Richard ; Pach, Janos ; Guibas, Leonidas ; Hershberger, John ; Snoeyink, Jack

Access to full text
p. 523-540

Göttinger Digitalisierungszentrum
On the Graph of Large Distances.

Erdös, P. ; Lovász, L. ; Vesztergombi, K.

Access to full text
p. 541-550

Göttinger Digitalisierungszentrum
Visibility and Intersection Problems in Plane Geometry.

Chazelle, B. ; Guibas, Leonidas J.

Access to full text
p. 551-582

Göttinger Digitalisierungszentrum
A Geometric Realization Without Self-Intersections Does Exist for Dyck's Regular Map.

Bokowski, J.

Access to full text
p. 583-590

Göttinger Digitalisierungszentrum
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon.

Guibas, Leonidas J. ; Shor, Peter W. ; Aggarwal, A. ; Saxe, James

Access to full text
p. 591-604

Göttinger Digitalisierungszentrum
On the Ball Spanned by Balls.

Megiddo, N.

Access to full text
p. 605-610

Göttinger Digitalisierungszentrum
Computing the Geodesic Center of a Simple Polygon.

Pollack, R. ; Sharir, M. ; Rote, G.

Access to full text
p. 611-626

Göttinger Digitalisierungszentrum
Estimates for the Minimal Width of Polytopes Inscribed in Convex Bodies.

Gritzmann, P. ; Lassak, Marek

Access to full text
p. 627-635

Göttinger Digitalisierungszentrum