Discrete & Computational Geometry, Volume 30

Volume 30, Number 1, May 2003

• David Eppstein:
  Guest Editor's Foreword. 1-2
  
• Csaba D. Tóth:
  A Note on Binary Plane Partitions. 3-16
  
• Timothy M. Chan:
  A Fully Dynamic Algorithm for Planar Width. 17-24
  
• Vladlen Koltun:
  Segment Intersection Searching Problems in General Settings. 25-44
  
• Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu:
  Discrete Mobile Centers. 45-63
  
• Saugata Basu:
  Different Bounds on the Different Betti Numbers of Semi-Algebraic Sets. 65-85
  
• Herbert Edelsbrunner, John Harer, Afra Zomorodian:
  Hierarchical Morse - Smale Complexes for Piecewise Linear 2-Manifolds. 87-107
  
• Jeff Erickson:
  Nice Point Sets Can Have Nasty Delaunay Triangulations. 109-132
  
• János Pach, Ido Safruti, Micha Sharir:
  The Union of Congruent Cubes in Three Dimensions. 133-160
  

Volume 30, Number 2, August 2003

• Gábor Fejes Tóth, Wlodzimierz Kuperberg:
  Guest Editors' Foreword. 165-166
  
• Imre Bárány, Krystyna Kuperberg, Tudor Zamfirescu:
  Total Curvature and Spiralling Shortest Paths. 167-176
  
• András Bezdek:
  Covering an Annulus by Strips. 177-180
  
• Károly Bezdek, Aart Blokhuis:
  The Radon Number of the Three-Dimensional Integer Lattice. 181-184
  
• Károly Böröczky:
  Finite packing and covering by congruent convex domains. 185-193
  
• Károly Böröczky, Balázs Csikós:
  Small convex polytopes with long edges and many vertices. 195-204
  
• Robert Connelly, Erik D. Demaine, Günter Rote:
  Blowing Up Polygonal Linkages. 205-239
  
• Aladár Heppes:
  Some Densest Two-Size Disc Packings in the Plane. 241-262
  
• Dan Ismailescu:
  Slicing the Pie. 263-276
  
• Gyula Károlyi, Pavel Valtr:
  Point Configurations in d-Space without Large Subsets in Convex Position. 277-286
  
• János Kincses:
  The Determination of a Convex Set from Its Angle Function. 287-297
  
• Stefan Langerman, William L. Steiger:
  The Complexity of Hyperplane Depth in the Plane. 299-309
  
• János Pach, József Solymosi, Géza Tóth:
  Unavoidable Configurations in Complete Topological Graphs. 311-320
  
• Attila Póor:
  A Partitioned Version of the Erdös-Szekeres Theorem for Quadrilaterals. 321-336
  
• József Solymosi:
  Note on Integral Distances. 337-342
  
• István Talata:
  A Volume Formual for Medial Sections of Simplices. 343-353
  

Volume 30, Number 3, September 2003

• Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan:
  Facility Location on a Polyhedral Surface. 357-372
  
• Richard Evan Schwartz:
  The Density of Shapes in Three-Dimensional Barycentric Subdivision. 373-377
  
• Tien-Yien Li, J. Maurice Rojas, Xiaoshen Wang:
  Counting Real Connected Components of Trinomial Curve Intersections and m-nomial Hypersurfaces. 379-414
  
• Rom Pinchasi:
  Lines With Many Points On Both Sides. 415-435
  
• Dominique Attali, Jean-Daniel Boissonnat:
  Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces. 437-452
  
• Olivier Devillers:
  The Number of Cylindrical Shells. 453-458
  
• Robert J. MacG. Dawson:
  An isosceles triangle that tiles the sphere in exactly three ways. 459-466
  
• Robert J. MacG. Dawson:
  Tilings of the Sphere with Isosceles Triangles. 467-487
  
• Csaba D. Tóth:
  Illuminating Disjoint Line Segments in the Plane. 489-505
  

Volume 30, Number 4, October 2003

• David Orden, Francisco Santos:
  Asymptotically Efficient Triangulations of the d-Cube. 509-528
  
• Helena A. Jorge:
  Combinatorics of Polytopes with a Group of Linear Symmetries of Prime Power Order. 529-542
  
• Gábor Megyesi, Frank Sottile, Thorsten Theobald:
  Common Transversals and Tangents to Two Lines and Two Quadrics in P. 543-571
  
• Michael Baake, Uwe Grimm:
  A Note on Shelling. 573-589
  
• Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki:
  Spanning Trees Crossing Few Barriers. 591-606
  
• Floris Geerts:
  Expressing the box cone radius in the relational calculus with real polynomial constraints. 607-622
  
• Matthias Beck, Dennis Pixton:
  The Ehrhart Polynomial of the Birkhoff Polytope. 623-637
  
• Stefan Langerman:
  On the Complexity of Halfspace Area Queries. 639-648
  
• Tom Richardson, Larry A. Shepp:
  The "Point" Goalie Problem. 649-669
  

Last update Tue Feb 14 04:16:50 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page