Conferences in DBLP
Jirí Matousek Cutting Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] János Pach , Gerhard J. Woeginger Some New Bounds for Epsilon-Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Matousek Raimund Seidel, Emo Welzl: How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , Micha Sharir , Emo Welzl Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. [Citation Graph (0, 0)][DBLP ] Conf ] David G. Kirkpatrick , Maria M. Klawe , Robert Endre Tarjan Polygon Triangulation in O(n log log n) Time with Simple Data-Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Herbert Edelsbrunner , Tiow Seng Tan , Roman Waupotitsch An O(n2 log n) Time Algorithm for the MinMax Angle Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Paul J. Heffernan , Joseph S. B. Mitchell Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Joseph S. B. Mitchell , Günter Rote , Gerhard J. Woeginger Minimum-Link Paths Among Obstacles in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Michael T. Goodrich , Steven B. Shauck , Sumanta Guha Parallel Methods for Visibility and Shortest Path Problems in Simple Polygons (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Sylvain E. Cappell , Jacob E. Goodman , János Pach , Richard Pollack , Micha Sharir , Rephael Wenger The Combinatorial Complexity of Hyperplane Transversals. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Gritzmann , Victor Klee , John Westwater On the Limited Power of Linear Probes and Other Optimization Oracles. [Citation Graph (0, 0)][DBLP ] Conf ] Gert Vegter , Chee-Keng Yap Computational Complexity of Combinatorial Surfaces. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Bernard Chazelle , Herbert Edelsbrunner , Leonidas J. Guibas , Micha Sharir , Rephael Wenger Points and Triangles in the Plane and Halving Planes in Space. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , Herbert Edelsbrunner , Leonidas J. Guibas , John Hershberger , Raimund Seidel , Micha Sharir Slimming Down by Adding: Selecting Heavily Covered Points. [Citation Graph (0, 0)][DBLP ] Conf ] Danièle Beauquier , Maurice Nivat Tiling the Plane with One Tile. [Citation Graph (0, 0)][DBLP ] Conf ] Jack Snoeyink A Trivial Knot Whose Spanning Disks Have Exponential Size. [Citation Graph (0, 0)][DBLP ] Conf ] Chandrajit L. Bajaj Geometric Computations with Algebraic Varieties of Bounded Degree. [Citation Graph (0, 0)][DBLP ] Conf ] B. K. Natarajan On Computing the Intersection of B-Splines (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Mark H. Overmars , Micha Sharir Merging Visibility Maps. [Citation Graph (0, 0)][DBLP ] Conf ] Marco Pellegrini Stabbing and Ray Shooting in 3 Dimensional Space. [Citation Graph (0, 0)][DBLP ] Conf ] Jon Louis Bentley K-d Trees for Semidynamic Point Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Elias Koutsoupias , Christos H. Papadimitriou , Martha Sideri On the Optimal Bisection of a Polygon (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Herbert Edelsbrunner , Otfried Schwarzkopf , Emo Welzl Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. [Citation Graph (0, 0)][DBLP ] Conf ] Raimund Seidel Linear Programming and Convex Hulls Made Easy. [Citation Graph (3, 0)][DBLP ] Conf ] Rudolf Fleischer , Kurt Mehlhorn , Günter Rote , Emo Welzl , Chee-Keng Yap On Simultaneous Inner and Outer Approximation of Shapes. [Citation Graph (0, 0)][DBLP ] Conf ] Hiromi Aonuma , Hiroshi Imai , Keiko Imai , Takeshi Tokuyama Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Zhenyu Li , Victor Milenkovic Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic. [Citation Graph (0, 0)][DBLP ] Conf ] Victor Milenkovic , Lee R. Nackman Finding Compact Coordinate Representations for Polygons and Polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Bienstock Some Provably Hard Crossing Number Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Evangelos Kranakis , Michel Pocchiola Enumeration and Visibility Problems in Integer Lattices (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] John F. Canny , Ashutosh Rege , John H. Reif An Exact Algorithm for Kinodynamic Planning in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Helmut Alt , Rudolf Fleischer , Michael Kaufmann , Kurt Mehlhorn , Stefan Näher , Stefan Schirra , Christian Uhrig Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. [Citation Graph (0, 0)][DBLP ] Conf ] Bruce Randall Donald , Patrick G. Xavier Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open Chain Manipulators. [Citation Graph (0, 0)][DBLP ] Conf ] D. T. Lee , T. H. Chen , Chung-Do Yang Shortest Rectilinear Paths among Weighted Obstacles. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy Law Snyder On Minimal Rectilinear Steiner Trees in All Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Boris Aronov , Micha Sharir , Subhash Suri Selecting Distances in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Steven Skiena , Warren D. Smith , Paul Lemke Reconstructing Sets from Interpoint Distances (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Daniel P. Huttenlocher , Klara Kedem Computing the Minimum Hausdorff Distance for Point Sets Under Translation. [Citation Graph (0, 0)][DBLP ] Conf ] Elefterios A. Melissaratos , Diane L. Souvaine On Solving Geometric Optimization Problems Using Shortest Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Jindong Chen , Yijie Han Shortest Paths on a Polyhedron. [Citation Graph (0, 0)][DBLP ] Conf ] A. Knight , J. May , Jeff McAffer , T. Nguyen , Jörg-Rüdiger Sack A Computational geometry Workbench. [Citation Graph (0, 0)][DBLP ] Conf ] 