Conferences in DBLP
Adrian Dumitrescu A remark on the Erdös-Szekeres theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Khaled M. Elbassioni , Amr Elmasry , Vladimir Gurvich A stronger version of Bárány's theorem in the plane. [Citation Graph (0, 0)][DBLP ] Conf ] Gruia Calinescu , Adrian Dumitrescu , Peng-Jun Wan Separating points by axis-parallel lines. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Giesen , Simon Spalinger Meshless surface reconstruction by kernel clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Freedman Surface reconstruction, one triangle at a time. [Citation Graph (0, 0)][DBLP ] Conf ] Mirela Damian , Joseph O'Rourke On corners of objects built from parallelepiped bricks. [Citation Graph (0, 0)][DBLP ] Conf ] Benoît Hudson , Gary L. Miller Using bistellar flips for rotations in point location structures. [Citation Graph (0, 0)][DBLP ] Conf ] Stephan Foldes Decomposition of planar motions into reflections and rotations with distance constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Valentin Polishchuk The box mover problem. [Citation Graph (0, 0)][DBLP ] Conf ] Pat Morin , David R. Wood Three-dimensional 1-bend graph drawings. [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Mantler , Jack Snoeyink Banana spiders: A study of connectivity in 3d combinatorial rigidity. [Citation Graph (0, 0)][DBLP ] Conf ] Ferran Hurtado , Mikio Kano , David Rappaport , Csaba D. Tóth Encompassing colored crossing-free geometric graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Therese C. Biedl , Burkay Genc When can a graph form an orthogonal polyhedron? [Citation Graph (0, 0)][DBLP ] Conf ] Henk Meijer , David Rappaport Simultaneous edge flips for convex subdivisions. [Citation Graph (0, 0)][DBLP ] Conf ] Greg Aloupis , Erik D. Demaine , Stefan Langerman , Pat Morin , Joseph O'Rourke , Ileana Streinu , Godfried T. Toussaint Unfolding polyhedral bands. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Satyan L. Devadoss , Joseph S. B. Mitchell , Joseph O'Rourke Continuous foldability of polygonal paper. [Citation Graph (0, 0)][DBLP ] Conf ] Chris Gray , William Evans Optimistic shortest paths on uncertain terrains. [Citation Graph (0, 0)][DBLP ] Conf ] Jose Antonio Pérez Ruy-Díaz , Mohammed Safar Sideq Approximating optimal paths in terrains with weight defined by a piecewise-linear function. [Citation Graph (0, 0)][DBLP ] Conf ] William S. Evans , Daniel Archambault , David G. Kirkpatrick Computing the set of all distant horizons of a terrain. [Citation Graph (0, 0)][DBLP ] Conf ] Vamsikrishna Kundeti , Prosenjit Gupta Efficient polygon enclosure algorithms for device extraction from VLSI layouts. [Citation Graph (0, 0)][DBLP ] Conf ] Chris Worman , Mark D. Watson Tiling layouts with dominoes. [Citation Graph (0, 0)][DBLP ] Conf ] Ivaylo Ilinkin , Ravi Janardan , Michiel H. M. Smid , Eric Johnson , Paul Castillo , Jörg Schwerdt Approximating contact-area of supports in layered manufacturing. [Citation Graph (0, 0)][DBLP ] Conf ] Steven E. Pav An anisotropic cardinality bound for triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Burr , Alan Cheng , Ryan Coleman , Diane L. Souvaine Transformations and algorithms for least sum of squares hypersphere fitting. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Marc J. van Kreveld Computing nice sweeps for polyhedra and polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Robin Y. Flatland On sequential triangulations of simple polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Sandip Das , Partha P. Goswami , Subhas C. Nandy Smallest k point enclosing rectangle of arbitrary orientation. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Carlos Seara , Saurabh Sethia On computing enclosing isosceles triangles and related problems. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Nielsen , Richard Nock Approximating smallest enclosing disks. [Citation Graph (0, 0)][DBLP ] Conf ] Gill Barequet , Vadim Rogol Maximizing the area of an axis-symmetric polygon inscribed by a convex polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Harish Gopala , Pat Morin Algorithms for bivariate zonoid depth. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Burr , Eynat Rafalin , Diane L. Souvaine Simplicial depth: An improved definition, analysis, and efficiency for the finite sample case. [Citation Graph (0, 0)][DBLP ] Conf ] Stephane Durocher , David G. Kirkpatrick The gaussian centre and the projection centre of a set of points in r3 . [Citation Graph (0, 0)][DBLP ] Conf ] Jean Cardinal , Sébastien Collette , Stefan Langerman Local properties of geometric graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Bradford G. Nickerson , Qingxiu Shi Tries for combined text and spatial data range search. [Citation Graph (0, 0)][DBLP ] Conf ] Ding Liu , Bernard Chazelle , Avner Magen Approximate range searching in higher dimension. [Citation Graph (0, 0)][DBLP ] Conf ] Sean M. Falconer , Bradford G. Nickerson On multi-level k-ranges for range search. [Citation Graph (0, 0)][DBLP ] Conf ] Adrian Dumitrescu , Günter Rote On the Fréchet distance of a set of curves. [Citation Graph (0, 0)][DBLP ] Conf ] Francois Anton , Sergey Bereg The fitting line problem in the laguerre geometry. [Citation Graph (0, 0)][DBLP ] Conf ] David Bremner , David Gay Experimental lower bounds for three simplex chirality measures in low dimension. [Citation Graph (0, 0)][DBLP ] Conf ] Deok-Soo Kim , Youngsong Cho , Donguk Kim Edge-tracing algorithm for euclidean voronoi diagram of 3d spheres. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas F. Hain , Athar L. Ahmad , David D. Langan Precise flattening of cubic Bézier segments. [Citation Graph (0, 0)][DBLP ] Conf ] Hervé Brönnimann , Olivier Devillers , Sylvain Lazard , Frank Sottile On the number of line tangents to four triangles in three-dimensional space. [Citation Graph (0, 0)][DBLP ] Conf ] Nathanael Berglund , Andrzej Szymczak Making contour trees subdomain-aware. [Citation Graph (0, 0)][DBLP ] Conf ] Raja Jothi , Balaji Raghavachari Degree-bounded minimum spanning trees. [Citation Graph (0, 0)][DBLP ] Conf ] Susumu Suzuki , Toshihide Ibaraki An average running time analysis of a backtracking algorithm to calculate the measure of the union of hyperrectangles in $d$ dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Adrian Dumitrescu On some monotone path problems in line arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] Farshad Rostamabadi , Mohammad Ghodsi A fast algorithm for updating a labeling to avoid a moving point. [Citation Graph (0, 0)][DBLP ] Conf ] 