Conferences in DBLP
Marc J. van Kreveld , Jack Snoeyink , Sue Whitesides Folding Rulers inside Triangles. [Citation Graph (0, 0)][DBLP ] Conf ] Zhenyu Li , Victor Milenkovic The Complexity of the Compaction Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Lydia E. Kavraki , Jean-Claude Latombe , Randall H. Wilson On the Complexity of Assembly Partitioning. [Citation Graph (0, 0)][DBLP ] Conf ] Jesus Garcia-Lopez , Pedro Ramos-Alonso Circular Visibility and Separability. [Citation Graph (0, 0)][DBLP ] Conf ] Godfried T. Toussaint , Clark Verbrugge , Cao An Wang , Binhai Zhu Tetrahedralization of Simple and Non-Simple Polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Mary-Anne K. Posenau Approaches to High Aspect Ratio Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Scott A. Mitchell Approximating the Maxmin-angle Covering Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Maria-Cecilia Rivara A Discussion on the Triangulation Refinement Problem. [Citation Graph (0, 0)][DBLP ] Conf ] William L. Steiger Algorithms for Ham Sandwich Cuts. [Citation Graph (0, 0)][DBLP ] Conf ] Michael B. Dillencourt , David M. Mount , Alan Saalfeld On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Micha Sharir On the Number of Views of Polyhedral Terrains. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Marc Robert Geometric Orderings and Helly-type Theorem for Intersecting Translates in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Jacqueline D. Chang , Victor Milenkovic An Experiment Using LN for Exact Geometric Computations. [Citation Graph (0, 0)][DBLP ] Conf ] David M. Mount , Nathan S. Netanyahu Efficient Algorithms for Robust Circular Arc Estimators. [Citation Graph (0, 0)][DBLP ] Conf ] Svante Carlsson , Håkan Jonsson Guarding a Treasury. [Citation Graph (0, 0)][DBLP ] Conf ] P. Pradeep Kumar , C. E. Veni Madhavan Shortest Watchman Tours in Weak Visibility Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Bern-Cherng Liaw , N. F. Huang , Richard C. T. Lee The Minimum Cooperative Guards Problem on K-spiral Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Shivakumar Viswanathan The Edge Guard Problem for Spiral Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Marko de Groot , Mark H. Overmars Perfect Binary Space Partitions. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Efrat , Günter Rote , Micha Sharir On the Union of Fat Wedges and Separating a Collection of Segments By a Line. [Citation Graph (0, 0)][DBLP ] Conf ] Viet Hai Nguyen , Thomas Roos , Peter Widmayer Balanced Cuts of a Set of Hyperrectangles. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas J. Guibas , Dan Halperin , Jirí Matousek , Micha Sharir On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Larry Shafer , William L. Steiger Randomizing Optimal Geometric Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew J. Katz , Micha Sharir Optimal Slope Selection Via Expanders. [Citation Graph (0, 0)][DBLP ] Conf ] William Rucklidge Lower Bounds for the Complexity of the Hausdorff Distance. [Citation Graph (0, 0)][DBLP ] Conf ] L. Paul Chew , Michael T. Goodrich , Daniel P. Huttenlocher , Klara Kedem , Jon M. Kleinberg , Dina Kravets Geometric Pattern Matching Under Euclidean Motion. [Citation Graph (0, 0)][DBLP ] Conf ] Jocelyn Cloutier , Imed Bennour Topological Characterization of Hwang's Optimal Steiner Trees. [Citation Graph (0, 0)][DBLP ] Conf ] David G. Kirkpatrick , Jack Snoeyink Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. [Citation Graph (0, 0)][DBLP ] Conf ] Asish Mukhopadhyay , Chanchal Kumar , Binay K. Bhattacharya Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments. [Citation Graph (0, 0)][DBLP ] Conf ] Pedro Jussieu de Rezende , Welson R. Jacometti GeoLab: An Environment for Development of Algorithms in Computational Geometry. [Citation Graph (0, 0)][DBLP ] Conf ] Micha Sharir Arrangements of Surfaces in Higher Dimensions: Envelopes Single Cells and Other Recent Developments. [Citation Graph (0, 0)][DBLP ] Conf ] Hossam A. ElGindy , Michael E. Houle , William Lenhart , Mirka Miller , David Rappaport , Sue Whitesides Dominance Drawings of Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Goos Kant , Giuseppe Liotta , Roberto Tamassia , Ioannis G. Tollis Area Requirement of Visibility Representations of Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Lubiw , Nora Sleumer Maximal Outerplanar Graphs Are Relative Neighbourhood Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Klara Kedem , Micha Sharir , Sivan Toledo On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm for a Convex Polygon in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Mikhail J. Atallah , Danny Z. Chen On Parallel Rectilinear Obstacle-avoiding Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Erik L. Wynters , Joseph S. B. Mitchell Shortest Paths for a Two-robot Rendez-vous. [Citation Graph (0, 0)][DBLP ] Conf ] Sven Schuierer , Derick Wood Generalized Kernels of Polygons with Holes. [Citation Graph (0, 0)][DBLP ] Conf ] Ramasubramanian Venkatasubramanian , Akio Cullum Grazing inside a Convex Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Ferran Hurtado Looking through a Window. [Citation Graph (0, 0)][DBLP ] Conf ] Laxmi Gewali On Minimum and Maximum Visibility Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Mordecai J. Golin , Rajeev Raman , Christian Schwarz , Michiel H. M. Smid Simple Randomized Algorithms for Closest Pair Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Reuven Bar-Yehuda , Alon Efrat , Alon Itai A Simple Algorithm for Maintaining the Center of a Planar Point-set. [Citation Graph (0, 0)][DBLP ] Conf ] Günter Rote , Christian Schwarz , Jack Snoeyink Maintaining the Approximate Width of a Set of Points in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Matias Semi-dynamic Closest-pair Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Raimund Seidel Teaching Computational Geometry. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey Optimal Algorithms to Detect Null-homologous Cycles on 2-manifolds. [Citation Graph (0, 0)][DBLP ] Conf ] Michela Bertolotto , Elisabetta Bruzzone , Leila De Floriani Acyclic Hierarchical Cell Complexes. [Citation Graph (0, 0)][DBLP ] Conf ] Aldo Laurentini On the Minimal Number of Volume Intersection Operations Necessary for Reconstructing a 3D Object. [Citation Graph (0, 0)][DBLP ] Conf ] A. James Stewart , Sherif Ghali An Output Sensitive Algorithm for the Computation of Shadow Boundaries. [Citation Graph (0, 0)][DBLP ] Conf ] Derick Wood , Peter Yamamoto Dent and Staircase Visibility. [Citation Graph (0, 0)][DBLP ] Conf ] Gautam Das , Paul J. Heffernan , Giri Narasimhan LR-visibility in Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Hazel Everett , Anna Lubiw , Joseph O'Rourke Recovery of Convex Hulls From External Visibility Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] G. Srinivasaraghavan , Asish Mukhopadhyay On the Notion of Completeness for Reconstruction Algorithms on Visibility Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas C. Shermer The Continuous-graph Approach to Visibility Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Karen L. Daniels , Victor Milenkovic , Dan Roth Finding the Maximum Area Axis-parallel Rectangle in a Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Ivan Stojmenovic Finding the Largest M-dimensional Circle in a K-dimensional Box. [Citation Graph (0, 0)][DBLP ] Conf ] D. P. Wang , Richard C. T. Lee An Optimal Algorithm for Solving the Restricted Minimal Convex Nested Polygonal Separation Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Michel Moreau , Pascal Volino Constrained Delaunay Triangulation Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Dominique Schmitt , Jean-Claude Spehner On Equiangularity of Delaunay Diagrams in Every Dimension. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy Lambert Systematic Local Flip Rules Are Generalized Delaunay Rules. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Roos Tighter Bounds on Voronoi Diagrams of Moving Points. [Citation Graph (0, 0)][DBLP ] Conf ] L. Paul Chew Near-quadratic Bounds for the ItL_1 Voronoi Diagram of Moving Points. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Klein , Andrzej Lingas A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Ngoc-Minh Lê On General Properties of Strictly Convex Smooth Distance Functions in RD . [Citation Graph (0, 0)][DBLP ] Conf ] Henk Meijer , Steven Skiena Reconstructing Polygons From X-Rays. [Citation Graph (0, 0)][DBLP ] Conf ] Esther M. Arkin , Patrice Belleville , Joseph S. B. Mitchell , David M. Mount , Kathleen Romanik , Steven Salzberg , Diane L. Souvaine Testing Simple Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Jurek Czyzowicz , Eduardo Rivera-Campo , Jorge Urrutia Optimal Floodlight Illumination of Stages. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Leonidas J. Guibas , Anna Lubiw , Mark H. Overmars , Diane L. Souvaine , Jorge Urrutia The Floodlight Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Chee Yap Low Level Issues in Computational Geometry. [Citation Graph (0, 0)][DBLP ] Conf ] Thorsten Hinrichs , Klaus Graf Algorithms for Proximity Problems on Colored Point Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Janardan , Franco P. Preparata Widest-corridor Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Efrat , Micha Lindenbaum , Micha Sharir Finding Maximally Consistent Sets of Halfspaces. [Citation Graph (0, 0)][DBLP ] Conf ] Michael McAllister , Jack Snoeyink Two-dimensional Computation of the Three-dimensional Reachable Region for a Welding Head. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Icking , Rolf Klein , Lihong Ma How to Look Around a Corner. [Citation Graph (0, 0)][DBLP ] Conf ] Abhi Dattasharma , S. Sathiya Keerthi Translational Motion Planning for a Convex Polyhedron in a 3D Polyhedral World Using an Efficient and New Roadmap. [Citation Graph (0, 0)][DBLP ] Conf ] Gunter Bär , Claudia Iturriaga Rectangle Packing in Polynomial Time. [Citation Graph (0, 0)][DBLP ] Conf ] Esther M. Arkin , Sándor P. Fekete , Joseph S. B. Mitchell The Lawnmower Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Patrice Belleville On Restricted Boundary Covers and Convex Three-Covers. [Citation Graph (0, 0)][DBLP ] Conf ] Victor Milenkovic Robust Construction of the Voronoi Diagram of a Polyhedron. [Citation Graph (0, 0)][DBLP ] Conf ] C. Bradford Barber , Michael D. Hirsch A Robust Algorithm for Point in Polyhedron. [Citation Graph (0, 0)][DBLP ] Conf ] Victor Milenkovic , Veljko Milenkovic Rational Orthogonal Approximations to Orthogonal Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] 