Conferences in DBLP
János Pach , Gábor Tardos Forbidden patterns and unit distances. [Citation Graph (0, 0)][DBLP ] Conf ] Otfried Cheong , Xavier Goaoc , Andreas Holmsen Hadwiger and Helly-type theorems for disjoint unit spheres in R3 . [Citation Graph (0, 0)][DBLP ] Conf ] György Elekes , Csaba D. Tóth Incidences of not-too-degenerate hyperplanes. [Citation Graph (0, 0)][DBLP ] Conf ] Esther Ezra Almost tight bound for a single cell in an arrangement of convex polyhedra in R3 . [Citation Graph (0, 0)][DBLP ] Conf ] Pier Francesco Cortese , Giuseppe Di Battista Clustered planarity. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen , Xiaobo Sharon Hu , Chao Wang , Xiaodong Wu Mountain reduction, block matching, and applications in intensity-modulated radiation therapy. [Citation Graph (0, 0)][DBLP ] Conf ] Eran Eyal , Dan Halperin Dynamic maintenance of molecular surfaces under conformational changes. [Citation Graph (0, 0)][DBLP ] Conf ] Sergey Bereg , Adrian Dumitrescu The lifting model for reconfiguration. [Citation Graph (0, 0)][DBLP ] Conf ] Ron Wein , Jur P. van den Berg , Dan Halperin The Visibility-Voronoi Complex and Its Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Sergey Bereg Certifying and constructing minimally rigid graphs in the plane. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Hoffmann , Csaba D. Tóth Pointed and colored binary encompassing trees. [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , Hannes Krasser Abstract order type extension and new results on the rectilinear crossing number. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Berberich , Michael Hemmer , Lutz Kettner , Elmar Schömer , Nicola Wolpert An exact, complete and efficient implementation for computing planar maps of quadric intersection curves. [Citation Graph (0, 0)][DBLP ] Conf ] Raimund Seidel , Nicola Wolpert On the exact computation of the topology of real algebraic curves. [Citation Graph (0, 0)][DBLP ] Conf ] Ee-Chien Chang , Sung Woo Choi , DoYong Kwon , Hyungju Park , Chee-Keng Yap Shortest path amidst disc obstacles is computable. [Citation Graph (0, 0)][DBLP ] Conf ] Sariel Har-Peled , Akash Kushal Smaller coresets for k-median and k-means clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Kenneth L. Clarkson , Kasturi R. Varadarajan Improved approximation algorithms for geometric set cover. [Citation Graph (0, 0)][DBLP ] Conf ] Gereon Frahling , Piotr Indyk , Christian Sohler Sampling in dynamic data streams and applications. [Citation Graph (0, 0)][DBLP ] Conf ] Sariel Har-Peled , Manor Mendel Fast construction of nets in low dimensional metrics, and their applications. [Citation Graph (0, 0)][DBLP ] Conf ] Jacob E. Goodman Double-permutation sequences and pseudoline transversals. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Arge , Gerth Stølting Brodal , Rolf Fagerberg , Morten Laustsen Cache-oblivious planar orthogonal range searching and counting. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Arge , Mark de Berg , Herman J. Haverkort Cache-oblivious r-trees. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan , Eric Y. Chen Multi-pass geometric algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Mohammad Ali Abam , Mark de Berg Kinetic sorting and kinetic convex hulls. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Daniel Boissonnat , Leonidas J. Guibas , Steve Oudot Learning smooth objects by probing. [Citation Graph (0, 0)][DBLP ] Conf ] Siu-Wing Cheng , Yajun Wang , Zhuangzhi Wu Provable dimension detection using principal component analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey , Joachim Giesen , Edgar A. Ramos , Bardia Sadri Critical points of the distance to an epsilon-sampling of a surface and flow-complex-based surface reconstruction. [Citation Graph (0, 0)][DBLP ] Conf ] Sariel Har-Peled , Alper Üngör A time-optimal delaunay refinement algorithm in two dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Jonathan Richard Shewchuk Star splaying: an algorithm for repairing delaunay triangulations and convex hulls. [Citation Graph (0, 0)][DBLP ] Conf ] Dominique Attali , Herbert Edelsbrunner Inclusion-exclusion formulas from independent complexes. [Citation Graph (0, 0)][DBLP ] Conf ] Frédéric Chazal , André Lieutier Weak feature size and persistent homology: computing homology of solids in Rn from noisy data samples. [Citation Graph (0, 0)][DBLP ] Conf ] David Cohen-Steiner , Herbert Edelsbrunner , John Harer Stability of persistence diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] David Cohen-Steiner , Herbert Edelsbrunner Inequalities for the curvature of curves and surfaces. [Citation Graph (0, 0)][DBLP ] Conf ] Sergey Bereg , David G. Kirkpatrick Curvature-bounded traversals of narrow corridors. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg Vertical ray shooting for fat objects. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein , Michael T. Goodrich , Jonathan Z. Sun The skip quadtree: a simple dynamic data structure for multidimensional data. [Citation Graph (0, 0)][DBLP ] Conf ] Yakov Nekrich Space efficient dynamic orthogonal range reporting. [Citation Graph (0, 0)][DBLP ] Conf ] Alireza Zarei , Mohammad Ghodsi Efficient computation of query point visibility in polygons with holes. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein , Kevin A. Wortman Minimum dilation stars. [Citation Graph (0, 0)][DBLP ] Conf ] Mohammad Farshi , Panos Giannopoulos , Joachim Gudmundsson Finding the best shortcut in a geometric network. [Citation Graph (0, 0)][DBLP ] Conf ] Friedrich Eisenbrand , Stefan Funke , Andreas Karrenbauer , Domagoj Matijevic Energy-aware stage illumination. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Sergey Bereg , Ovidiu Daescu , Haim Kaplan , Simeon C. Ntafos , Binhai Zhu Guarding a terrain by two watchtowers. [Citation Graph (0, 0)][DBLP ] Conf ] Hee-Kap Ahn , Otfried Cheong , Chong-Dae Park , Chan-Su Shin , Antoine Vigneron Maximizing the overlap of two planar convex sets under rigid motions. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Daniel Boissonnat , Leonidas J. Guibas , Steve Oudot Learning smooth objects by probing. [Citation Graph (0, 0)][DBLP ] Conf ] Tobias Lenz Reconstructing collections of arbitrary curves. [Citation Graph (0, 0)][DBLP ] Conf ] Vikas Singh , Lopamudra Mukherjee , Jinhui Xu , Kenneth R. Hoffmann , Guang Xu , Zhenming Chen Efficient geometric techniques for reconstructing 3D vessel trees from biplane image. [Citation Graph (0, 0)][DBLP ] Conf ] Ajith Mascarenhas , Jack Snoeyink Implementing time-varying contour trees. [Citation Graph (0, 0)][DBLP ] Conf ] Sander Florisson , Marc J. van Kreveld , Bettina Speckmann Rectangular cartograms: construction & animation. [Citation Graph (0, 0)][DBLP ] Conf ] Kim Hansen , Stephen K. Wismath Animation of curve constrained drawings of planar graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Gill Barequet , Yuval Scharf , Matthew T. Dickerson Covering points with a polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Ovidiu Daescu , James D. Palmer 1-link shortest paths in weighted regions. [Citation Graph (0, 0)][DBLP ] Conf ] A. G. Oliveira , Pedro Jussieu de Rezende , F. P. Selmi-Dei An extension of CGAL to the oriented projective plane T2 and its dynamic visualization system. [Citation Graph (0, 0)][DBLP ] Conf ] Efi Fogel , Dan Halperin Exact Minkowski sums of convex polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Naga K. Govindaraju , Ming C. Lin , Dinesh Manocha Fast and reliable collision detection using graphics processors. [Citation Graph (0, 0)][DBLP ] Conf ] 