Conferences in DBLP
Karen Daniels , Arti Mathur , Roger Grinde A combinatorial maximum cover approach to 2D translational geometric covering. [Citation Graph (0, 0)][DBLP ] Conf ] Henning Fernau , Torben Hagerup , Naomi Nishimura , Prabhakar Ragde , Klaus Reinhardt On the parameterized complexity of the generalized rush hour puzzle. [Citation Graph (0, 0)][DBLP ] Conf ] Tetsuo Asano , David G. Kirkpatrick , Chee-Keng Yap Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. [Citation Graph (0, 0)][DBLP ] Conf ] Ying Liu , Mikhail Nediak Planar case of the maximum box and related problems. [Citation Graph (0, 0)][DBLP ] Conf ] Kensuke Onishi , Jin-ichi Itoh Estimation of the necessary number of points in Riemannian Voronoi. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Medvedeva , Asish Mukhopadhyay An Implementation of a linear time algorithm for computing the minimum perimeter triangle enclosing a convex polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Therese C. Biedl , Anna Lubiw , Michael J. Spriggs Parallel morphing of trees and cycles. [Citation Graph (0, 0)][DBLP ] Conf ] Weizhao Wang , Xiang-Yang Li , Yu Wang , Wen-Zhan Song The spanning ratios of beta-Skeleton. [Citation Graph (0, 0)][DBLP ] Conf ] Michael J. Spriggs , J. Mark Keil , Sergei Bespamyatnikh , Michael Segal , Jack Snoeyink Approximating the geometric minimum-diameter spanning tree. [Citation Graph (0, 0)][DBLP ] Conf ] Mirela Damian-Iordache , Joseph O'Rourke Partitioning Regular Polygons into Circular Pieces I: Convex Partitions. [Citation Graph (0, 0)][DBLP ] Conf ] Masud Hasan , Anna Lubiw Equiprojective Polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Helmut Alt , Marc Glisse , Xavier Goaoc On the worst-case complexity of the silhouette of a polytope. [Citation Graph (0, 0)][DBLP ] Conf ] Suzanne Gallagher , Joseph O'Rourke Coloring Objects Built From Bricks. [Citation Graph (0, 0)][DBLP ] Conf ] Asish Mukhopadhyay , Quanbin Jing Encoding Quadrilateral Meshes. [Citation Graph (0, 0)][DBLP ] Conf ] Petr Tobola , Karel Nechvíle Linear Binary Space Partitions and the Hierarchy of Object Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Y. Chen , Timothy M. Chan A Space-Efficient Algorithm for Segment Intersection. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan , Alexander Golynski , Alejandro López-Ortiz , Claude-Guy Quimper Curves of width one and the river shore problem. [Citation Graph (0, 0)][DBLP ] Conf ] Jocelyn Smith , William S. Evans Triangle Guarding. [Citation Graph (0, 0)][DBLP ] Conf ] Greg Aloupis , Thomas Fevens , Stefan Langerman , Tomomi Matsui , Antonio Mesa , David Rappaport , Godfried T. Toussaint Computing the Similarity of two Melodies. [Citation Graph (0, 0)][DBLP ] Conf ] Mahmoud Melkemi Molecular graphs of a finite points set: a generalization of the Delaunay triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Nicolas Grislain , Jonathan Richard Shewchuk The Strange Complexity of Constrained Delaunay Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Ali Asghar Khanban , Abbas Edalat Computing Delaunay Triangulation with Imprecise Input Data. [Citation Graph (0, 0)][DBLP ] Conf ] Robert A. Hearn , Erik D. Demaine , Greg N. Frederickson Hinged Dissection of Polygons is Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Chris Worman Decomposing Polygons Into Diameter Bounded Components. [Citation Graph (0, 0)][DBLP ] Conf ] Ferran Hurtado , Godfried T. Toussaint , Joan Trias On Polyhedra Induced by Point Sets in Space. [Citation Graph (0, 0)][DBLP ] Conf ] Jaeil Choi , Andrzej Szymczak On Coherent Rotation Angles for As-Rigid-As-Possible Shape Interpolation. [Citation Graph (0, 0)][DBLP ] Conf ] Ian Hsieh , Kiat-Choong Chen , Cao An Wang A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Golynski , David Bremner Sufficiently Fat Polyhedra are Not 2-Castable. [Citation Graph (0, 0)][DBLP ] Conf ] Stephane Durocher , David G. Kirkpatrick The Gaussian Centre of a Set of Mobile Points. [Citation Graph (0, 0)][DBLP ] Conf ] Laxmi Gewali , Joy Bhadury , Ramaswamy Chandrasekaran Network Design Subject to Facility Location. [Citation Graph (0, 0)][DBLP ] Conf ] Pinaki Mitra , Asish Mukhopadhyay , S. V. Rao Computing the Closest Point to a Circle. [Citation Graph (0, 0)][DBLP ] Conf ] Marina L. Gavrilova , Sergei Bespamyatnikh On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfaces. [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , David Orden , Francisco Santos , Bettina Speckmann On the Number of Pseudo-Triangulations of Certain Point Sets. [Citation Graph (0, 0)][DBLP ] Conf ] J. Mark Keil , Tzvetalin S. Vassilev An algorithm for the MaxMin area triangulation of a convex polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Shiyan Hu A Constant Approximation Algorithm for Maximum Weight Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , Michael Hoffmann , Bettina Speckmann , Csaba D. Tóth Degree Bounds for Constrained Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Jeff Erickson , Stefan Langerman On the Complexity of Halfspace Volume Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Lingke Bu , Bradford G. Nickerson Multidimensional Orthogonal Range Search Using Tries. [Citation Graph (0, 0)][DBLP ] Conf ] David Hart Shortest Paths in Two Intersecting Pencils of Lines. [Citation Graph (0, 0)][DBLP ] Conf ] Telikepalli Kavitha , Kasturi R. Varadarajan On shortest paths in line arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] Hervé Brönnimann , Hazel Everett , Sylvain Lazard , Frank Sottile , Sue Whitesides Transversals to line segments in R3 . [Citation Graph (0, 0)][DBLP ] Conf ] 