Conferences in DBLP
Jonathan Richard Shewchuk Mesh generation for domains with small angles. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Daniel Boissonnat , Olivier Devillers , Monique Teillaud , Mariette Yvinec Triangulations in CGAL (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Müller-Hannemann Improving the surface cycle structure for hexahedral mesh generation. [Citation Graph (0, 0)][DBLP ] Conf ] Ioannis Z. Emiris Computing integer points in Minkowski sums. [Citation Graph (0, 0)][DBLP ] Conf ] Géza Tóth Point sets with many k -sets. [Citation Graph (0, 0)][DBLP ] Conf ] Micha Sharir , Shakhar Smorodinsky , Gábor Tardos An improved bound for k -sets in three dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Uli Wagner , Emo Welzl Origin-embracing distributions or a continuous analogue of the upper bound theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Jacob E. Goodman , Richard Pollack , Rephael Wenger A Helly-type theorem for hyperplane transversals to well-separated convex sets. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , Alexey Lvov A trace bound for the hereditary discrepancy. [Citation Graph (0, 0)][DBLP ] Conf ] Sándor P. Fekete , Joseph S. B. Mitchell , Karin Weinbrecht On the continuous Weber and k -median problems (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Dan Halperin , Micha Sharir , Kenneth Y. Goldberg The 2-center problem with obstacles. [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Gärtner , Emo Welzl Random sampling in geometric optimization: new insights and applications. [Citation Graph (0, 0)][DBLP ] Conf ] Tapas Kanungo , David M. Mount , Nathan S. Netanyahu , Christine D. Piatko , Ruth Silverman , Angela Y. Wu The analysis of a simple k -means clustering algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Gärtner , Sven Schönherr An efficient, exact, and generic quadratic programming solver for geometric optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Nina Amenta , Ravi Krishna Kolluri Accurate and efficient unions of balls. [Citation Graph (0, 0)][DBLP ] Conf ] Afra Zomorodian , Herbert Edelsbrunner Fast software for box intersections. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Devillers , Alexandra Fronville , Bernard Mourrain , Monique Teillaud Algebraic methods and arithmetic filtering for exact predicates on circle arcs. [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Gärtner Pitfalls in computing with pseudorandom determinants. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Funke , Kurt Mehlhorn Look - a Lazy Object-Oriented Kernel for geometric computation. [Citation Graph (0, 0)][DBLP ] Conf ] Sariel Har-Peled , Piotr Indyk When crossings count - approximating the minimum spanning tree. [Citation Graph (0, 0)][DBLP ] Conf ] Edgar A. Ramos Linear programming queries revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Srinivas Doddi , Madhav V. Marathe , Bernard M. E. Moret Point set labeling with specified positions. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Arge , Jan Vahrenhold I/O-efficient dynamic planar point location (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Nancy M. Amato , Michael T. Goodrich , Edgar A. Ramos Linear-time triangulation of a simple polygon made easier via randomization. [Citation Graph (0, 0)][DBLP ] Conf ] Nina Amenta , Sunghee Choi , Tamal K. Dey , N. Leekha A simple algorithm for homeomorphic surface reconstruction. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Daniel Boissonnat , Frédéric Cazals Smooth surface reconstruction via natural neighbour interpolation of distance functions. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey , Rephael Wenger Reconstruction curves with sharp corners. [Citation Graph (0, 0)][DBLP ] Conf ] Hisamoto Hiyoshi , Kokichi Sugihara Voronoi-based interpolation with higher continuity. [Citation Graph (0, 0)][DBLP ] Conf ] Hee-Kap Ahn , Otfried Cheong , Jirí Matousek , Antoine Vigneron Reachability by paths of bounded curvature in convex polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Steven M. LaValle , Borislav H. Simov , Giora Slutzki An algorithm for searching a polygonal region with a flashlight. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Sariel Har-Peled , Meetesh Karia Computing approximate shortest paths on convex polytopes. [Citation Graph (0, 0)][DBLP ] Conf ] Victor Milenkovic Densest tanslational lattice packing of non-convex polygons (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Edgar A. Ramos Deterministic algorithms for 3-D diameter and some 2-D lower envelopes. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Braß , Christian Knauer Testing the congruence of d-dimensional point sets. [Citation Graph (0, 0)][DBLP ] Conf ] Marshall W. Bern , David Eppstein Multivariate regression depth. [Citation Graph (0, 0)][DBLP ] Conf ] David G. Kirkpatrick , Jack Snoeyink , Bettina Speckmann Kinetic collision detection for simple polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas J. Guibas , John Hershberger , Subhash Suri , Li Zhang Kinetic connectivity for unit disks. [Citation Graph (0, 0)][DBLP ] Conf ] Greg Leibon , David Letscher Delaunay triangulations and Voronoi diagrams for Riemannian manifolds. [Citation Graph (0, 0)][DBLP ] Conf ] Jonathan Richard Shewchuk Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] János Pach , Gábor Tardos Cutting glass. [Citation Graph (0, 0)][DBLP ] Conf ] Jesús A. De Loera , Frederick J. Wicklin Viro's method disproves Ragsdale's conjecture: a story. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Fleischer , Gerhard Trippen Optimal robot localization in trees. [Citation Graph (0, 0)][DBLP ] Conf ] Kenneth E. Hoff III , Tim Culver , John Keyser , Ming C. Lin , Dinesh Manocha Fast computation of generalized Voronoi diagrams using graphics hardware. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Isenburg , Jack Snoeyink The face fixer video. [Citation Graph (0, 0)][DBLP ] Conf ] 