default search action
Discrete & Computational Geometry, Volume 33
Volume 33, Number 1, January 2005
- Jacob E. Goodman, Richard Pollack:
Editorial Note. 1 - Imre Bárány, Jirí Matousek:
The Randomized Integer Convex Hull. 3-25 - Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor:
Some Low Distortion Metric Ramsey Problems. 27-41 - René Brandenberg:
Radii of Regular Polytopes. 43-55 - John Gates, Daniel Hug, Rolf Schneider:
Valuations on Convex Sets of Oriented Hyperplanes. 57-65 - Olaf Delgado-Friedrichs:
Equilibrium Placement of Periodic Graphs and Convexity of Plane Tilings. 67-81 - Jeff Erickson:
Dense Point Sets Have Sparse Delaunay Triangulations or "... But Not Too Nasty". 83-115 - Geoffrey Exoo:
epsilon-Unit Distance Graphs. 117-123 - Christian Buchta:
An Identity Relating Moments of Functionals of Convex Hulls. 125-142 - Jean-Louis Verger-Gaugry:
Covering a Ball with Smaller Equal Balls in Rn. 143-155 - Johan Huisman:
The Space of Unordered Real Line Arrangements. 157-163 - Károly J. Böröczky:
Finite Coverings in the Hyperbolic Plane. 165-180
Volume 33, Number 2, February 2005
- Boris Aronov, Vladlen Koltun, Micha Sharir:
Incidences between Points and Circles in Three and Higher Dimensions. 185-206 - Jean-Marc Schlenker:
A Rigidity Criterion for Non-Convex Polyhedra. 207-221 - Daniel J. Kleitman, Rom Pinchasi:
A Note on Caterpillar-Embeddings with No Two Parallel Edges. 223-229 - Boris Aronov, Vladlen Koltun, Micha Sharir:
Cutting Triangular Cycles of Lines in Space. 231-247 - Afra Zomorodian, Gunnar E. Carlsson:
Computing Persistent Homology. 249-274 - David Orden, Francisco Santos:
The Polytope of Non-Crossing Graphs on a Planar Point Set. 275-305 - Sharona Feldman, Micha Sharir:
An Improved Bound for Joints in Arrangements of Lines in Space. 307-320 - Huaming Zhang, Xin He:
Canonical Ordering Trees and Their Applications in Graph Drawing. 321-344 - Bettina Speckmann, Csaba D. Tóth:
Allocating Vertex pi-Guards in Simple Polygons via Pseudo-Triangulations. 345-364
Volume 33, Number 3, March 2005
- Lu Ting, Joseph B. Keller:
Extremal Convex Planar Sets. 369-393 - Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
Betti Numbers of Semialgebraic Sets Defined by Quantifier-Free Formulae. 395-401 - Li Xiaoyan, Gangsong Leng:
The Mixed Volume of Two Finite Vector Sets. 403-421 - Thierry Zell:
Topology of Definable Hausdorff Limits. 423-443 - Jim Lawrence:
Oriented Matroids and Associated Valuations. 445-462 - Pankaj K. Agarwal, Robert-Paul Berretty, Anne D. Collins:
A Near-Quadratic Algorithm for Fence Design. 463-481 - Nicolae Strungaru:
Almost Periodic Measures and Long-Range Order in Meyer Sets. 483-505 - Éric Colin de Verdière, Francis Lazarus:
Optimal System of Loops on an Orientable Surface. 507-534 - Caroline J. Klivans:
Obstructions to Shiftedness. 535-545
Volume 33, Number 4, April 2005
- Robert Connelly:
Generic Global Rigidity. 549-563 - Hiroshi Nagamochi:
An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings. 569-591 - David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint:
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. 593-604 - Valeriu Soltan:
Pairs of Convex Bodies with Centrally Symmetric Intersections of Translates. 605-616 - Gábor Megyesi, Frank Sottile:
The Envelope of Lines Meeting a Fixed Line and Tangent to Two Spheres. 617-644 - Jürgen Bokowski, Simon King, Susanne Mock, Ileana Streinu:
The Topological Representation of Oriented Matroids. 645-668 - Adam Bliss, Francis Edward Su:
Lower Bounds for Simplicial Covers and Triangulations of Cubes. 669-686 - Adrian Dumitrescu:
Monotone Paths in Line Arrangements with a Small Number of Directions. 687-697 - Daniel Hug, Erwin Lutwak, Deane Yang, Gaoyong Zhang:
On the Lp Minkowski Problem for Polytopes. 699-715 - Stefan Langerman, Pat Morin:
Covering Things with Things. 717-729
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.