- 2010
- Mohammad Ali Abam, Sariel Har-Peled:
New constructions of SSPDs and their applications. SCG 2010: 192-200 - Umut A. Acar, Andrew Cotter, Benoît Hudson, Duru Türkoglu:
Dynamic well-spaced point sets. SCG 2010: 314-323 - Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen:
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements. SCG 2010: 240-246 - Pankaj K. Agarwal:
An improved algorithm for computing the volume of the union of cubes. SCG 2010: 230-239 - Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Computing similarity between piecewise-linear functions. SCG 2010: 375-383 - Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir:
The 2-center problem in three dimensions. SCG 2010: 87-96 - Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir:
Kinetic stable Delaunay graphs. SCG 2010: 127-136 - Omid Amini, Jean-Daniel Boissonnat, Pooran Memari:
Geometric tomography with topological guarantees. SCG 2010: 287-296 - Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom Pinchasi, Tillmann Miltzow:
Points with large quadrant-depth. SCG 2010: 358-364 - Lars Arge, Morten Revsbæk, Norbert Zeh:
I/O-efficient computation of water flow across a terrain. SCG 2010: 403-412 - Sunil Arya, David M. Mount, Jian Xia:
Tight lower bounds for halfspace range searching. SCG 2010: 29-37 - Dominique Attali, André Lieutier:
Optimal reconstruction might be hard. SCG 2010: 334-343 - Dominique Attali, André Lieutier:
Reconstructing shapes with guarantees by unions of convex sets. SCG 2010: 344-353 - Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza:
Improving the first selection lemma in R3. SCG 2010: 354-357 - Mark de Berg:
Better bounds on the union complexity of locally fat objects. SCG 2010: 39-47 - Florian Berger, Rolf Klein:
A traveller's problem. SCG 2010: 176-182 - Jean-Daniel Boissonnat, Arijit Ghosh:
Manifold reconstruction using tangential Delaunay complexes. SCG 2010: 324-333 - Karl Bringmann:
Klee's measure problem on fat boxes in time PARTIAL DIFFERENTIAL (n(d+2)/3). SCG 2010: 222-229 - Benjamin A. Burton:
The complexity of the normal surface solution space. SCG 2010: 201-209 - Sergio Cabello, Bojan Mohar:
Adding one edge to planar graphs makes crossing number hard. SCG 2010: 68-76 - Sergio Cabello, Éric Colin de Verdière, Francis Lazarus:
Output-sensitive algorithm for the edge-width of an embedded graph. SCG 2010: 147-155 - Sergio Cabello, Éric Colin de Verdière, Francis Lazarus:
Finding shortest non-trivial cycles in directed graphs on surfaces. SCG 2010: 156-165 - Timothy M. Chan:
Optimal partition trees. SCG 2010: 1-10 - Bernard Chazelle:
The geometry of flocking. SCG 2010: 19-28 - Bernard Chazelle:
A geometric approach to collective motion. SCG 2010: 117-126 - Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic:
Consistent digital line segments. SCG 2010: 11-18 - Tamal K. Dey, Jian Sun, Yusu Wang:
Approximating loops in a shortest homology basis from point data. SCG 2010: 166-175 - Harish Doraiswamy, Aneesh Sood, Vijay Natarajan:
Constructing Reeb graphs using cylinder maps. SCG 2010: 111-112 - Anne Driemel, Sariel Har-Peled, Carola Wenk:
Approximating the Fréchet distance for realistic curves in near linear time. SCG 2010: 365-374 - Adrian Dumitrescu, Evan Hilscher:
Convexification of polygons by length preserving transformations. SCG 2010: 113-114