default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete & Computational Geometry, Volume 11
Volume 11, 1994
- Dan Halperin:
On the Complexity of a Single Cell in Certain Arrangement of Surfaces Related to Motion Planning. 1-33 - Peter Doyle, Zheng-Xu He, Burt Rodin:
Second Derivatives of Circle Packing and Conformal Mapping. 35-49 - Yoshiko Ikebe, Micha A. Perles, Akihisa Tamura, Shinnichi Tokunaga:
The Rooted Tree Embedding Problem into Points in the Plane. 51-63 - Mika Seppälä:
Computation of Peirod Matrices of Real Algebraic Curves. 65-81 - Bojan Mohar:
Convex Representations of Maps on the Torus and Other Flat Surfaces. 83-95 - Tiong-Seng Tay:
On the Cayley Factorization of Calotte Conditions. 97-109 - Paul Erdös, Peter C. Fishburn:
A Postscript on Distances in Convex n-Gons. 111-117 - Joos Heintz, Marie-Françoise Roy, Pablo Solernó:
Description of the Connected Components of a Semialgebraic in Single Exponential Time. 121-140 - Yuliy M. Baryshnikov
, Richard A. Vitale:
Regular Simplices and Gaussian Samples. 141-147 - 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 - David Eppstein:
Approximating the Minimum Weight Steiner Triangulation. 163-191 - Robert Connelly, Herman Servatius:
Higher-Order Rigidity - What Is the Proper Definition. 193-200 - L. M. Lopez:
Residual Finiteness of Surface Groups via Tessellations. 201-211 - José Soares:
Approximating Euclidean Distances by Small Degree Graphs. 213-233 - Pavel Valtr:
Unit Squares Intersecting All Secants of a Square. 235-239 - Imre Bárány, William L. Steiger:
On the Expected Number of k-Sets. 243-263 - John H. Reif, J. D. Tygar, Akitoshi Yoshida:
Computability and Complexity of Ray Tracing. 265-287 - Prakash Santhanakrishnan, Andrei Zelevinsky:
Simple Vertices of Maximal Minor Polytopes. 289-309 - Alberto Borobia:
Mirror Property for Nonsingular Mixed Configurations of Lines and Points in R3. 311-320 - David Eppstein, Jeff Erickson:
Iterated Nearest Neighbors and Finding Minimal Polytopes. 321-350 - Gerd Blind, Roswitha Blind:
Gaps in the Numbers of Vertices of Cubical Polytopes, I. 351-356 - J. C. Lagarias, Peter W. Shor:
Cube-Tilings of Rn and Nonlinear Codes. 359-391 - Pankaj K. Agarwal, Jirí Matousek:
On Range Searching with Semialgebraic Sets. 393-418 - Stefano Campi, Dieter Haas, Wolfgang Weil:
Approximation of Zonoids by Zonotopes in Fixed Directions. 419-431 - Chi-Yuan Lo, Jirí Matousek, William L. Steiger:
Algorithms for Ham-Sandwich Cuts. 433-452 - Peter McMullen, Egon Schulte:
Quotients of Polytopes and C-Groups. 453-464 - Clara S. Chan:
On Subdivisions of Simplicial Complexes: Characterizing Local h-Vectors. 465-476
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.
last updated on 2025-06-13 18:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
