

Stop the war!
Остановите войну!
for scientists:


default search action
Discrete & Computational Geometry, Volume 6
Volume 6, 1991
- Marek Lassak, Jixian Zhang:

An On-line Potato-Sack Theorem. 1-7
- Wei-pang Chin, Simeon C. Ntafos:

Shortest Watchman Routes in Simple Polygons. 9-31
- Margaret M. Bayer, Andrew Klapper:

A New Index for Polytopes. 33-47
- Michael E. Houle:

Theorems on the Existence of Separating Surfaces. 49-56
- Hiroshi Maehara:

Dispersed Points and Geometric Embedding of Complete Bipartite Graphs. 57-67
- R. S. Booth:

Analytic Formulas for Full Steiner Trees. 69-82
- Horst Martini:

Convex Polytopes Whose Projection Bodies and Difference Set Are Polars. 83-91
- Zoltán Füredi:

The Densest Packing of Equal Circles into a Parallel Strip. 95-106
- Louis J. Billera, Lauren L. Rose:

A Dimension Series for Multivariate Splines. 107-128
- Jirí Matousek:

Lower Bounds on the Length of Monotone Paths in Arrangement. 129-134
- Colin Adams, William Sherman:

Minimum Ideal Triangulations of Hyperbolic 3-Manifolds. 135-153
- Ralph Kopperman, Paul R. Meyer, Richard G. Wilson:

A Jordan Surface Theorem for Three-Dimensional Digital Spaces. 155-161
- Gilbert Stengel:

Constraints on the Angular Distribution of the Zeros of a Polynomial of Low Complexity. 163-169
- Tudor Zamfirescu:

On Two Conjectures of Franz Hering about Convex Surfaces. 171-180
- Peter Schmitt:

Disks with Special Properties of Densest Packings. 181-190
- Riccardo Benedetti, François Loeser

, Jean-Jacques Risler:
Bounding the Number of Connected Components of a Real Algebraic Set. 191-209
- Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing:

On the Construction of Abstract Voronoi Diagrams. 211-224
- Jean E. Taylor:

On the Global Structure of Crystalline Surfaces. 225-262
- Lee R. Nackman, Vijay Srinivasan:

Bisectors of Linearly Separable Sets. 263-275
- András Bezdek, Wlodzimierz Kuperberg, E. Makai:

Maximum Density Space Packing with Parallel Strings of Spheres. 277-283
- Mark D. Haiman:

A Simple and Relatively Efficient Triangulation of the n-Cube. 287-289
- Fernando Affentranger, John A. Wieacker:

On the Convex Hull of Uniform Randowm Points in a Simple d-polytope. 291-305
- Ketan Mulmuley:

On Levels in Arrangement and Voronoi Diagrams. 307-338
- Hiroshi Maehara:

On Graver's Conjecture Concerning the Rigidity Problem of Graphs. 339-342
- Rex A. Dwyer:

Higher-Dimensional Voronoi Diagrams in Linear Expected Time. 343-367
- Pravin M. Vaidya:

A sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions. 369-381
- Jirí Matousek:

Cutting Hyperplane Arrangements. 385-406
- Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf:

Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. 407-422
- Raimund Seidel:

Small-Dimensional Linear Programming and Convex Hulls Made Easy. 423-434
- Boris Aronov

, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger:
Points and Triangles in the Plane and Halving Planes in Space. 435-442
- Daniel Bienstock:

Some Provably Hard Crossing Number Problems. 443-459
- John F. Canny, Ashutosh Rege, John H. Reif:

An Exact Algorithm for Kinodynamic Planning in the Plane. 461-484
- Bernard Chazelle:

Triangulating a Simple Polygon in Linear Time. 485-524
- Alexander Schrijver:

Disjoint Homotopic Paths and Trees in a Planar Graph. 527-574
- Danièle Beauquier, Maurice Nivat:

On Translating One Polyomino to Tile the Plane. 575-592
- Micha Sharir:

On k-Sets in Arrangement of Curves and Surfaces. 593-613

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.

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID
















