default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete & Computational Geometry, Volume 23
Volume 23, Number 1, 2000
- Paul H. Edelman, Victor Reiner
:
Counting the Interior Points of a Point Configuration. 1-13 - Francisco Santos:
Triangulations with Very Few Geometric Bistellar Neighbors. 15-33 - Imre Bárány, Günter Rote, William L. Steiger, Cun-Hui Zhang:
A Central Limit Theorem for Convex Chains in the Square. 35-50 - Bernd Carl, David E. Edmunds:
Coverings of Convex Sets and Volume Inequalities. 51-71 - Sándor P. Fekete:
On Simple Polygonalizations with Optimal Area. 73-110 - Kalle Karu:
Semistable Reduction in Characteristic Zero for Families of Surfaces and Threefolds. 111-120 - Stefan Felsner, Helmut Weil:
A Theorem on Higher Bruhat Orders. 121-127 - Bernardo M. Ábrego, Silvia Fernández-Merchant:
On the Maximum Number of Equilateral Triangles, I. 129-135 - Mark Rudelson:
Sections of the Difference Body. 137-146 - Jaroslaw K. Cel:
A Condition for Sets in R3 to be Cones. 147-154
Volume 23, Number 2, 2000
- Yossi Lonke:
On Random Sections of the Cube. 157-169 - Alon Efrat, Micha Sharir:
On the Complexity of the Union of Fat Convex Objects in the Plane. 171-189 - Grant Cairns, Yury Nikolayevsky:
Bounds for Generalized Thrackles. 191-206 - Leonid Khachiyan, Lorant Porkolab:
Integer Optimization on Convex Semialgebraic Sets. 207-224 - A. Florian, Aladár Heppes:
Solid Coverings of the Euclidean Plane with Incongruent Circles. 225-245 - Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir:
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd. 247-259 - Richard Ehrenborg, D. Johnston, Rajmohan Rajagopalan, Margaret A. Readdy:
Cutting Polytopes and Flag f-Vectors. 261-271 - Pankaj K. Agarwal, Kasturi R. Varadarajan:
Efficient Algorithms for Approximating Polygonal Chains. 273-291 - Isabella Novik:
A Note on Geometric Embeddings of Simplicial Complexes in a Euclidean Space. 293-302
Volume 23, Number 3, 2000
- Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng:
Regression Depth and Center Points. 305-323 - Edwin H. Smith:
A Bound on the Ratio between the Packing and Covering Densities of a Convex Body. 325-331 - Marco Bonetti, Richard A. Vitale:
Asymptotic Behavior of a Set-Statistic. 333-365 - Rex A. Dwyer:
Voronoi Diagrams and Convex Hulls of Random Moving Points. 343-365 - T. Michiels, Ronald Cools:
Decomposing the Secondary Cayley Polytope. 367-380 - María A. Hernández Cifre, S. Segura Gomis:
The Missing Boundaries of the Santaló Diagrams for the Cases (d, w, R) and (w, R, r). 381-388 - Sándor P. Fekete, Henk Meijer:
On Minimum Stars and Maximum Matchings. 389-407 - Jean-Marc Schlenker:
Dihedral Angles of Convex Polyhedra. 409-417 - B. Draco, Lorenzo Sadun, D. Van Wieren:
Growth Rates in the Quaquaversal Tiling. 419-435 - Yin-Feng Xu, Jichang Ye, Binhai Zhu:
Computing the Degree-4 Shortest Network under a Given Topology. 437-448
Volume 23, Number 4, 2000
- John H. Conway, Charles Radin, Lorenzo Sadun:
Relations in SO (3) Supported by Geodetic Angles. 453-463 - Alain Daurat, Alberto Del Lungo, Maurice Nivat:
Medians of Discrete Sets according to a Linear Distance. 465-484 - Robin Forman:
The Euler Characteristic Is the Unique Locally Determined Numerical Invariant of Finite Simplicial Complexes which Assigns the Same Number to Every Cone. 485-488 - M. Azaola, Francisco Santos:
The Graph of Triangulations of a Point Configuration with d +4 Vertices Is 3-Connected. 489-536 - Mihail N. Kolountzakis:
On the Structure of Multiple Translational Tilings by Polygonal Regions. 537-553 - Ghislain Dartois, Alain Grigis:
Separating Maps of the Lattice E8 and Triangulations of the Eight-Dimensional Torus. 555-567
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 2024-09-18 00:04 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:
