Conferences in DBLP
Pankaj K. Agarwal , Hai Yu A space-optimal data-stream algorithm for coresets in the plane. [Citation Graph (0, 0)][DBLP ] Conf ] Dan Feldman , Morteza Monemizadeh , Christian Sohler A PTAS for k-means clustering based on weak coresets. [Citation Graph (0, 0)][DBLP ] Conf ] Dan Feldman , Amos Fiat , Micha Sharir , Danny Segev Bi-criteria linear-time approximations for generalized k-mean/median/center. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein , Michael T. Goodrich , Nodari Sitchinava Guard placement for efficient point-in-polygon proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Hee-Kap Ahn , Sang Won Bae , Otfried Cheong , Joachim Gudmundsson Aperture-angle and Hausdorff-approximation of convex figures. [Citation Graph (0, 0)][DBLP ] Conf ] Sergey Bereg , Prosenjit Bose , Adrian Dumitrescu , Ferran Hurtado , Pavel Valtr Traversing a set of points with a minimum number of turns. [Citation Graph (0, 0)][DBLP ] Conf ] Valentin Polishchuk , Joseph S. B. Mitchell Thick non-crossing paths and minimum-cost flows in polygonal domains. [Citation Graph (0, 0)][DBLP ] Conf ] Jonathan Backer , David Kirkpatrick Finding curvature-constrained paths that avoid polygonal obstacles. [Citation Graph (0, 0)][DBLP ] Conf ] Yevgeny Schreiber Shortest paths on realistic polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Siu-Wing Cheng , Hyeon-Suk Na , Antoine Vigneron , Yajun Wang Querying approximate shortest paths in anisotropic regions. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Happy endings for flip graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Adrian Dumitrescu , Ichiro Suzuki , Pawel Zylinski Offline variants of the "lion and man" problem. [Citation Graph (0, 0)][DBLP ] Conf ] Ares Ribó Mor , Günter Rote , André Schulz Embedding 3-polytopes on a small grid. [Citation Graph (0, 0)][DBLP ] Conf ] Frédéric Cazals , Sebastien Loriot Computing the exact arrangement of circles on a sphere, with applications in structural biology: video. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Nielsen , Jean-Daniel Boissonnat , Richard Nock Visualizing bregman voronoi diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Balint Miklos , Joachim Giesen , Mark Pauly Medial axis approximation from inner Voronoi balls: a demo of the Mesecina tool. [Citation Graph (0, 0)][DBLP ] Conf ] Kevin Buchin , André Schulz Inflating the cube by shrinking. [Citation Graph (0, 0)][DBLP ] Conf ] Gill Barequet , Alina Shaikhet Heilbronn's triangle problem. [Citation Graph (0, 0)][DBLP ] Conf ] Umut A. Acar , Guy E. Blelloch , Kanat Tangwongsan Kinetic 3D convex hulls via self-adjusting computation. [Citation Graph (0, 0)][DBLP ] Conf ] Linqiao Zhang , Hazel Everett , Sylvain Lazard , Sue Whitesides Towards an implementation of the 3D visibility skeleton. [Citation Graph (0, 0)][DBLP ] Conf ] János Pach , Géza Tóth Decomposition of multiple coverings into many parts. [Citation Graph (0, 0)][DBLP ] Conf ] Saurabh Ray , Nabil H. Mustafa An optimal generalization of the centerpoint theorem, and its extensions. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Ackerman , Kevin Buchin , Christian Knauer , Rom Pinchasi , Günter Rote There are not too many magic configurations. [Citation Graph (0, 0)][DBLP ] Conf ] Yuanxin Liu , Jack Snoeyink Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Arno Eigenwillig , Lutz Kettner , Nicola Wolpert Snap rounding of Bézier curves. [Citation Graph (0, 0)][DBLP ] Conf ] Lilian Buzer Optimal simplification of polygonal chain for rendering. [Citation Graph (0, 0)][DBLP ] Conf ] Mohammad Ali Abam , Mark de Berg , Peter Hachenberger , Alireza Zarei Streaming algorithms for line simplification. [Citation Graph (0, 0)][DBLP ] Conf ] Gunnar Carlsson , Afra Zomorodian The theory of multidimensional persistence. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Daniel Boissonnat , Leonidas J. Guibas , Steve Oudot Manifold reconstruction in arbitrary dimensions using witness complexes. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk , Anastasios Sidiropoulos Probabilistic embeddings of bounded genus graphs into planar graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Mirela Ben-Chen , Craig Gotsman , Camille Wormser Distributed computation of virtual coordinates. [Citation Graph (0, 0)][DBLP ] Conf ] Esther Ezra , János Pach , Micha Sharir On regular vertices on the union of planar objects. [Citation Graph (0, 0)][DBLP ] Conf ] József Solymosi , Gábor Tardos On the number of k-rich transformations. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Roel Apfelbaum , George B. Purdy , Micha Sharir Similar simplices in a d-dimensional point set. [Citation Graph (0, 0)][DBLP ] Conf ] Saurabh Ray , Nabil H. Mustafa Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension. [Citation Graph (0, 0)][DBLP ] Conf ] Ciprian Borcea , Xavier Goaoc , Sylvain Petitjean Line transversals to disjoint balls. [Citation Graph (0, 0)][DBLP ] Conf ] Hazel Everett , Sylvain Lazard , Daniel Lazard , Mohab Safey El Din The voronoi diagram of three lines. [Citation Graph (0, 0)][DBLP ] Conf ] Julien Demouth , Olivier Devillers , Hazel Everett , Marc Glisse , Sylvain Lazard , Raimund Seidel Between umbra and penumbra. [Citation Graph (0, 0)][DBLP ] Conf ] Darko Dimitrov , Christian Knauer , Klaus Kriegel , Günter Rote New upper bounds on the quality of the PCA bounding boxes in r2 and r3 . [Citation Graph (0, 0)][DBLP ] Conf ] Victor Chepoi , Karim Nouioua Pareto envelopes in R3 under l1 and linfinity distance functions. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Haim Kaplan , Micha Sharir Computing the volume of the union of cubes. [Citation Graph (0, 0)][DBLP ] Conf ] Luis Rademacher Approximating the centroid is hard. [Citation Graph (0, 0)][DBLP ] Conf ] Hans Raj Tiwary On the hardness of minkowski addition and related operations. [Citation Graph (0, 0)][DBLP ] Conf ] Thorsten Bernholt , Friedrich Eisenbrand , Thomas Hofmeister A geometric framework for solving subsequence problems in computational biology efficiently. [Citation Graph (0, 0)][DBLP ] Conf ] Efi Fogel , Dan Halperin , Christophe Weibel On the exact maximum complexity of Minkowski sums of convex polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Sariel Har-Peled , Micha Sharir On approximate halfspace range counting and relative epsilon-approximations. [Citation Graph (0, 0)][DBLP ] Conf ] Peyman Afshani , Timothy M. Chan On approximate range counting and depth. [Citation Graph (0, 0)][DBLP ] Conf ] Yakov Nekrich A data structure for multi-dimensional range reporting. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Mihai Patrascu Tight bounds for dynamic convex hull queries (again). [Citation Graph (0, 0)][DBLP ] Conf ] Mohammad Ali Abam , Mark de Berg , Bettina Speckmann Kinetic KD-trees and longest-side KD-trees. [Citation Graph (0, 0)][DBLP ] Conf ] Liam Roditty Fully dynamic geometric spanners. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Sariel Har-Peled , Hai Yu Embeddings of surfaces, curves, and moving points in euclidean space. [Citation Graph (0, 0)][DBLP ] Conf ] 