Conferences in DBLP
Prosenjit Bose , Erik D. Demaine , Ferran Hurtado , John Iacono , Stefan Langerman , Pat Morin Geodesic ham-sandwich cuts. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:1-9 [Conf ] Erik D. Demaine , Jeff Erickson , Ferran Hurtado , John Iacono , Stefan Langerman , Henk Meijer , Mark H. Overmars , Sue Whitesides Separating point sets in polygonal environments. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:10-16 [Conf ] Jyh-Ming Lien , Nancy M. Amato Approximate convex decomposition of polygons. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:17-26 [Conf ] Boaz Ben-Moshe , Olaf Hall-Holt , Matthew J. Katz , Joseph S. B. Mitchell Computing the visibility graph of points within a polygon. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:27-35 [Conf ] Pankaj K. Agarwal , Boris Aronov , Vladlen Koltun , Micha Sharir On lines avoiding unit balls in three dimensions. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:36-45 [Conf ] Hervé Brönnimann , Olivier Devillers , Vida Dujmovic , Hazel Everett , Marc Glisse , Xavier Goaoc , Sylvain Lazard , Hyeon-Suk Na , Sue Whitesides The number of lines tangent to arbitrary convex polyhedra in 3D. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:46-55 [Conf ] Günter M. Ziegler Random monotone paths on polyhedra. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:56- [Conf ] Adrian Dumitrescu On distinct distances from a vertex of a convex polygon. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:57-60 [Conf ] Pankaj K. Agarwal , Micha Sharir , Emo Welzl Algorithms for center and Tverberg points. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:61-67 [Conf ] János Pach , Rados Radoicic , Gábor Tardos , Géza Tóth Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:68-75 [Conf ] János Pach , Rom Pinchasi , Micha Sharir Solution of Scott's problem on the number of directions determined by a point set in 3-space. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:76-85 [Conf ] Ron Wein , Oleg Ilushin , Gershon Elber , Dan Halperin Continuous path verification in multi-axis NC-machining. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:86-95 [Conf ] Stefan Funke , Theocharis Malamatos , Rahul Ray Finding planar regions in a terrain: in practice and with a guarantree. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:96-105 [Conf ] Sathish Govindarajan , Mike Dietze , Pankaj K. Agarwal , James S. Clark A scalable simulator for forest dynamics. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:106-115 [Conf ] Adrian Dumitrescu , János Pach Pushing squares around. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:116-123 [Conf ] Joseph S. B. Mitchell , Micha Sharir New results on shortest paths in three dimensions. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:124-133 [Conf ] Jason H. Cantarella , Erik D. Demaine , Hayley N. Iben , James F. O'Brien An energy-driven approach to linkage unfolding. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:134-143 [Conf ] Amitabha Bagchi , Amitabh Chaudhary , David Eppstein , Michael T. Goodrich Deterministic sampling and range counting in geometric data streams. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:144-151 [Conf ] Timothy M. Chan Faster core-set constructions and data stream algorithms in fixed dimensions. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:152-159 [Conf ] Subhash Suri , Csaba D. Tóth , Yunhong Zhou Range counting over multidimensional data streams. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:160-169 [Conf ] Leonidas J. Guibas , Daniel Russel An empirical comparison of techniques for updating Delaunay triangulations. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:170-179 [Conf ] Pankaj K. Agarwal , Yusu Wang , Hai Yu A 2D kinetic triangulation with near-quadratic topological changes. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:180-189 [Conf ] Jie Gao , Leonidas J. Guibas , An Nguyen Deformable spanners and applications. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:190-199 [Conf ] David M. Mount , Nathan S. Netanyahu , Christine D. Piatko , Ruth Silverman , Angela Y. Wu A computational framework for incremental motion. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:200-209 [Conf ] Esther Ezra , Micha Sharir Counting and representing intersections among triangles in three dimensions. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:210-219 [Conf ] Ilya Baran , Erik D. Demaine Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:220-229 [Conf ] John Hershberger , Subhash Suri , Csaba D. Tóth Binary space partitions of orthogonal subdivisions. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:230-238 [Conf ] Hervé Brönnimann , Timothy M. Chan , Eric Y. Chen Towards in-place geometric algorithms and data structures. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:239-246 [Conf ] Pankaj K. Agarwal , Kasturi R. Varadarajan A near-linear constant-factor approximation for euclidean bipartite matching? [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:247-252 [Conf ] Mayur Datar , Nicole Immorlica , Piotr Indyk , Vahab S. Mirrokni Locality-sensitive hashing scheme based on p-stable distributions. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:253-262 [Conf ] Hai Yu , Pankaj K. Agarwal , Raghunath Poreddy , Kasturi R. Varadarajan Practical methods for shape fitting and kinetic data structures using core sets. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:263-272 [Conf ] Jeff Erickson , Sariel Har-Peled , David M. Mount On the least median square problem. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:273-279 [Conf ] Siu-Wing Cheng , Tamal K. Dey , Edgar A. Ramos , Tathagata Ray Sampling and meshing a surface with guaranteed topology and geometry. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:280-289 [Conf ] Siu-Wing Cheng , Tamal K. Dey , Edgar A. Ramos , Tathagata Ray Quality meshing for polyhedra with small angles. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:290-299 [Conf ] Reza Abedi , Shuo-Heng Chung , Jeff Erickson , Yong Fan , Michael Garland , Damrong Guoy , Robert Haber , John M. Sullivan , Shripad Thite , Yuan Zhou Spacetime meshing with adaptive refinement and coarsening. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:300-309 [Conf ] David E. Cardoze , Alexandre Cunha , Gary L. Miller , Todd Phillips , Noel Walkington A Bézier-based approach to unstructured moving meshes. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:310-319 [Conf ] Mihai Badoiu , Erik D. Demaine , Mohammad Taghi Hajiaghayi , Piotr Indyk Low-dimensional embedding with extra information. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:320-329 [Conf ] Tamal K. Dey , Samrat Goswami Provable surface reconstruction from noisy samples. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:330-339 [Conf ] Christian A. Duncan , David Eppstein , Stephen G. Kobourov The geometric thickness of low degree graphs. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:340-346 [Conf ] Afra Zomorodian , Gunnar Carlsson Computing persistent homology. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:347-356 [Conf ] Pankaj K. Agarwal , Herbert Edelsbrunner , John Harer , Yusu Wang Extreme elevation on a 2-manifold. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:357-365 [Conf ] Herbert Edelsbrunner , John Harer , Ajith Mascarenhas , Valerio Pascucci Time-varying reeb graphs for continuous space-time data. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:366-372 [Conf ] Uri Laserson , Hin Hark Gan , Tamar Schlick Searching for 2D RNA geometries in bacterial genomes. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:373-377 [Conf ] Rom Pinchasi , Shakhar Smorodinsky On locally Delaunay geometric graphs. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:378-382 [Conf ] Boris Aronov , Alon Efrat , Vladlen Koltun , Micha Sharir On the union of kapa-round objects. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:383-390 [Conf ] Rom Pinchasi , Rados Radoicic , Micha Sharir On empty convex polygons in a planar point set. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:391-400 [Conf ] Bohdan Kaluzny , Komei Fukuda The criss-cross method can take Omega(n^{d} ) pivots. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:401-408 [Conf ] Arno Eigenwillig , Lutz Kettner , Elmar Schömer , Nicola Wolpert Complete, exact, and efficient computations with cubic curves. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:409-418 [Conf ] Sylvain Lazard , Luis Mariano Peñaranda , Sylvain Petitjean Intersecting quadrics: an efficient and exact implementation. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:419-428 [Conf ] Olivier Devillers , Philippe Guigue Inner and outer rounding of set operations on lattice polygonal regions. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:429-437 [Conf ] Ioannis Z. Emiris , Athanasios Kakargias , Sylvain Pion , Monique Teillaud , Elias P. Tsigaridas Towards and open curved kernel. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:438-446 [Conf ] Russel A. Apu , Marina L. Gavrilova Adaptive mesh generation for real-time terrain modeling. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:447-448 [Conf ] Sándor P. Fekete , Rolf Klein , Andreas Nüchter Searching with an autonomous robot. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:449-450 [Conf ] Cesim Erten , Stephen G. Kobourov , Chandan Pitta Morphing planar graphs. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:451-452 [Conf ] Olaf A. Hall-Holt The corner arc algorithm. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:453-454 [Conf ] David Eppstein , M. Gopi Single-strip triangulation of manifolds with arbitrary topology. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:455-456 [Conf ] Jyh-Ming Lien , Nancy M. Amato Approximate convex decomposition. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:457-458 [Conf ]