Conferences in DBLP
Mark de Berg , Leonidas J. Guibas , Dan Halperin Vertical Decompositions for Triangles in 3-Space. [Citation Graph (0, 0)][DBLP ] Conf ] Dan Halperin , Micha Sharir Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Micha Sharir On Translational Motion Planning in 3-Space. [Citation Graph (0, 0)][DBLP ] Conf ] A. Frank van der Stappen , Mark H. Overmars Motion Planning Amidst Fat Obstacles (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Joonsoo Choi , Jürgen Sellen , Chee-Keng Yap Approximate Euclidean Shortest Path in 3-Space. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Eades , Sue Whitesides The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. [Citation Graph (0, 0)][DBLP ] Conf ] Sanguthevar Rajasekaran , Suneeta Ramaswami Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Mark de Berg , Jirí Matousek , Otfried Schwarzkopf Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Jirí Matousek , Otfried Schwarzkopf Computing Many Faces in Arrangements of Lines and Segments. [Citation Graph (0, 0)][DBLP ] Conf ] Helmut Alt , Oswin Aichholzer , Günter Rote Matching Shapes with a Reference Point. [Citation Graph (0, 0)][DBLP ] Conf ] Gill Barequet , Micha Sharir Piecewise-Linear Interpolation Between Polygonal Slices. [Citation Graph (0, 0)][DBLP ] Conf ] Michael T. Goodrich , Joseph S. B. Mitchell , Mark W. Orletsky Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motions (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Dan Halperin , Mark H. Overmars Spheres, Molecules, and Hidden Surface Removal. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , David Bremner , Marc J. van Kreveld Determining the Castability of Simple Polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Gautam Das , Giri Narasimhan A Fast Algorithm for Constructing Sparse Euclidean Spanners. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjiv Kapoor Dynamic Maintenance of Maximas of 2-P Point Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Mikhail J. Atallah , Michael T. Goodrich , Kumar Ramaiyer Biased Finger Trees and Three-Dimensional Layers of Maxima (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Kenneth L. Clarkson An Algorithm for Approximate Closest-Point Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjiv Kapoor , Michiel H. M. Smid New Techniques for Exact and Approximate Dynamic Closest-Point Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Amitava Datta , Christian Icking Competitive Searching in a Generalized Street. [Citation Graph (0, 0)][DBLP ] Conf ] Biao Gao , Ding-Zhu Du , Ronald L. Graham The Tight Lower Bound for the Steiner Ratio in Minkowski Planes. [Citation Graph (0, 0)][DBLP ] Conf ] Jacob E. Goodman , Richard Pollack , Rephael Wenger Bounding the Number of Geometric Permutations Induced by k -Transversals. [Citation Graph (0, 0)][DBLP ] Conf ] János Pach , Farhad Shahrokhi , Mario Szegedy Applications of the Crossing Number. [Citation Graph (0, 0)][DBLP ] Conf ] Herbert Edelsbrunner , Pavel Valtr , Emo Welzl Cutting Dense Point Sets in Half. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Dickerson , Robert L. (Scot) Drysdale III , Scott A. McElfresh , Emo Welzl Fast Greedy Triangulation Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Marshall W. Bern , Scott A. Mitchell , Jim Ruppert Linear-Size Nonobtuse Triangulation of Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , Nadia Shouraboura Bounds on the Size of Tetrahedralizations. [Citation Graph (0, 0)][DBLP ] Conf ] Tiow Seng Tan An Optimal Bound for Conforming Quality Triangulations (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Gabriel Robins , Jeffrey S. Salowe On the Maximum Degree of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Gautam Das , Giri Narasimhan Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas J. Guibas , John Hershberger Morphing Simple Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey A New Technique to Compute Polygonal Schema for 2-Manifolds with Application to Null-Homotopy Detection. [Citation Graph (0, 0)][DBLP ] Conf ] Herbert Edelsbrunner , Nimish R. Shah Triangulating Topological Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Hervé Brönnimann , Michael T. Goodrich Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version). [Citation Graph (1, 0)][DBLP ] Conf ] Jerzy W. Jaromczyk , Miroslaw Kowaluk An Efficient Algorithm for the Euclidean Two-Center Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Matousek On Geometric Optimization with Few Violated Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Michael T. Goodrich Efficient Piecewise-Linear Function Approximation Using the Uniform Metric (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Mary Inaba , Naoki Katoh , Hiroshi Imai Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k -Clustering (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Nina Amenta Bounded Boxes, Hausdorff Distance, and a New Proof of an Interesting Helly-Type Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Boris Aronov , Micha Sharir Computing Envelopes in Four Dimensions with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph S. B. Mitchell , David M. Mount , Subhash Suri Query-Sensitive Ray Shooting. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Gupta , Ravi Janardan , Michiel H. M. Smid Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects. [Citation Graph (0, 0)][DBLP ] Conf ] John Hershberger , Jack Snoeyink An O(n log n) Implementation of the Douglas-Peucker Algorithm for Line Simplification. [Citation Graph (0, 0)][DBLP ] Conf ] David P. Dobkin , Dimitrios Gunopulos Computing the Rectangle Discrepancy. [Citation Graph (0, 0)][DBLP ] Conf ] Hans-Peter Lenhof , Michiel H. M. Smid An Animation of a Fixed-Radius All-Nearest-Neighbors Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Ayellet Tal , David P. Dobkin GASP: A System to Facilitate Animating Geometric Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Adrian Mariano , Linus Upson Penumbral Shadows. [Citation Graph (0, 0)][DBLP ] Conf ] Jonathan D. Cohen , Ming C. Lin , Dinesh Manocha , Madhav K. Ponamgi Exact Collision Detection for Interactive Environments (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Hervé Brönnimann Almost Optimal Polyhedral Separators. [Citation Graph (0, 0)][DBLP ] Conf ] Amitabh Varshney , Frederick P. Brooks Jr. , William V. Wright Interactive Visualization of Weighted Three-Dimensional Alpha Hulls. [Citation Graph (0, 0)][DBLP ] Conf ] 