Conferences in DBLP
Bernhard Geiger 3D Modeling using the Delaunay Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Steven E. Benzley , Ted D. Blacker , Scott A. Mitchell , Peter Murdoch , Timothy J. Tautges Hexahedral Mesh Generation via the Dual. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Katrin Dobrindt On Levels of Detail in Terrains. [Citation Graph (1, 0)][DBLP ] Conf ] Robert R. Lewis VideHoc : A Visualizer for Homogeneous Coordinates.Citation Graph (0, 0)][DBLP ] Conf ] Jean-Daniel Boissonnat , Katrin Dobrindt , Bernhard Geiger , Henri Michel A Global Motion Planner for a Mobile Robot on a Terrain. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Burnikel , Jochen Könemann , Kurt Mehlhorn , Stefan Näher , Stefan Schirra , Christian Uhrig Exact Geometric Computation in LEDA. [Citation Graph (0, 0)][DBLP ] Conf ] Shankar Krishnan , Atul Narkhede , Dinesh Manocha Representation and Computation of Boolean Combinations of Sculptured Models. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , David P. Dobkin , Nadia Shouraboura , Ayellet Tal Convex Surface Decomposition. [Citation Graph (0, 0)][DBLP ] Conf ] Berto van de Kraats , Marc J. van Kreveld , Mark H. Overmars Printed Circuit Board Simplification: Simplifying Subdivisions in Practice. [Citation Graph (0, 0)][DBLP ] Conf ] Leo Joskowicz , Elisha Sacks HIPAIR: Interactive Mechanism Analysis and Design Using Configuration Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Michael H. Goldwasser An Implementation for Maintaining Arrangements of Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Frédo Durand , Claude Puech The Visibility Complex Made Visibly Simple: An Introduction to 2D Structures of Visibility. [Citation Graph (0, 0)][DBLP ] Conf ] Steve Glassman , Greg Nelson An Animation of Euclid's Proposition 47: The Pythagorean Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Dorothea Wagner , Karsten Weihe An Animated Library of Combinatorial VLSI-Routing Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Francis Avnaim , Jean-Daniel Boissonnat , Olivier Devillers , Franco P. Preparata , Mariette Yvinec Evaluation of a New Method to Compute Signs of Determinants. [Citation Graph (0, 0)][DBLP ] Conf ] Michel F. Sanner , Arthur J. Olson , Jean-Claude Spehner Fast and Robust Computation of Molecular Surfaces. [Citation Graph (0, 0)][DBLP ] Conf ] D. S. Andrews , Jack Snoeyink Geometry in GIS is not Combinatorial: Segment Intersection for Polygon Overlay. [Citation Graph (0, 0)][DBLP ] Conf ] Stéphane Rivière Topologically Sweeping the Visibility Complex of Polygonal Scenes. [Citation Graph (0, 0)][DBLP ] Conf ] Otfried Schwarzkopf The Extensible Drawing Editor Ipe. [Citation Graph (0, 0)][DBLP ] Conf ] Nina Amenta , Stuart Levy , Tamara Munzner , Mark Phillips Geomview: A System for Geometric Visualization. [Citation Graph (0, 0)][DBLP ] Conf ] Anil S. Rao , David J. Kriegman , Kenneth Y. Goldberg Complete Algorithms for Reorienting Polyhedral Parts Using a Pivoting Gripper. [Citation Graph (0, 0)][DBLP ] Conf ] Vishwa Ranjan , Alain Fournier Union of Spheres (UoS) Model for Volumetric Data. [Citation Graph (0, 0)][DBLP ] Conf ] Madhav K. Ponamgi , Ming C. Lin , Dinesh Manocha Incremental Collision Detection for Polygonal Models. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Schwarz , Jürgen Teich , Alek Vainshtein , Emo Welzl , Brian L. Evans Minimal Enclosing Parallelogram with Application. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Gritzmann , Alexander Hufnagel A Polynomial Time Algorithm for Minkowski Reconstruction. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] David Avis , David Bremner How Good are Convex Hull Algorithms? [Citation Graph (0, 0)][DBLP ] Conf ] Mark H. Overmars , Anil S. Rao , Otfried Schwarzkopf , Chantal Wentink Immobilizing Polygons against a Wall. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Alon Efrat , Micha Sharir Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Elmar Schömer , Christian Thiel Efficient Collision Detection for Moving Polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Su , Robert L. (Scot) Drysdale III A Comparison of Sequential Delaunay Triangulation Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Abellanas , Gregorio Hernández-Peñalver , Rolf Klein , Victor Neumann-Lara , Jorge Urrutia Voronoi Diagrams and Containment of Families of Convex Sets on the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Daniel Boissonnat , Micha Sharir , Boaz Tagansky , Mariette Yvinec Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Helmut Alt , Otfried Schwarzkopf The Voronoi Diagram of Curved Objects. [Citation Graph (0, 0)][DBLP ] Conf ] Herbert Edelsbrunner , Roman Waupotitsch A Combinatorial Approach to Cartograms. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Wagner , Alexander Wolff Map Labeling Heuristics: Provably Good and Practically Useful. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich Finke , Klaus Hinrichs Overlaying Simply Connected Planar Subdivisions in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Jeff Erickson New Lower Bounds for Hopcroft's Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Matousek A Helly-Type Theorem for Unions of Convex Sets. [Citation Graph (0, 0)][DBLP ] Conf ] László Lovász , János Pach , Mario Szegedy On Conway's Thrackle Conjecture. [Citation Graph (0, 0)][DBLP ] Conf ] Sergei Bespamyatnikh An Optimal Algorithm for Closest Pair Maintenance (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Gupta , Ravi Janardan , Michiel H. M. Smid , Bhaskar DasGupta The Rectangle Enclosure and Point-Dominance Problems Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Sunil Arya , David M. Mount Approximate Range Searching. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Otfried Schwarzkopf , Micha Sharir The Overlay of Lower Envelopes in Three Dimensions and Its Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas J. Guibas , David H. Marimont Rounding Arrangements Dynamically. [Citation Graph (0, 0)][DBLP ] Conf ] Boaz Tagansky A New Technique for Analyzing Substructures in Arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] Ivan J. Balaban An Optimal Algorithm for Finding Segments Intersections. [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , Franz Aurenhammer , Michael Taschwer , Günter Rote Triangulations Intersect Nicely. [Citation Graph (0, 0)][DBLP ] Conf ] Hisao Tamaki , Takeshi Tokuyama How to Cut Pseudo-Parabolas into Segments. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Dickerson , Scott A. McElfresh , Mark H. Montague New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Michel Pocchiola , Gert Vegter Computing the Visibility Graph via Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Icking , Rolf Klein Searching for the Kernel of a Polygon - A Competitive Strategy. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Boris Aronov , Subhash Suri Stabbing Triangulations by Lines in 3D. [Citation Graph (0, 0)][DBLP ] Conf ] Ashutosh Rege A Complete and Practical Algorithm for Geometric Theorem Proving (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Marco Pellegrini Monte Carlo Approximation of Form Factors with Error Bounded a Priori. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , David P. Dobkin , Nadia Shouraboura , Ayellet Tal Strategies for Polyhedral Surface Decomposition: An Experimental Study. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Di Battista , Ashim Garg , Giuseppe Liotta , Roberto Tamassia , Emanuele Tassinari , Francesco Vargiu An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Alan R. Davis , Tamal K. Dey , Sudebkumar Prasant Pal , D. Chithra Prasad Visibility with Reflection. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Micha Sharir Efficient Randomized Algorithms for Some Geometric Optimization Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Sunil Arya , David M. Mount , Onuttom Narayan Accounting for Boundary Effects in Nearest Neighbor Searching. [Citation Graph (3, 0)][DBLP ] Conf ] Martin E. Dyer A Parallel Algorithm for Linear Programming in Fixed Dimension. [Citation Graph (0, 0)][DBLP ] Conf ] Joonsoo Choi , Jürgen Sellen , Chee-Keng Yap Precision-Sensitive Euclidean Shortest Path in 3-Space (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Cristian S. Mata , Joseph S. B. Mitchell Approximation Algorithms for Geometric Tour and Network Design Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen , Kevin S. Klenk , Hung-Yi Tu Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Joonsoo Choi , Chee-Keng Yap Rectilinear Geodesics in 3-Space (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] 