Conferences in DBLP
Jirí Matousek Efficient Partition Trees. [Citation Graph (1, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Micha Sharir Counting Circular Arc Intersections. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Dan Halperin , Mark H. Overmars , Jack Snoeyink , Marc J. van Kreveld Efficient Ray Shooting and Hidden Surface Removal. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew J. Katz , Mark H. Overmars , Micha Sharir Efficient Hidden Surface Removal for Objects with small Union Size. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Marc J. van Kreveld , Mark H. Overmars Intersection Queries for Curved Objects (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Marc J. van Kreveld , Bengt J. Nilsson Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Yi-Jen Chiang , Roberto Tamassia Dynamization of the Trapezoid Method for Planar Point Location (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Binay K. Bhattacharya , Jurek Czyzowicz , Peter Egyed , Ivan Stojmenovic , Godfried T. Toussaint , Jorge Urrutia Computing Shortest Transversals of Sets (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Binay K. Bhattacharya , Shreesh Jadhav , Asish Mukhopadhyay , Jean-Marc Robert Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] H. S. M. Coxeter Orthogonal Trees. [Citation Graph (0, 0)][DBLP ] Conf ] David Avis , Komei Fukuda A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Joseph O'Rourke Nonoverlap of the Star Unfolding. [Citation Graph (0, 0)][DBLP ] Conf ] Ketan Mulmuley A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Ketan Mulmuley Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Ketan Mulmuley , Sandeep Sen Dynamic Point Location in Arrangements of Hyperplanes. [Citation Graph (0, 0)][DBLP ] Conf ] Franz Aurenhammer , Otfried Schwarzkopf A Simple On-Line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Kenneth L. Clarkson , Richard Cole , Robert Endre Tarjan Randomized Parallel Algorithms for Trapezoidal Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Antal Balog , Imre Bárány On the Convex Hull of the Integer Points in a Disc. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Icking , Rolf Klein The Two Guards Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Sivan Toledo Extremal Polygon Containment Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Helmut Alt , Bernd Behrends , Johannes Blömer Approximate Matching of Polygonal Shapes (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Daniel P. Huttenlocher , Klara Kedem , Micha Sharir The Upper Envelope of Voronoi Surfaces and Its Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Morgan Minimal Surfaces, Crystals, and Norms on Rn . [Citation Graph (0, 0)][DBLP ] Conf ] Barry Schaudt , Robert L. (Scot) Drysdale III Multiplicatively Weighted Crystal Growth Voronoi Diagrams (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Gordon T. Wilfong Nearest Neighbor Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Dickerson , Robert L. (Scot) Drysdale III Enumerating k Distances for n Points in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Clyde L. Monma , Subhash Suri Transitions in Geometric Minimum Spanning Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Claire Kenyon , Richard Kenyon How to Take Short Cuts. [Citation Graph (0, 0)][DBLP ] Conf ] Jeffrey S. Salowe Construction of Multidimensional Spanner Graphs, with Applications to Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Takeshi Tokuyama , Jun Nakano Geometric Algorithms for a Minimum Cost Assignment Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Paola Bertolazzi , Giuseppe Di Battista On Upward Drawing Testing of Triconnected Digraphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Michael Formann , Frank Wagner A Packing Problem with Applications to Lettering of Maps. [Citation Graph (0, 0)][DBLP ] Conf ] Collette R. Coullard , Anna Lubiw Distance Visibility Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Tetsuo Asano , Leonidas J. Guibas , Takeshi Tokuyama Walking on an Arrangement Topologically. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Jirí Matousek , Micha Sharir On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] Dan Halperin On the Complexity of a Single Cell in Certain Arrangements of Surfaces in 3-Space (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Esther M. Arkin , Dan Halperin , Klara Kedem , Joseph S. B. Mitchell , Nir Naor Arrangements of Segments that Share Endpoints: Single Face Results. [Citation Graph (0, 0)][DBLP ] Conf ] Steven Fortune , Victor Milenkovic Numerical Stability of Algorithms for Line Arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] Marshall W. Bern , David Eppstein Polynomial-Size Nonobtuse Triangulation of Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Paul Erdös , Wayne Goddard , Daniel J. Kleitman , Michael Klugerman , János Pach , Leonard J. Schulman Crossing Families. [Citation Graph (0, 0)][DBLP ] Conf ] V. T. Rajan Optimality of the Delaunay Triangulation in Rd . [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey Triangulation and CSG Representation of Polyhedra with Arbitrary Genus. [Citation Graph (0, 0)][DBLP ] Conf ] 