default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7th SCG 1991: North Conway, NH, USA
- Robert L. Scot Drysdale:
Proceedings of the Seventh Annual Symposium on Computational Geometry, North Conway, NH, USA, , June 10-12, 1991. ACM 1991, ISBN 0-89791-426-0
Session 1
- Jirí Matousek:
Efficient Partition Trees. 1-9 - Pankaj K. Agarwal, Micha Sharir:
Counting Circular Arc Intersections. 10-20 - Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld:
Efficient Ray Shooting and Hidden Surface Removal. 21-30 - Matthew J. Katz, Mark H. Overmars, Micha Sharir:
Efficient Hidden Surface Removal for Objects with small Union Size. 31-40
Session 2
- Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars:
Intersection Queries for Curved Objects (Extended Abstract). 41-50 - Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson:
Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). 51-60 - Yi-Jen Chiang, Roberto Tamassia:
Dynamization of the Trapezoid Method for Planar Point Location (Extended Abstract). 61-70 - Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Ivan Stojmenovic, Godfried T. Toussaint, Jorge Urrutia:
Computing Shortest Transversals of Sets (Extended Abstract). 71-80 - Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, Jean-Marc Robert:
Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract). 81-88
Session 3: Invited Lecture
- H. S. M. Coxeter:
Orthogonal Trees. 89-97
Session 4
- David Avis, Komei Fukuda:
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. 98-104 - Boris Aronov
, Joseph O'Rourke:
Nonoverlap of the Star Unfolding. 105-114 - 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 - Ketan Mulmuley, Sandeep Sen:
Dynamic Point Location in Arrangements of Hyperplanes. 132-141 - Franz Aurenhammer, Otfried Schwarzkopf:
A Simple On-Line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams. 142-151 - Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan:
Randomized Parallel Algorithms for Trapezoidal Diagrams. 152-161
Session 6
- Antal Balog, Imre Bárány:
On the Convex Hull of the Integer Points in a Disc. 162-165 - Christian Icking, Rolf Klein:
The Two Guards Problem. 166-175 - Sivan Toledo:
Extremal Polygon Containment Problems. 176-185 - Helmut Alt, Bernd Behrends, Johannes Blömer:
Approximate Matching of Polygonal Shapes (Extended Abstract). 186-193 - Daniel P. Huttenlocher, Klara Kedem, Micha Sharir:
The Upper Envelope of Voronoi Surfaces and Its Applications. 194-203
Session 7: Invited Lecture
- Frank Morgan:
Minimal Surfaces, Crystals, and Norms on Rn. 204-213
Session 8
- Barry Schaudt, Robert L. (Scot) Drysdale III:
Multiplicatively Weighted Crystal Growth Voronoi Diagrams (Extended Abstract). 214-223 - Gordon T. Wilfong:
Nearest Neighbor Problems. 224-233 - Matthew Dickerson, Robert L. (Scot) Drysdale III:
Enumerating k Distances for n Points in the Plane. 234-238
Session 9
- Clyde L. Monma, Subhash Suri:
Transitions in Geometric Minimum Spanning Trees (Extended Abstract). 239-249 - Claire Kenyon, Richard W. Kenyon:
How to Take Short Cuts. 250-255 - Jeffrey S. Salowe:
Construction of Multidimensional Spanner Graphs, with Applications to Minimum Spanning Trees. 256-261
Session 10
- Takeshi Tokuyama, Jun Nakano:
Geometric Algorithms for a Minimum Cost Assignment Problem. 262-271 - Paola Bertolazzi, Giuseppe Di Battista:
On Upward Drawing Testing of Triconnected Digraphs (Extended Abstract). 272-280 - Michael Formann, Frank Wagner:
A Packing Problem with Applications to Lettering of Maps. 281-288 - Collette R. Coullard, Anna Lubiw:
Distance Visibility Graphs. 289-296
Session 11
- Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama:
Walking on an Arrangement Topologically. 297-306 - Boris Aronov, Jirí Matousek, Micha Sharir:
On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. 307-313 - Dan Halperin:
On the Complexity of a Single Cell in Certain Arrangements of Surfaces in 3-Space (Extended Abstract). 314-323 - Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor:
Arrangements of Segments that Share Endpoints: Single Face Results. 324-333 - Steven Fortune, Victor Milenkovic:
Numerical Stability of Algorithms for Line Arrangements. 334-341
Session 12
- Marshall W. Bern, David Eppstein:
Polynomial-Size Nonobtuse Triangulation of Polygons. 342-350 - Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman:
Crossing Families. 351-356 - 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
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 2025-12-02 23:31 CET 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:
