Conferences in DBLP
Tetsuo Asano , Takeshi Tokuyama Topological Walk Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] William L. Steiger , Ileana Streinu A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines. [Citation Graph (0, 0)][DBLP ] Conf ] Mary Inaba , Yasukazu Aoki , Susumu Hasegawa Level Difference of the Reconstructed Arrangement. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Lubiw , Naji Mouawad Interval Graphs as Visibility Graphs of Simple Polygons Part 1: Parachutes. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Pocchiola , Gert Vegter Minimal Tangent Visibility Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Shiou-Yi Lin , Chiuyuan Chen Planar Visibility Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Herbert Edelsbrunner Modeling with Simplicial Complexes. [Citation Graph (0, 0)][DBLP ] Conf ] Vincenzo Ferrucci , Mark H. Overmars , Anil S. Rao , Jules Vleugels Hunting Voronoi Vertices in Non-Polygonal Domains. [Citation Graph (0, 0)][DBLP ] Conf ] Chantal Wentink , Otfried Schwarzkopf Motion Planning for Vacuum Cleaner Robots. [Citation Graph (0, 0)][DBLP ] Conf ] Siu-Wing Cheng Widest Empty Corridor with Multiple Links and Right-angle Turns. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Brinkman , Thorsten Graf , Klaus Hinrichs The Colored Quadrant Priority Search Tree with an Application to the all-nearest-foreign-neighbors Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Thorsten Graf , Klaus Hinrichs Distribution Algorithms for the all-nearest-foreign-neighbors Problem in Arbitrary Lt -metrics. [Citation Graph (0, 0)][DBLP ] Conf ] Sergei Bespamyatnikh The Region Approach for some Dynamic Closest-Point Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Vladimir Estivill-Castro , Jorge Urrutia Optimal Floodlight Illumination of Orthogonal Art Galleries. [Citation Graph (0, 0)][DBLP ] Conf ] William L. Steiger , Ileana Streinu Positive and Negative Results on the Floodlight Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Chuzo Iwamoto , Godfried T. Toussaint Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-complete. [Citation Graph (0, 0)][DBLP ] Conf ] Hervé Brönnimann , Bernard Chazelle Optimal Slope Selection Via Cuttings. [Citation Graph (0, 0)][DBLP ] Conf ] John Hershberger , Jack Snoeyink An Efficient Solution to the Zookeeper's Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Evanthia Papadopoulou , D. T. Lee Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Yamamoto Computing the Dent Diameter of a Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Devillers , Mordecai J. Golin , Klara Kedem , Stefan Schirra Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Held On Computing Voronoi Diagrams of Convex Polyhedra by Means of Wavefront Propagation. [Citation Graph (0, 0)][DBLP ] Conf ] Abhi Dattasharma Some Qualitative Properties of a Generalized Voronoi Diagram for Convex Polyhedra in d-dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Srinivasa Rao Arikati , Anil Maheshwari , Christos D. Zaroliagis Saving Bits Made Easy. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy Law Snyder , J. Michael Steele Worst-Case TSP Point Sets in All Dimensions are Asymptotically Equidistributed. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Devillers , Mordecai J. Golin Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. [Citation Graph (0, 0)][DBLP ] Conf ] Tsuyoshi Ono An Eight-Way Perturbation Technique for the Three-Dimensional Convex Hull. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Michel Moreau Hierarchical Delaunay Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Inagaki , Kokichi Sugihara Numerically Robust Algorithm for Contructing Constrained Delaunay Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Voigtmann , Ludger Becker , Klaus Hinrichs The Contrained Delaunay Pyramid - A Model for Reconstructing Surfaces at Multiple Resolutions. [Citation Graph (0, 0)][DBLP ] Conf ] Laxmi Gewali Recognizing S-Star Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Chong Zhu , Gopalakrishnan Sundaram , Jack Snoeyink , Joseph S. B. Mitchell Generating Random x-Monotone Polygons with Given Vertices. [Citation Graph (0, 0)][DBLP ] Conf ] Francisco Santos On Delaunay oriented Matroids. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy Lambert The Delaunay Triangulation Maximizes the Mean Inradius. [Citation Graph (0, 0)][DBLP ] Conf ] Y. B. Karasik Optical Computer Vision. [Citation Graph (0, 0)][DBLP ] Conf ] Y. B. Karasik Constructing Optically in Constant Time the K-Level of an Arrangement of Lines in the Plane and Other Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Christopher M. Gold Persistent Spatial Relations - a Systems Design Objective. [Citation Graph (0, 0)][DBLP ] Conf ] Karen L. Daniels , Victor Milenkovic Limited Gaps. [Citation Graph (0, 0)][DBLP ] Conf ] Paul G. Mezey The T-Hull Approach to Shape Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Hertling , Klaus Weihrauch Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] David P. Dobkin , Ayellet Tal GASP - An Animation System for Computational Geometry. [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Abellanas , Ferran Hurtado , Pedro A. Ramos Tolerance of Geometric Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Binhai Zhu Intersection Detection and Computation of Manhattan Terrains. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Colley , Henk Meijer , David Rappaport Optimal Nearly-Similar Polygon Stabbers of Convex Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Ryan Hayward , Paul E. Kearney Tolerance-Free NeST Representations. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Liotta , Francesco Vargiu , Giuseppe Di Battista Orthogonal Drawings with the Minimum Number of Bends. [Citation Graph (0, 0)][DBLP ] Conf ] Michael B. Dillencourt , Warren D. Smith Graph-Theoretical Conditions for Inscribability and Delaunay Realizability. [Citation Graph (0, 0)][DBLP ] Conf ] Hazel Everett , Eduardo Rivera-Campo Edge Guarding a Triangulated Polyhedral Terrain. [Citation Graph (0, 0)][DBLP ] Conf ] Siu-Ming Yiu , A. Choi Edge Guards on a Fortress. [Citation Graph (0, 0)][DBLP ] Conf ] Ervin Györi , Frank Hoffmann , Klaus Kriegel , Thomas C. Shermer Generalized Guarding and Partitioning for Rectilinear Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph L. Ganley , James P. Cohoon Optimal Rectilinear Steiner Minimal Trees in O (n2 2.62n ) Time. [Citation Graph (0, 0)][DBLP ] Conf ] Claudio Mirolo Convex Minimization on a Grid and Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas Palios On the Number of Extrema of a Polyhedron. [Citation Graph (0, 0)][DBLP ] Conf ] Scott A. Mitchell Cardinality Bounds for Triangulations with Bounded Minimum Angle. [Citation Graph (0, 0)][DBLP ] Conf ] Cao An Wang An Optimal Algorithm for Greedy Triangulation of a Set of Points. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey , Michael B. Dillencourt , Subir Kumar Ghosh Triangulating with High Connectivity. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , David Bremner , Godfried T. Toussaint All Convex Polyhedra can be Clamped with Parallel Jaw Grippers. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas Palios Optimal Tetrahedralization of the 3d-Region between a Convex Polyhedron and a Convex Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Abhi Dattasharma The Size of a Generalized Voronoi Diagram for Convex Polyhedra in d-dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] David Bremner Link-2-Convex One-Fillable Polygons are Starshaped. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen K. Wismath Reconstruction of Parallel Line Segments From Endpoint Visibility Information. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen Determining Weak External Visibility of Polygons in Parallel. [Citation Graph (0, 0)][DBLP ] Conf ] Patrice Belleville , Prosenjit Bose , Jurek Czyzowicz , Jorge Urrutia , Joseph Zaks K-Guarding Polygons on the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Gregorio Hernández-Peñalver Controlling Guards. [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Abellanas , Jesus Garcia-Lopez , Ferran Hurtado Consecutive Guards. [Citation Graph (0, 0)][DBLP ] Conf ] 