PPN362609810, Tome 7 (1992)

Sommaire

The Number of Different Distances Determined by a Set of Points in the Euclidean Plane.

Chung, F.R.K. ; Szemeredi, E. ; Trotter, W.T.

Access to full text

p. 1-12

Göttinger Digitalisierungszentrum

Aperiodic Tiles.

Shephard, G.C. ; Ammann, R. ; Grünbaum, B

Access to full text

p. 1-26

Göttinger Digitalisierungszentrum

Classes of Graphs Which Approximate the Complete Euclidean Graph.

Keil, J.M. ; Gutwin, C.A.

Access to full text

p. 13-28

Göttinger Digitalisierungszentrum

A New Step in the Solution of the Szökefalvi-Nagy Problem.

Boltyanski, V.G.

Access to full text

p. 27-50

Göttinger Digitalisierungszentrum

Solid Circle-Packings in the Euclidean Plane.

Heppes, A.

Access to full text

p. 29-44

Göttinger Digitalisierungszentrum

Finding Minimum Area k-gons.

Eppstein, D. ; Overmars, M. ; Rote, G ; Woeginger, G.

Access to full text

p. 45-58

Göttinger Digitalisierungszentrum

Applications of Random Sampling to On-Line Algorithms in Computational Geometry.

Schott, R. ; Boissonnat, J.D. ; Devillers, O. ; Teillaud, M.

Access to full text

p. 51-72

Göttinger Digitalisierungszentrum

The Euler Characteristic is the Unique Locally Determined Numerical Homotopy Invariant of Finite Complexes.

Levitt, N.

Access to full text

p. 59-68

Göttinger Digitalisierungszentrum

Motions of a Short-Linked Robot Arm in a Square.

Kantabutra, V.

Access to full text

p. 69-76

Göttinger Digitalisierungszentrum

Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions.

Yvinec, M.

Access to full text

p. 73-92

Göttinger Digitalisierungszentrum

The Steiner Ratio Conjecture for Cocircular Points.

Rubinstein, J.H. ; Thomas, D.A.

Access to full text

p. 77-86

Göttinger Digitalisierungszentrum

On a Generalization of the Gallai-Sylvester Theorem.

Kupitz, Y.S.

Access to full text

p. 87-104

Göttinger Digitalisierungszentrum

Neighborly Maps with Few Vertices.

Snyder, T. L.

Access to full text

p. 93-104

Göttinger Digitalisierungszentrum

On the Covering Multiplicity of Lattices.

Access to full text

p. 109-130

Göttinger Digitalisierungszentrum

An Upper Bound on the Number of Planar K-Sets.

Pach, J. ; Szemeredi, E. ; Steiger, W.

Access to full text

p. 109-124

Göttinger Digitalisierungszentrum

Ammann Bars and Quasicrystals.

Stehling, T.

Access to full text

p. 125-134

Göttinger Digitalisierungszentrum

An O (n log n) Algorithm for Computing the Link Center of a Simple Polygon.

Conway, J.H. ; Sloane, N.J.A.

Access to full text

p. 131-152

Göttinger Digitalisierungszentrum

Convex Independent Sets and 7-Holes in Restricted Planar Point Sets.

Valtr, P.

Access to full text

p. 135-152

Göttinger Digitalisierungszentrum

Nonuniqueness Results for X-Ray Problems with Point Sources.

Djidjev, H.N. ; Lingas, A. ; Sack, J.R.

Access to full text

p. 153-170

Göttinger Digitalisierungszentrum

The Worm Problem of Leo Moser.

Norwood, R. ; Poole, G. ; Laidacker, M.

Access to full text

p. 153-162

Göttinger Digitalisierungszentrum

Almost Tight Bounds for e-Nets.

Woeginger, G. ; Komlós, J. ; Pach, J

Access to full text

p. 163-174

Göttinger Digitalisierungszentrum

Self-Packing of Centrally Symmetric Convex Bodies in R2 .

Brehm, U.

Access to full text

p. 171-190

Göttinger Digitalisierungszentrum

Tiling Polygons with Parallelograms.

Kannan, S. ; Soroker, D.

Access to full text

p. 175-188

Göttinger Digitalisierungszentrum

Separating Convex Sets in the Plane.

Urrutia, J. ; Czyzowicz, J. ; Rivera-Campo, E. ; Zaks, J.

Access to full text

p. 189-196

Göttinger Digitalisierungszentrum

Finding Stabbing Lines in 3-Space.

Lagarias, J.C. ; Doyle, P.G. ; Randall, D.

Access to full text

p. 191-208

Göttinger Digitalisierungszentrum

The Different Ways of Stabbing Disjoint Convex Sets.

Katchalski, M. ; Lewis, T. ; Liu, A.

Access to full text

p. 197-206

Göttinger Digitalisierungszentrum

Shelling Pseudopolyhedra.

Goossens, P.

Access to full text

p. 207-216

Göttinger Digitalisierungszentrum

On the Average Number of k-Sets.

Pellegrini, M. ; Shor, P.W.

Access to full text

p. 209-214

Göttinger Digitalisierungszentrum

Guest Editor's Foreword.

Access to full text

p. 217-218

Göttinger Digitalisierungszentrum

Nonoverlap of the Star Unfolding.

Edelsbrunner, H.

Access to full text

p. 219-250

Göttinger Digitalisierungszentrum

Random Projections of Regular Simplices.

Schneider, R. ; Affentranger, F.

Access to full text

p. 219-226

Göttinger Digitalisierungszentrum

On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra.

Seidel, R. ; Ruppert, J.

Access to full text

p. 227-254

Göttinger Digitalisierungszentrum

How To Take Short Cuts.

O'Rourke, J. ; Aronov, B.

Access to full text

p. 251-264

Göttinger Digitalisierungszentrum

Inner and Outer j-Radii of Convex Bodies in Finite-Dimensional Normed Spaces.

Klee, V. ; Gritzmann, P.

Access to full text

p. 255-280

Göttinger Digitalisierungszentrum

Transitions in Geometric Minimum Spanning Trees.

Kenyon, R. ; Kenyon, C.

Access to full text

p. 265-294

Göttinger Digitalisierungszentrum

X-Rays of Polygons.

Gardner, R.J.

Access to full text

p. 281-294

Göttinger Digitalisierungszentrum

Quantitative Steinitz's Theorems with Applications to Multifingered Grasping.

Kirkpatrick, D. ; Mishra, B. ; Yap, Chee-Keng

Access to full text

p. 295-318

Göttinger Digitalisierungszentrum

A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.

Suri, S. ; Monma, C.

Access to full text

p. 295-314

Göttinger Digitalisierungszentrum

Efficient Partition Trees.

Avis, D. ; Fukuda, K.

Access to full text

p. 315-334

Göttinger Digitalisierungszentrum

The Generic Contact of Convex Bodies with Circumscribed Homothets of a Convex Surface.

Zucco, A.

Access to full text

p. 319-324

Göttinger Digitalisierungszentrum

Polygon Triangulation in O(n log log n) Time with Simple Data Structures.

Kirkpatrick, D.G. ; Klawe, M.M. ; Tarjan, R.E.

Access to full text

p. 329-346

Göttinger Digitalisierungszentrum

Dynamic Point Location in Arrangements of Hyperplanes.

Matousek, J.

Access to full text

p. 335-360

Göttinger Digitalisierungszentrum

The Classification of Quasi-Regular Polyhedra of Genus 2.

Franz, R. ; Huson, D.

Access to full text

p. 347-358

Göttinger Digitalisierungszentrum

Counting Facets and Incidences.

Agarwal, P.K. ; Aronov, B.

Access to full text

p. 359-370

Göttinger Digitalisierungszentrum

Upper Bounds for the Diameter and Height of Graphs of Convex Polyhedra.

Mulmuley, K. ; Sen, S.

Access to full text

p. 363-372

Göttinger Digitalisierungszentrum

The Maximum Number of Second Smallest Distances in Finite Planar Sets.

Brass, P.

Access to full text

p. 371-380

Göttinger Digitalisierungszentrum

A Bounded Compactness Theorem for L1-Embeddability of Metric Spaces in the Plane.

Kalai, G.

Access to full text

p. 373-386

Göttinger Digitalisierungszentrum

Area Requirement and Symmetry Display of Planar Upward Drawings.

Tamassia, R. ; Battista, G. di ; Toms, I.G.

Access to full text

p. 381-402

Göttinger Digitalisierungszentrum

A Cone of Inhomogeneous Second-Order Polynomials.

Malitz, S.M. ; Malitz, J.I.

Access to full text

p. 387-416

Göttinger Digitalisierungszentrum

Spectra of Regular Polytopes.

Saldanha, N.C. ; Tomei, C.

Access to full text

p. 403-414

Göttinger Digitalisierungszentrum

Maintaining the Minimal Distance of a Point Set in Poly-logarithmic Time.

Smid, M.

Access to full text

p. 415-432

Göttinger Digitalisierungszentrum

Subdivision Algorithms and the Kernel of a Polyhedron.

Erdahl, R.

Access to full text

p. 417-428

Göttinger Digitalisierungszentrum

Circle Packings and Polyhedral Surfaces.

Gardner, R.J. ; Kallay, M.

Access to full text

p. 429-440

Göttinger Digitalisierungszentrum

Alternative Proof of Sine's Theorem on the Size of a Regular Polygon in Rn with the l...-Metric.

Blokhuis, A. ; Wilbrink, H.A.

Access to full text

p. 433-434

Göttinger Digitalisierungszentrum