default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete & Computational Geometry, Volume 26
Volume 26, Number 1, 2001
- I. G. MacDonald, János Pach, Thorsten Theobald:
Common Tangents to Four Unit Balls in R3. 1-17 - Sariel Har-Peled
, Micha Sharir:
Online Point Location in Planar Arrangements and Its Applications. 19-40 - Frank Gao, Richard A. Vitale:
Intrinsic Volumes of the Brownian Motion Body. 41-50 - Peter Braß, Günter Rote, Konrad J. Swanepoel:
Triangles of Extremal Area or Perimeter in a Finite Planar Point Set. 51-58 - Károly Böröczky Jr.:
Edge Close Ball Packings. 59-71 - Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki:
Grid Drawings of 4-Connected Plane Graphs. 73-87 - Shuhong Gao, Alan G. B. Lauder:
Decomposition of Polytopes and Polynomials. 89-104 - D. Lam, D. C. Solmon:
Reconstructing Convex Polygons in the Plane from One Directed X-Ray. 105-146 - Oleg Ogievetsky, Zorka Papadopolos:
On Quasiperiodic Space Tilings, Inflation, and Dehn Invariants. 147-171 - Johan Håstad, Svante Linusson, Johan Wästlund:
A Smaller Sleeping Bag for a Baby Snake. 173-181
Volume 26, Number 2, 2001
- Pankaj K. Agarwal:
Guest Editor's Foreword. 185-186 - Géza Tóth:
Point Sets with Many k-Sets. 187-194 - Micha Sharir, Shakhar Smorodinsky, Gábor Tardos:
An Improved Bound for k-Sets in Three Dimensions. 195-204 - Uli Wagner, Emo Welzl:
A Continuous Analogue of the Upper Bound Theorem. 205-219 - Bernard Chazelle, Alexey Lvov:
A Trace Bound for the Hereditary Discrepancy. 221-231 - Edgar A. Ramos:
An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set. 233-244 - Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos:
A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time. 245-265
Volume 26, Number 3, 2001
- Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
Locked and Unlocked Polygonal Chains in Three Dimensions. 269-281 - Jirí Matousek:
Lower Bounds on the Transversal Numbers of d-Intervals. 283-287 - N. Priebe, Boris Solomyak:
Characterization of Planar Pseudo-Self-Similar Tilings. 289-306 - Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. 307-320 - A. Repp:
Bounded Valence Excess and the Parabolicity of Tilings. 321-351 - Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach:
Maintaining the Extent of a Moving Point Set. 353-374 - Sylvain Gravier, Charles Payan:
On the Pentomino Exclusion Problem. 375-386 - Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint:
Every Set of Disjoint Line Segments Admits a Binary Tree. 387-410 - David Damanik, Daniel Lenz:
Linear Repetitivity, I. Uniform Subadditive Ergodic Theorems and Applications. 411-428 - Basudeb Datta, Nandini Nilakantan:
Equivelar Polyhedra with Few Vertices. 429-461
Volume 26, Number 4, 2001
- Noga Alon, Hagit Last, Rom Pinchasi, Micha Sharir:
On the Complexity of Arrangements of Circles in the Plane. 465-492 - Gábor Megyesi:
Lines Tangent to Four Unit Spheres with Coplanar Centres. 493-497 - Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang:
Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes. 499-511 - Geoffrey C. Shephard:
Cyclic Product Theorems for Polygons (II) Constructions using Conic Sections. 513-526 - Vladimir G. Boltyanski:
Solution of the Illumination Problem for Bodies with md M=2. 527-541 - Matthew J. Katz, Kasturi R. Varadarajan:
A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects in Rd. 543-548 - Olaf Delgado-Friedrichs:
Recognition of Flat Orbifolds and the Classification of Tilings in R3. 549-571 - Cristopher Moore, J. M. Robson:
Hard Tiling Problems with Simple Tiles. 573-590 - Christoph Bandt, Yang Wang:
Disk-Like Self-Affine Tiles in R2. 591-601 - Leah Wrenn Berman:
A Characterization of Astral (n4) Configurations. 603-612
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:
