Geodesic

Tome 12 (1994) no. 1

Sommaire

Some Geometric Applications of Dilworth's Theorem.
p. 1-8
Special Representations for n-Bridge Links.
p. 9-28
On the Number of Minimal 1-Steiner Trees.
p. 29-34
Computing the Ehrhart Polynomial of a Convex Lattice Polytope.
p. 35-48
Free Arrangements and Relation Spaces.
p. 49-64
A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons.
p. 65-82
On-Line Covering a Cube by a Sequence of Cubes.
p. 83-90
Camera Placement in Integer Lattices.
p. 91-104
The Asymptotic Value of the Circle-Packing Rigidity Constants sn .
p. 105-116
Castles in the Air Revisited.
p. 119-150
On the Number of Views of Polyhedral Terrains.
p. 177-182
An Example Concerning the Translative Kissing Number of a Convex Body.
p. 183-188
Optimality of the Delaunay Triangulation in Rd .
p. 189-202
On Lines Missing Polyhedral Sets in 3-Space.
p. 203-222
Areas of Polygons Inscribed in a Circle.
p. 223-236
Helly-Type Theorems and Generalized Linear Programming.
p. 241-262
Finding a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property and Applications.
p. 263-280
Counting Triangle Crossings and Halving Planes.
p. 281-290
Computing a Centerpoint of a Finite Planar Set of Points in Linear Time.
p. 291-312
New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains.
p. 313-326
Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions.
p. 327-346
Can Visibility Graphs Be Represented Compactly?.
p. 347-366
Objects that Cannot Be Taken Apart with Two Hands.
p. 367-384
On the Exact Constant in the Quantitative Steinitz Theorem in the Plane.
p. 387-398
Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements.
p. 399-432
On-Line Covering the Unit Cube by Cubes.
p. 433-438
Generalized Breadths, Circular Cantor Sets, and the Least Area UCC .
p. 439-450
An Algorithm To Compute Odd Orders and Ramification Indices of Cyclic Actions on Compact Surfaces.
p. 451-464
A Decomposition of 2-Weak Vertex-Packing Polytopes.
p. 465-479