default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete & Computational Geometry, Volume 28
Volume 28, Number 1, 2002
- Marshall W. Bern, David Eppstein:
Multivariate Regression Depth. 1-17 - Akira Ushijima:
The Tilt Formula for Generalized Simplices in Hyperbolic Space. 19-27 - Christian Haase, Günter M. Ziegler:
Examples and Counterexamples for the Perles Conjecture. 29-44 - Jirí Matousek:
A Lower Bound for Weak epsilon-Nets in High Dimension. 45-48 - Ibrahim Kirat
, Ka-Sing Lau:
Classification of Integral Expanding Matrices and Self-Affine Tiles. 49-73 - Károly Bezdek:
Improving Rogers' Upper Bound for the Density of Unit Ball Packings via Estimating the Surface Area of Voronoi Cells from Below in Euclidean d-Space for All d>=8. 75-106 - Kurt M. Anstreicher:
Improved Linear Programming Bounds for Antipodal Spherical Codes. 107-114 - Gerd Blind, Roswitha Blind:
Packings of Unequal Circles in a Convex Set. 115-119
Volume 28, Number 2, 2002
- Pankaj K. Agarwal, Micha Sharir:
The Number of Congruent Simplices in a Point Set. 123-150 - Yi Hu:
Combinatorics and Quotients of Toric Varieties. 151-174 - Beifang Chen:
Lattice Points, Dedekind Sums, and Ehrhart Polynomials of Lattice Polyhedra. 175-199 - Andreas Brieden:
Geometric Optimization Problems Likely Not Contained in $$\mathbb{A}\mathbb{P}\mathbb{X}$$. 201-209 - Atsushi Kaneko, Mikio Kano:
Perfect Partitions of Convex Sets in the Plane. 211-222 - Ron Aharoni, Maria Chudnovsky, Andrei Kotlov:
Triangulated Spheres and Colored Cliques. 223-229 - Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint:
Flipturning Polygons. 231-253 - Apostolos Giannopoulos, Marianna Hartzoulak:
Random Spaces Generated by Vertices of the Cube. 255-273 - John Mackey:
A Cube Tiling of Dimension Eight with No Facesharing. 275-279
Volume 28, Number 3, 2002
- Patricia Hersh, Isabella Novik:
A Short Simplicial h-Vector and the Upper Bound Theorem. 283-289 - Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort:
Box-Trees and R-Trees with Near-Optimal Query Time. 291-312 - Serge Lawrencenko, Michael D. Plummer, Xiaoya Zha:
Isoperimetric Constants of Infinite Plane Graphs. 313-330 - A. Eremenko, Andrei Gabrielov:
Degrees of Real Wronski Maps. 331-347 - Asa Packer:
NP - Hardness of Largest Contained and Smallest Containing Simplices for V- and H-Polytopes. 349-377 - Tomás Kaiser:
Line Transversals to Unit Disks. 379-387 - Achill Schürmann:
On Extremal Finite Packings. 389-403 - Gábor Megyesi:
Configurations of 2n-2 Quadrics in Rn with 3 times 2n-1 Common Tangent Lines. 405-409 - Carlos Tomei, Tania Vieira:
The Kernel of the Adjacency Matrix of a Rectangular Mesh. 411-425 - Christian Richter:
Congruence by Dissection of Topological Discs - An Elementary Approach to Tarski's Circle Squaring Problem. 427-442
Volume 28, Number 4, 2002
- Farhad Shahrokhi, László A. Székely:
Guest Editors' Foreword. 447-448 - James Abello, Krishna Kumar:
Visibility Graphs and Oriented Matroids. 449-465 - Bernardo M. Ábrego, Silvia Fernández-Merchant:
The Unit Distance Problem for Centrally Symmetric Convex Polygons. 467-473 - Boris Aronov, Micha Sharir:
Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces. 475-490 - Aart Blokhuis, Ákos Seress:
The Number of Directions Determined by Points in the Three-Dimensional Euclidean Space. 491-494 - Peter Braß:
Combinatorial Geometry Problems in Pattern Recognition. 495-510 - Herbert Edelsbrunner, David Letscher, Afra Zomorodian:
Topological Persistence and Simplification. 511-533 - Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, Joseph S. B. Mitchell, T. M. Murali:
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping. 535-569 - Dan Ismailescu:
Restricted Point Configurations with Many Collinear {k}-Tuplets. 571-575 - Gyula Károlyi, József Solymosi:
Almost Disjoint Triangles in 3-Space. 577-583 - János Pach, Gábor Tardos:
Untangling a Polygon. 585-592 - János Pach, Géza Tóth:
Recognizing String Graphs Is Decidable. 593-606 - Rom Pinchasi:
Gallai - Sylvester Theorem for Pairwise Intersecting Unit Circles. 607-624 - Attila Pór, Pavel Valtr:
The Partitioned Version of the Erdös - Szekeres Theorem. 625-637 - József Solymosi, Gábor Tardos, Csaba D. Tóth:
The k Most Frequent Distances in the Plane. 639-648 - Konrad J. Swanepoel:
Independence Numbers of Planar Contact Graphs. 649-670 - Pavel Valtr:
A Sufficient Condition for the Existence of Large Empty Convex Polygons. 671-682
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 2026-05-12 22:56 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:
