Proceedings of the Seventh Annual Symposium on Computational Geometry, June 10-12, 1991, North Conway, NH. ACM Press, 1991, ISBN 0-89791-426-0
Session 1
Session 2
Session 3:
Invited Lecture
Session 4
David Avis,
Komei Fukuda:
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.
98-104
Ketan Mulmuley:
A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces.
115-120
Session 5
Ketan Mulmuley:
Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract).
121-131
Session 6
Sivan Toledo:
Extremal Polygon Containment Problems.
176-185
Session 7:
Invited Lecture
Frank Morgan:
Minimal Surfaces, Crystals, and Norms on Rn.
204-213
Session 8
Session 9
Jeffrey S. Salowe:
Construction of Multidimensional Spanner Graphs, with Applications to Minimum Spanning Trees.
256-261
Session 10
Session 11
Dan Halperin:
On the Complexity of a Single Cell in Certain Arrangements of Surfaces in 3-Space (Extended Abstract).
314-323
Session 12
V. T. Rajan:
Optimality of the Delaunay Triangulation in Rd.
357-363
Tamal K. Dey:
Triangulation and CSG Representation of Polyhedra with Arbitrary Genus.
364-371
data released under the ODC-BY 1.0 license
