Conferences in DBLP
Jirí Matousek , Micha Sharir , Emo Welzl A Subexponential Bound for Linear Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Martin E. Dyer A Class of Convex Programs with Applications to Computational Geometry. [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Matousek , Otfried Schwarzkopf Linear Optimization Queries. [Citation Graph (1, 0)][DBLP ] Conf ] Günter Rote Degenerate Convex Hulls in High Dimensions without Extra Storage. [Citation Graph (0, 0)][DBLP ] Conf ] John Hershberger Optimal Parallel Algorithms for Triangulated Simple Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Herbert Edelsbrunner , Nimish R. Shah Incremental Topological Flipping Works for Regular Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Herbert Edelsbrunner , Tiow Seng Tan An Upper Bound for Conforming Delaunay Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen An Optimal Parallel Algorithm for Detecting Weak Visibility of a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Azriel Rosenfeld Digital Geometry (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Ioannis Z. Emiris , John F. Canny An Efficient Approach to Removing Geometric Degeneracies. [Citation Graph (0, 0)][DBLP ] Conf ] Steven Fortune Numerical Stability of Algorithms for 2D Delaunay Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Paul J. Heffernan , Stefan Schirra Approximate Decision Algorithms for Point Set Congruence. [Citation Graph (0, 0)][DBLP ] Conf ] Helmut Alt , Michael Godau Measuring the Resemblance of Polygonal Curves. [Citation Graph (0, 0)][DBLP ] Conf ] 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. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , Herbert Edelsbrunner , Leonidas J. Guibas , Micha Sharir Diameter, Width, Closest Line Pair, and Parametric Searching. [Citation Graph (0, 0)][DBLP ] Conf ] Marco Pellegrini Incidence and Nearest-Neighbor Problems for Lines in 3-Space. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Mark H. Overmars , Otfried Schwarzkopf Computing and Verifying Depth Orders. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Micha Sharir Castles in the Air Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Daniel J. Kleitman Piercing Convex Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander I. Barvinok Computing the Volume, Counting Integral Points, and Exponential Sums. [Citation Graph (0, 0)][DBLP ] Conf ] Jacob E. Goodman , Richard Pollack , Rephael Wenger , Tudor Zamfirescu There is a Universal Topological Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Michael B. Dillencourt , Warren D. Smith A Linear-Time Algorithm for Testing the Inscribability of Trivalent Polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Jeffrey S. Salowe On Euclidean Spanner Graphs with Small Degree. [Citation Graph (0, 0)][DBLP ] Conf ] Barun Chandra , Gautam Das , Giri Narasimhan , José Soares New Sparseness Results on Graph Spanners. [Citation Graph (0, 0)][DBLP ] Conf ] Elefterios A. Melissaratos , Diane L. Souvaine Coping with Inconsistencies: A New Approach to Produce Quality Triangulations of Polygonal Domains with Holes. [Citation Graph (0, 0)][DBLP ] Conf ] Scott A. Mitchell , Stephen A. Vavasis Quality Mesh Generation in Three Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Marshall W. Bern , David P. Dobkin , David Eppstein Triangulating Polygons without Large Angles. [Citation Graph (0, 0)][DBLP ] Conf ] Y. B. Karasik , Micha Sharir Optical Computational Geometry. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Daniel Boissonnat , Olivier Devillers , LeonBattista Donati , Franco P. Preparata Stable Placements for Spider Robots. [Citation Graph (0, 0)][DBLP ] Conf ] John F. Canny , Bruce Randall Donald , Eugene K. Ressler A Rational Rotation Method for Robust Geometric Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Robert F. Cohen , Giuseppe Di Battista , Roberto Tamassia , Ioannis G. Tollis , Paola Bertolazzi A Framework for Dynamic Graph Drawing. [Citation Graph (0, 0)][DBLP ] Conf ] Hervé Brönnimann , Bernard Chazelle How Hard is Halfspace Range Searching? [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Matousek Range Searching with Efficient Hierarchical Cuttings. [Citation Graph (0, 0)][DBLP ] Conf ] Otfried Schwarzkopf Ray Shooting in Convex Polytopes. [Citation Graph (0, 0)][DBLP ] Conf ] Valeriu Soltan , Alexei Gorpinevich Minimum Dissection of Rectilinear Polygon with Arbitrary Holes into Rectangles. [Citation Graph (0, 0)][DBLP ] Conf ] David M. Mount Intersection Detection and Separators for Simple Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Klein , Andrzej Lingas Manhattonian Proximity in a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Naoki Katoh , Kazuo Iwano Finding k Farthest Pairs and k Closest/Farthest Bichromatic Pairs for Points in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Schwarz , Michiel H. M. Smid , Jack Snoeyink An Optimal Algorithm for the On-Line Closest-Pair Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Yossi Azar On-Line Steiner Trees in the Euclidean Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy Law Snyder , J. Michael Steele A Priori Inequalities for the Euclidean Traveling Salesman.Citation Graph (0, 0)][DBLP ] Conf ] Franz Aurenhammer , Friedrich Hoffman , Boris Aronov Minkowski-Type Theorems and Least-Squares Partitioning. [Citation Graph (0, 0)][DBLP ] Conf ] Haijo Schipper Determining Contractibility of Curves. [Citation Graph (0, 0)][DBLP ] Conf ] 