7. Symposium on Computational Geometry 1991: North Conway, NH, USA

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

Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars:
Intersection Queries for Curved Objects (Extended Abstract). 41-50
Electronic Edition (ACM DL) BibTeX
Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson:
Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). 51-60
Electronic Edition (ACM DL) BibTeX
Yi-Jen Chiang, Roberto Tamassia:
Dynamization of the Trapezoid Method for Planar Point Location (Extended Abstract). 61-70
Electronic Edition (ACM DL) BibTeX
Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Ivan Stojmenovic, Godfried T. Toussaint, Jorge Urrutia:
Computing Shortest Transversals of Sets (Extended Abstract). 71-80
Electronic Edition (ACM DL) BibTeX
Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, Jean-Marc Robert:
Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract). 81-88
Electronic Edition (ACM DL) BibTeX

David Avis, Komei Fukuda:
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. 98-104
Electronic Edition (ACM DL) BibTeX
Boris Aronov, Joseph O'Rourke:
Nonoverlap of the Star Unfolding. 105-114
Electronic Edition (ACM DL) BibTeX
Ketan Mulmuley:
A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces. 115-120
Electronic Edition (ACM DL) BibTeX

Ketan Mulmuley:
Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract). 121-131
Electronic Edition (ACM DL) BibTeX
Ketan Mulmuley, Sandeep Sen:
Dynamic Point Location in Arrangements of Hyperplanes. 132-141
Electronic Edition (ACM DL) BibTeX
Franz Aurenhammer, Otfried Schwarzkopf:
A Simple On-Line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams. 142-151
Electronic Edition (ACM DL) BibTeX
Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan:
Randomized Parallel Algorithms for Trapezoidal Diagrams. 152-161
Electronic Edition (ACM DL) BibTeX

Antal Balog, Imre Bárány:
On the Convex Hull of the Integer Points in a Disc. 162-165
Electronic Edition (ACM DL) BibTeX
Christian Icking, Rolf Klein:
The Two Guards Problem. 166-175
Electronic Edition (ACM DL) BibTeX
Sivan Toledo:
Extremal Polygon Containment Problems. 176-185
Electronic Edition (ACM DL) BibTeX
Helmut Alt, Bernd Behrends, Johannes Blömer:
Approximate Matching of Polygonal Shapes (Extended Abstract). 186-193
Electronic Edition (ACM DL) BibTeX
Daniel P. Huttenlocher, Klara Kedem, Micha Sharir:
The Upper Envelope of Voronoi Surfaces and Its Applications. 194-203
Electronic Edition (ACM DL) BibTeX

Frank Morgan:
Minimal Surfaces, Crystals, and Norms on Rⁿ. 204-213
Electronic Edition (ACM DL) BibTeX

Barry Schaudt, Robert L. (Scot) Drysdale III:
Multiplicatively Weighted Crystal Growth Voronoi Diagrams (Extended Abstract). 214-223
Electronic Edition (ACM DL) BibTeX
Gordon T. Wilfong:
Nearest Neighbor Problems. 224-233
Electronic Edition (ACM DL) BibTeX
Matthew Dickerson, Robert L. (Scot) Drysdale III:
Enumerating k Distances for n Points in the Plane. 234-238
Electronic Edition (ACM DL) BibTeX

Clyde L. Monma, Subhash Suri:
Transitions in Geometric Minimum Spanning Trees (Extended Abstract). 239-249
Electronic Edition (ACM DL) BibTeX
Claire Kenyon, Richard Kenyon:
How to Take Short Cuts. 250-255
Electronic Edition (ACM DL) BibTeX
Jeffrey S. Salowe:
Construction of Multidimensional Spanner Graphs, with Applications to Minimum Spanning Trees. 256-261
Electronic Edition (ACM DL) BibTeX

Takeshi Tokuyama, Jun Nakano:
Geometric Algorithms for a Minimum Cost Assignment Problem. 262-271
Electronic Edition (ACM DL) BibTeX
Paola Bertolazzi, Giuseppe Di Battista:
On Upward Drawing Testing of Triconnected Digraphs (Extended Abstract). 272-280
Electronic Edition (ACM DL) BibTeX
Michael Formann, Frank Wagner:
A Packing Problem with Applications to Lettering of Maps. 281-288
Electronic Edition (ACM DL) BibTeX
Collette R. Coullard, Anna Lubiw:
Distance Visibility Graphs. 289-296
Electronic Edition (ACM DL) BibTeX

Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama:
Walking on an Arrangement Topologically. 297-306
Electronic Edition (ACM DL) BibTeX
Boris Aronov, Jirí Matousek, Micha Sharir:
On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. 307-313
Electronic Edition (ACM DL) BibTeX
Dan Halperin:
On the Complexity of a Single Cell in Certain Arrangements of Surfaces in 3-Space (Extended Abstract). 314-323
Electronic Edition (ACM DL) BibTeX
Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor:
Arrangements of Segments that Share Endpoints: Single Face Results. 324-333
Electronic Edition (ACM DL) BibTeX
Steven Fortune, Victor Milenkovic:
Numerical Stability of Algorithms for Line Arrangements. 334-341
Electronic Edition (ACM DL) BibTeX

Marshall W. Bern, David Eppstein:
Polynomial-Size Nonobtuse Triangulation of Polygons. 342-350
Electronic Edition (ACM DL) BibTeX
Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman:
Crossing Families. 351-356
Electronic Edition (ACM DL) BibTeX
V. T. Rajan:
Optimality of the Delaunay Triangulation in R^d. 357-363
Electronic Edition (ACM DL) BibTeX
Tamal K. Dey:
Triangulation and CSG Representation of Polyhedra with Arbitrary Genus. 364-371
Electronic Edition (ACM DL) BibTeX