Conferences in DBLP
René van Oostrum , Remco C. Veltkamp Parametric search made practical. [Citation Graph (0, 0)][DBLP ] Conf ] Tapas Kanungo , David M. Mount , Nathan S. Netanyahu , Christine D. Piatko , Ruth Silverman , Angela Y. Wu A local search approximation algorithm for k-means clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , Franz Aurenhammer , Hannes Krasser On the crossing number of complete graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ciprian Borcea , Ileana Streinu On the number of embeddings of minimally rigid graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas J. Guibas , An Nguyen , Daniel Russel , Li Zhang Collision detection for deforming necklaces. [Citation Graph (0, 0)][DBLP ] Conf ] Itay Lotan , Fabian Schwarzer , Dan Halperin , Jean-Claude Latombe Efficient maintenance and self-collision testing for Kinematic Chains. [Citation Graph (0, 0)][DBLP ] Conf ] Herman J. Haverkort , Mark de Berg , Joachim Gudmundsson Box-trees for collision checking in industrial installations. [Citation Graph (0, 0)][DBLP ] Conf ] Nathan Linial Finite metric spaces: combinatorics, geometry and algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] L. Paul Chew , Klara Kedem Finding the consensus shape for a protein family. [Citation Graph (0, 0)][DBLP ] Conf ] Marshall W. Bern , David Goldberg Paper position sensing. [Citation Graph (0, 0)][DBLP ] Conf ] David Goldberg , Christopher Malon , Marshall W. Bern A global approach to automatic solution of jigsaw puzzles. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle The power of nonmonotonicity in geometric searching. [Citation Graph (0, 0)][DBLP ] Conf ] Ilan Newman , Yuri Rabinovich A lower bound on the distortion of embedding planar metrics into Euclidean space. [Citation Graph (0, 0)][DBLP ] Conf ] Otfried Cheong , Sariel Har-Peled , Nathan Linial , Jirí Matousek The one-round Voronoi game. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk Approximate nearest neighbor algorithms for Frechet distance via product metrics. [Citation Graph (0, 0)][DBLP ] Conf ] Micha Sharir , Emo Welzl Point-line incidences in space. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Vladlen Koltun , Micha Sharir Incidences between points and circles in three and higher dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Eran Nevo , János Pach , Rom Pinchasi , Micha Sharir , Shakhar Smorodinsky Lenses in arrangements of pseudo-circles and their applications. [Citation Graph (0, 0)][DBLP ] Conf ] Günter Rote Pseudotriangulations, polytopes, and how to expand linkages. [Citation Graph (0, 0)][DBLP ] Conf ] Démian Nave , Nikos Chrisochoides , L. Paul Chew Guaranteed: quality parallel delaunay refinement for restricted polyhedral domains. [Citation Graph (0, 0)][DBLP ] Conf ] Sunghee Choi The Delaunay tetrahedralization from Delaunay triangulated surfaces Sunghee Choi. [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , Franz Aurenhammer , Belén Palop Quickest paths, straight skeletons, and the city Voronoi diagram. [Citation Graph (0, 0)][DBLP ] Conf ] Sergio Cabello , Yuanxin Liu , Andrea Mantler , Jack Snoeyink Testing Homotopy for paths in the plane. [Citation Graph (0, 0)][DBLP ] Conf ] Tetsuo Asano , David G. Kirkpatrick , Chee-Keng Yap Pseudo approximation algorithms, with applications to optimal motion planning. [Citation Graph (0, 0)][DBLP ] Conf ] David G. Kirkpatrick , Bettina Speckmann Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Stefan Langerman , Joseph O'Rourke , Jack Snoeyink Interlocked open linkages with few joints. [Citation Graph (0, 0)][DBLP ] Conf ] David Cohen-Steiner , Éric Colin de Verdière , Mariette Yvinec Conforming Delaunay triangulations in 3D. [Citation Graph (0, 0)][DBLP ] Conf ] Mordecai J. Golin , Hyeon-Suk Na The probabilistic complexity of the Voronoi diagram of points on a polyhedron. [Citation Graph (0, 0)][DBLP ] Conf ] Vladlen Koltun , Micha Sharir Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations. [Citation Graph (0, 0)][DBLP ] Conf ] Vladlen Koltun , Micha Sharir Polyhedral Voronoi diagrams of polyhedra in three dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , David Eppstein , Jeff Erickson , George W. Hart , Joseph O'Rourke Vertex-unfoldings of simplicial manifolds. [Citation Graph (0, 0)][DBLP ] Conf ] Jeff Erickson , Sariel Har-Peled Optimally cutting a surface into a disk. [Citation Graph (0, 0)][DBLP ] Conf ] Regina Estkowski , Joseph S. B. Mitchell , Xinyu Xiang Optimal decomposition of polygonal models into triangle strips. [Citation Graph (0, 0)][DBLP ] Conf ] Igor Guskov , Andrei Khodakovsky , Peter Schröder , Wim Sweldens Hybrid meshes: multiresolution using regular and irregular refinement. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Flato , Efi Fogel , Dan Halperin , Eran Leiserowitz Exact minkowski sums and applications. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Kotzor , Thorsten Theobald Homotopy techniques for real-time visualization of geometric tangent problems. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Efrat , Stephen G. Kobourov , Michael Stepp , Carola Wenk Growing fat graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Bogomjakov , Craig Gotsman AUTO-FOLLOW: getting a piece of the action all the time. [Citation Graph (0, 0)][DBLP ] Conf ] Stanislav V. Klimenko , Gregory M. Nielson , Lialia Nikitina , Igor N. Nikitin Adventures of Möbius band: mathematical visualization in virtual environment. [Citation Graph (0, 0)][DBLP ] Conf ] Hayim Shaul , Dan Halperin Improved construction of vertical decompositions of three-dimensional arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Hervé Brönnimann , Allen Y. Chang , Yi-Jen Chiang Cost prediction for ray shooting. [Citation Graph (0, 0)][DBLP ] Conf ] Boaz Ben-Moshe , Joseph S. B. Mitchell , Matthew J. Katz , Yuval Nir Visibility preserving terrain simplification: an experimental study. [Citation Graph (0, 0)][DBLP ] Conf ] Sariel Har-Peled , Kasturi R. Varadarajan Projective clustering in high dimensions using core-sets. [Citation Graph (0, 0)][DBLP ] Conf ] 