default search action
Discrete & Computational Geometry, Volume 21
Volume 21, Number 1, 1999
- Anders Björner, Svante Linusson:
The Number of k -Faces of a Simple d -Polytope. 1-16 - Dominique Schmitt, Jean-Claude Spehner:
Angular Properties of Delaunay Diagrams in Any Dimension. 17-36 - Meir Katchalski, D. Nashtir:
A Helly Type Conjecture. 37-43 - Ivan Sterling, Thomas Sterling:
Approximating Planar Rotations. 45-56 - David Bremner:
Incremental Convex Hull Algorithms Are Not Output Sensitive. 57-68 - R. J. Gardner, Alessandro Soranzo, Aljosa Volcic:
On the Determination of Star and Convex Bodies by Section Functions. 69-85 - Herbert Edelsbrunner:
Deformable Smooth Surface Design. 87-115 - Christos A. Athanasiadis:
Piles of Cubes, Monotone Path Polytopes, and Hyperplane Arrangements. 117-130 - Jesús A. De Loera, Francisco Santos, Jorge Urrutia:
The Number of Geometric Bistellar Neighbors of a Triangulation. 131-142 - Peter G. Boyvalenkov, Danyo Danev, Svetla Nikova:
Nonexistence of Certain Spherical Designs of Odd Strengths and Cardinalities. 143-156
Volume 21, Number 2, 1999
- J. C. Lagarias:
Geometric Models for Quasicrystals I. Delone Sets of Finite Type. 161-191 - Pavel Valtr:
On Galleries with No Bad Points. 193-200 - Hidefumi Ohsugi, Takayuki Hibi:
A Normal (0, 1)-Polytope None of Whose Regular Triangulations Is Unimodular. 201-204 - Robert T. Firla, Günter M. Ziegler:
Hilbert Bases, Unimodular Triangulations, and Binary Covers of Rational Polyhedral Cones. 205-216 - Sariel Har-Peled:
Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions. 217-231 - David G. Larman, Chuanming Zong:
On the Kissing Numbers of Some Special Convex Bodies. 233-242 - Kokichi Sugihara:
Resolvable Representation of Polyhedra. 243-255 - L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem:
Geometric Pattern Matching in d -Dimensional Space. 257-274 - Tomás Kaiser, Yuri Rabinovich:
Intersection Properties of Families of Convex (n, d)-Bodies. 275-287 - Michael I. Hartley:
All Polytopes Are Quotients, and Isomorphic Polytopes Are Quotients by Conjugate Subgroups. 289-298 - Olaf Delgado-Friedrichs, Daniel H. Huson:
Tiling Space by Platonic Solids, I. 299-315
Volume 21, Number 3, 1999
- János Pach, Micha Sharir:
On the Boundary of the Union of Planar Convex Sets. 321-328 - Dima Grigoriev:
Randomized Complexity Lower Bound for Arrangements and Polyhedra. 329-344 - J. C. Lagarias:
Geometric Models for Quasicrystals II. Local Rules Under Isometries. 345-372 - Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. 373-388 - Richard Ehrenborg, Margaret A. Readdy:
On Flag Vectors, the Dowling Lattice, and Braid Arrangements. 389-403 - Francis Y. L. Chin, Jack Snoeyink, Cao An Wang:
Finding the Medial Axis of a Simple Polygon in Linear Time. 405-420 - Károly J. Böröczky, Uwe Schnell:
Quasicrystals and the Wulff-Shape. 421-436 - Konrad J. Swanepoel:
Vertex Degrees of Steiner Minimal Trees in lpd and Other Smooth Minkowski Spaces. 437-447 - Marek Lassak:
Parallelotopes of Maximum Volume in a Simplex. 449-462 - Andrew Vince:
Self-Replicating Tiles and Their Boundary. 463-476
Volume 21, Number 4, 1999
- Konstantin A. Rybnikov:
Stresses and Liftings of Cell-Complexes. 481-517 - Gerd Blind, Roswitha Blind:
Shellings and the Lower Bound Theorem. 519-526 - Boris Aronov, Steven Fortune:
Approximating Minimum-Weight Triangulations in Three Dimensions. 527-549 - Henry Schenck:
Subalgebras of the Stanley - Reisner Ring. 551-556 - Bernhard von Stengel:
New Maximal Numbers of Equilibria in Bimatrix Games. 557-568 - T. Michiels, Jan Verschelde:
Enumerating Regular Mixed-Cell Configurations. 569-579 - Raquel Díaz:
A Characterization of Gram Matrices of Polytopes. 581-601 - Atsushi Kaneko, Mikio Kano:
Straight-Line Embeddings of Two Rooted Trees in the Plane. 603-613 - Kevin Keating, Andrew Vince:
Isohedral Polyomino Tiling of the Plane. 615-630
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.