Geodesic

Tome 5 (1990) no. 2

Sommaire

Penny-Packing and Two-Dimensional Codes.
p. 1-12
Geometry of the Gass-Saaty Parametric Cost LP Algorithm.
p. 13-26
Upper Bounds on Geometric Permutations for Convex Sets.
p. 27-34
The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n - 2*.
p. 35-42
An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-Dimensional Polygonal Space.
p. 43-76
On a Problem About Covering Lines by Squares.
p. 77-82
Combinatorial Geometries Representable over GF(3) and GF(q). I. The Number of Points.
p. 83-95
Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.
p. 99-160
The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.
p. 161-196
The Complexity of Many Cells in Arrangements of Planes and Related Problems.
p. 197-216
An Inequality for the Volume of Inscribed Ellipsoids.
p. 219-222
Reconstructing Plane Sets from Projections.
p. 223-242
A New Duality Result Concerning Voronoi Diagrams.
p. 243-254
On the Existence of Certain Smooth Toric Varieties.
p. 255-262
Hyperplane Arrangements with a Lattice of Regions.
p. 263-288
Computing Simple Circuits from a Set of Line Segments.
p. 289-304
Exterior Algebra and Projections of Polytopes.
p. 305-322
Countable Decompositions of R2 and R3 .
p. 325-332
Nonrealizability Proofs in Computational Geometry.
p. 333-350
Diameter and Radius in the Manhattan Metric.
p. 351-356
On Convex Bodies that Permit Packings of High Density.
p. 357-364
A New Approach to the Dynamic Maintenance of Maximal Points in a Plane.
p. 365-374
A Combinatorial Property of Points and Ellipsoids.
p. 375-382
A Generalization of Hadwiger's Transversal Theorem to Intersecting Sets.
p. 383-388
Double-Lattice Packings of Convex Bodies in the Plane.
p. 389-398
Delaunay Graphs Are Almost as Good as Complete Graphs.
p. 399-408
On the Modality of Convex Polygons.
p. 409-420
Construction of e-Nets.
p. 427-448
Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.
p. 449-484
Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling.
p. 485-504
Triangulating a Nonconvex Polytope.
p. 505-526
Convex Disks Can Cover Their Shadow.
p. 529-532
Partitioning Arrangements of Lines, II: Applications.
p. 533-574
Toughness and Delaunay Triangulations.
p. 575-602
Wv Paths on the Torus.
p. 603-608