default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete & Computational Geometry, Volume 42
Volume 42, Number 1, July 2009
- Jeff Erickson:
Guest Editor's Foreword. 1-2 - Peyman Afshani, Timothy M. Chan:
On Approximate Range Counting and Depth. 3-21 - Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister:
Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently. 22-36 - Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve Oudot
:
Manifold Reconstruction in Arbitrary Dimensions Using Witness Complexes. 37-70 - Gunnar E. Carlsson, Afra Zomorodian:
The Theory of Multidimensional Persistence. 71-93 - Hazel Everett, Daniel Lazard, Sylvain Lazard, Mohab Safey El Din:
The Voronoi Diagram of Three Lines. 94-130
Volume 42, Number 2, September 2009
- Peter Gritzmann, Bernd Sturmfels, Günter M. Ziegler:
Guest Editors' Foreword. 131 - Hayri Ardal, Ján Manuch, Moshe Rosenfeld, Saharon Shelah, Ladislav Stacho:
The Odd-Distance Plane Graph. 132-141 - Jorge L. Arocha, Imre Bárány, Javier Bracho, Ruy Fabila-Monroy, Luis Montejano:
Very Colorful Theorems. 142-154 - Christos A. Athanasiadis:
On the Graph Connectivity of Skeleta of Convex Polytopes. 155-165 - Gennadiy Averkov, Martin Henk:
Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities. 166-186 - Jan Foniok, Komei Fukuda, Bernd Gärtner, Hans-Jakob Lüthi:
Pivoting in Linear Complementarity: Two Polynomial-Time Cases. 187-205 - Jim Lawrence, Walter D. Morris Jr.:
Finite Sets as Complements of Finite Unions of Convex Sets. 206-218 - Jirí Matousek:
Blocking Visibility for Points in General Position. 219-223 - Peter McMullen:
Regular Apeirotopes of Dimension and Rank 4. 224-260 - Isabella Novik, Ed Swartz:
Applications of Klee's Dehn-Sommerville Relations. 261-276 - Micha A. Perles, Horst Martini, Yaakov S. Kupitz:
A Jordan-Brouwer Separation Theorem for Polyhedral Pseudomanifolds. 277-304 - Jürgen Richter-Gebert, Peter Lebmeir:
Diagrams, Tensors and Geometric Reasoning. 305-334 - Konrad J. Swanepoel:
Simultaneous Packing and Covering in Sequence Spaces. 335-340
Volume 42, Number 3, October 2009
- Monique Teillaud:
Guest Editor's Foreword. 341-342 - Radoslav Fulek, Andreas F. Holmsen, János Pach:
Intersecting Convex Sets by Rays. 343-358 - Jinhee Chun, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama:
Consistent Digital Rays. 359-378 - Julien Demouth, Olivier Devillers, Marc Glisse, Xavier Goaoc:
Helly-Type Theorems for Approximate Covering. 379-398 - Bernard Chazelle, Wolfgang Mulzer:
Markov Incremental Constructions. 399-420 - Noga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi, Bettina Speckmann, Philipp Zumstein:
Polychromatic Colorings of Plane Graphs. 421-442 - Naoki Katoh, Shin-ichi Tanigawa:
Fast Enumeration Algorithms for Non-crossing Geometric Graphs. 443-468 - Timothy M. Chan:
Dynamic Coresets. 469-488 - Luca Castelli Aleardi, Éric Fusy, Thomas Lewiner:
Schnyder Woods for Higher Genus Triangulated Surfaces, with Applications to Encoding. 489-516
Volume 42, Number 4, December 2009
- Jirí Matousek:
Removing Degeneracy in LP-Type Problems Revisited. 517-526 - Thilo Rörig, Nikolaus Witte, Günter M. Ziegler:
Zonotopes with Large 2D-Cuts. 527-541 - Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff:
Untangling a Planar Graph. 542-569 - Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood:
A Polynomial Bound for Untangling Geometric Planar Graphs. 570-585 - Anders Björner, Martin Tancer:
Note: Combinatorial Alexander Duality - A Short and Elementary Proof. 586-593 - Michael Langberg, Leonard J. Schulman:
Contraction and Expansion of Convex Sets. 594-614 - Nir Ailon, Edo Liberty:
Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes. 615-630 - Jirí Matousek, Martin Tancer:
Dimension Gaps between Representability and Collapsibility. 631-639 - Xianglin Wei, Ren Ding:
More on an Erdos-Szekeres-Type Problem for Interior Points. 640-653 - Efi Fogel, Dan Halperin, Christophe Weibel:
On the Exact Maximum Complexity of Minkowski Sums of Polytopes. 654-669 - Jesús A. De Loera, David C. Haws, Matthias Köppe:
Ehrhart Polynomials of Matroid Polytopes and Polymatroids. 670-702 - Jesús A. De Loera, David C. Haws, Matthias Köppe:
Ehrhart Polynomials of Matroid Polytopes and Polymatroids. 703-704 - Gábor Hetyei:
Delannoy Orthants of Legendre Polytopes. 705-721 - María del Carmen Moure:
A Framework for the Construction of Self-replicating Tilings. 722-739 - Christian Huck:
Uniqueness in Discrete Tomography of Delone Sets with Long-Range Order. 740-758 - Jérôme Hulin, Edouard Thiel:
Visible Vectors and Discrete Euclidean Medial Axis. 759-773
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-06-10 22:54 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:
