Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Discrete & computational geometry
Tome 11 (1994)
no. 3
Précédent
Suivant
Volume 11 (1994) no. 3
Sommaire
On the Complexity of a Single Cell in Certain Arrangements of Surfaces Related to Motion Planning.
D. Halperin
p. 1-34
Second Derivatives of Circle Packings and Conformai Mappings.
B. Rodin
;
Zheng-Xu He
;
P. Doyle
p. 35-50
The Rooted Tree Embedding Problem into Points in the Plane.
Y. Ikebe
;
M.A. Perles
;
A. Tamura
;
S. Tokunaga
p. 51-64
Computation of Period Matrices of Real Algebraic Curves*
Mika Seppälä
p. 65-82
Convex Representations of Maps on the Torus and Other Flat Surfaces.
Bojan Mohar
p. 83-96
On the Cayley Factorization of Calotte Conditions.
Tiong-Seng Tay
p. 97-110
A Postscript on Distances in Convex n-Gons.
P. Erdös
;
P. Fishburn
p. 111-120
Description of the Connected Components of a Semialgebraic Set in Single Exponential Time.
M.F. Roy
;
J. Heintz
;
P. Solernó
p. 121-140
Regular Simplices and Gaussian Samples.
Y.M. Baryshnikov
;
R.A. Vitale
p. 141-148
Lower Bounds for the Numbers of Antipodal Pairs and Strictly Antipodal Pairs of Vertices in a Convex Polytope.
V. Soltan
;
Mahn Hung Nguyen
p. 149-162
Approximating the Minimum Weight Steiner Triangulation.
D. Eppstein
p. 163-192
Higher-Order Rigidity ? What Is the Proper Definition?
R. Connelly
;
H. Servatius
p. 193-200
Residual Finiteness of Surface Groups via Tessellations.
L.M. Lopez
p. 201-212
Approximating Euclidean Distances by Small Degree Graphs*
José Soares
p. 213-234
Unit Squares Intersecting All Secants of a Square.
Pavel Valtr
p. 235-240
On the Expected Number of k-Sets.
I. Bárány
;
W. Steiger
p. 243-264
Computability and Complexity of Ray Tracing.
J.H. Reif
;
J.D. Tygar
;
A. Yoshida
p. 265-288
Simple Vertices of Maximal Minor Polytopes
Prakash Santhanakrishnan
;
Andrei Zelevinsky
p. 289-310
Mirror Property for Nonsingular Mixed Configurations of Lines and Points in R3 .
A. Borobia
p. 311-320
Iterated Nearest Neighbors and Finding Minimal Polytopes.
D. Eppstein
;
J. Erickson
p. 321-350
Gaps in the Numbers of Vertices of Cubical Polytopes, I.
R. Blind
;
G. Blind
p. 351-356
Cube-Tilings of Rn and Nonlinear Codes.
J.C. Lagarias
;
P.W. Shor
p. 359-392
On Range Searching with Semialgebraic Sets.
J. Matousek
;
P.K. Agarwal
p. 393-418
Approximation of Zonoids by Zonotopes in Fixed Directions.
W. Weil
;
S. Campi
;
D. Haas
p. 419-432
Algorithms for Ham Sandwich Cuts.
J. Matousek
;
W. Steiger
;
Chi-Yuan Lo
p. 433-452
Quotients of Polytopes and C-Groups.
E. Schulte
;
P. Mcmullen
p. 453-464
On Subdivisions of Simplicial Complexes: Characterizing Local h-Vectors.
C. Chan
p. 465-476