default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th SCG 1992: Berlin, Germany
- David Avis:
Proceedings of the Eighth Annual Symposium on Computational Geometry, Berlin, Germany, June 10-12, 1992. ACM 1992, ISBN 0-89791-517-8
Session 1
- Jirí Matousek, Micha Sharir, Emo Welzl:
A Subexponential Bound for Linear Programming. 1-8 - Martin E. Dyer
:
A Class of Convex Programs with Applications to Computational Geometry. 9-15 - Jirí Matousek, Otfried Schwarzkopf:
Linear Optimization Queries. 16-25 - Günter Rote:
Degenerate Convex Hulls in High Dimensions without Extra Storage. 26-32
Session 2
- John Hershberger:
Optimal Parallel Algorithms for Triangulated Simple Polygons. 33-42 - Herbert Edelsbrunner, Nimish R. Shah:
Incremental Topological Flipping Works for Regular Triangulations. 43-52 - Herbert Edelsbrunner, Tiow Seng Tan:
An Upper Bound for Conforming Delaunay Triangulations. 53-62 - Danny Z. Chen:
An Optimal Parallel Algorithm for Detecting Weak Visibility of a Simple Polygon. 63-72
Session 3
- Azriel Rosenfeld:
Digital Geometry (Abstract). SCG 1992: 73 - Ioannis Z. Emiris, John F. Canny:
An Efficient Approach to Removing Geometric Degeneracies. 74-82 - Steven Fortune:
Numerical Stability of Algorithms for 2D Delaunay Triangulations. 83-92
Session 4
- Paul J. Heffernan, Stefan Schirra:
Approximate Decision Algorithms for Point Set Congruence. 93-101 - Helmut Alt, Michael Godau:
Measuring the Resemblance of Polygonal Curves. 102-109 - Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg:
On Dynamic Voronoi Diagrams and the Minimum Hausdorff Distance for Point Sets Under Euclidean Motion in the Plane. 110-119
Session 5
- Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
Diameter, Width, Closest Line Pair, and Parametric Searching. 120-129 - Marco Pellegrini:
Incidence and Nearest-Neighbor Problems for Lines in 3-Space. 130-137 - Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf:
Computing and Verifying Depth Orders. 138-145 - Boris Aronov, Micha Sharir:
Castles in the Air Revisited. 146-156
Session 6
- Noga Alon, Daniel J. Kleitman:
Piercing Convex Sets. 157-160 - Alexander I. Barvinok:
Computing the Volume, Counting Integral Points, and Exponential Sums. 161-170 - Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu:
There is a Universal Topological Plane. 171-176 - Michael B. Dillencourt, Warren D. Smith:
A Linear-Time Algorithm for Testing the Inscribability of Trivalent Polyhedra. 177-185
Session 7
- Jeffrey S. Salowe:
On Euclidean Spanner Graphs with Small Degree. 186-191 - Barun Chandra, Gautam Das, Giri Narasimhan, José Soares:
New Sparseness Results on Graph Spanners. 192-201
Session 8
- Elefterios A. Melissaratos, Diane L. Souvaine:
Coping with Inconsistencies: A New Approach to Produce Quality Triangulations of Polygonal Domains with Holes. 202-211 - Scott A. Mitchell, Stephen A. Vavasis:
Quality Mesh Generation in Three Dimensions. 212-221 - Marshall W. Bern, David P. Dobkin, David Eppstein:
Triangulating Polygons without Large Angles. 222-231
Session 9
- Y. B. Karasik, Micha Sharir:
Optical Computational Geometry. 232-241 - Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata:
Stable Placements for Spider Robots. 242-250 - John F. Canny, Bruce Randall Donald, Eugene K. Ressler:
A Rational Rotation Method for Robust Geometric Algorithms. 251-260 - Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis, Paola Bertolazzi:
A Framework for Dynamic Graph Drawing. 261-270
Session 10
- Hervé Brönnimann, Bernard Chazelle:
How Hard is Halfspace Range Searching? 271-275 - Jirí Matousek:
Range Searching with Efficient Hierarchical Cuttings. 276-285 - Otfried Schwarzkopf:
Ray Shooting in Convex Polytopes. 286-295 - Valeriu Soltan, Alexei Gorpinevich:
Minimum Dissection of Rectilinear Polygon with Arbitrary Holes into Rectangles. 296-302
Session 11
- David M. Mount:
Intersection Detection and Separators for Simple Polygons. 303-311 - Rolf Klein, Andrzej Lingas:
Manhattonian Proximity in a Simple Polygon. 312-319 - Naoki Katoh, Kazuo Iwano:
Finding k Farthest Pairs and k Closest/Farthest Bichromatic Pairs for Points in the Plane. 320-329 - Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink:
An Optimal Algorithm for the On-Line Closest-Pair Problem. 330-336
Session 12
- Noga Alon, Yossi Azar:
On-Line Steiner Trees in the Euclidean Plane. 337-343 - Timothy Law Snyder, J. Michael Steele:
A Priori Inequalities for the Euclidean Traveling Salesman. 344-349 - Franz Aurenhammer, Friedrich Hoffmann, Boris Aronov:
Minkowski-Type Theorems and Least-Squares Partitioning. 350-357 - Haijo Schipper:
Determining Contractibility of Curves. 358-367
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-01 23:19 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:
