Volume 11,
1994
- Dan Halperin:
On the Complexity of a Single Cell in Certain Arrangement of Surfaces Related to Motion Planning.
1-33 BibTeX
- Peter Doyle, Zheng-Xu He, Burt Rodin:
Second Derivatives of Circle Packing and Conformal Mapping.
35-49 BibTeX
- Yoshiko Ikebe, Micha A. Perles, Akihisa Tamura, Shinnichi Tokunaga:
The Rooted Tree Embedding Problem into Points in the Plane.
51-63 BibTeX
- Mika Seppälä:
Computation of Peirod Matrices of Real Algebraic Curves.
65-81 BibTeX
- Bojan Mohar:
Convex Representations of Maps on the Torus and Other Flat Surfaces.
83-95 BibTeX
- Tiong-Seng Tay:
On the Cayley Factorization of Calotte Conditions.
97-109 BibTeX
- Paul Erdös, Peter C. Fishburn:
A Postscript on Distances in Convex n-Gons.
111-117 BibTeX
- Joos Heintz, Marie-Françoise Roy, Pablo Solernó:
Description of the Connected Components of a Semialgebraic in Single Exponential Time.
121-140 BibTeX
- Yuliy M. Baryshnikov, Richard A. Vitale:
Regular Simplices and Gaussian Samples.
141-147 BibTeX
- Mahn Hung Nguyên, Valeriu Soltan:
Lower Bounds for the Numbers of Antipodal Pairs and Strictly Antipodal Pairs of Vertices in a Convex Polytope.
149-162 BibTeX
- David Eppstein:
Approximating the Minimum Weight Steiner Triangulation.
163-191 BibTeX
- Robert Connelly, Herman Servatius:
Higher-Order Rigidity - What Is the Proper Definition.
193-200 BibTeX
- L. M. Lopez:
Residual Finiteness of Surface Groups via Tessellations.
201-211 BibTeX
- José Soares:
Approximating Euclidean Distances by Small Degree Graphs.
213-233 BibTeX
- Pavel Valtr:
Unit Squares Intersecting All Secants of a Square.
235-239 BibTeX
- Imre Bárány, William L. Steiger:
On the Expected Number of k-Sets.
243-263 BibTeX
- John H. Reif, J. D. Tygar, Akitoshi Yoshida:
Computability and Complexity of Ray Tracing.
265-287 BibTeX
- Prakash Santhanakrishnan, Andrei Zelevinsky:
Simple Vertices of Maximal Minor Polytopes.
289-309 BibTeX
- Alberto Borobia:
Mirror Property for Nonsingular Mixed Configurations of Lines and Points in R3.
311-320 BibTeX
- David Eppstein, Jeff Erickson:
Iterated Nearest Neighbors and Finding Minimal Polytopes.
321-350 BibTeX
- Gerd Blind, Roswitha Blind:
Gaps in the Numbers of Vertices of Cubical Polytopes, I.
351-356 BibTeX
- J. C. Lagarias, Peter W. Shor:
Cube-Tilings of Rn and Nonlinear Codes.
359-391 BibTeX
- Pankaj K. Agarwal, Jirí Matousek:
On Range Searching with Semialgebraic Sets.
393-418 BibTeX
- S. Campi, D. Haas, W. Weil:
Approximation of Zonoids by Zonotopes in Fixed Directions.
419-431 BibTeX
- Chi-Yuan Lo, Jirí Matousek, William L. Steiger:
Algorithms for Ham-Sandwich Cuts.
433-452 BibTeX
- Peter McMullen, E. Schulte:
Quotients of Polytopes and C-Groups.
453-464 BibTeX
- C. Chan:
On Subdivisions of Simplicial Complexes: Characterizing Local h-Vectors.
465-476 BibTeX
Copyright © Sat May 16 23:56:31 2009
by Michael Ley (ley@uni-trier.de)