Abstract is missing.
- A simple aggregative algorithm for counting triangulations of planar point sets and related problemsVictor Alvarez, Raimund Seidel. 1-8 [doi]
- A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinatesR. Sharathkumar. 9-16 [doi]
- A faster algorithm for computing motorcycle graphsAntoine Vigneron, Lie Yan. 17-26 [doi]
- The graphs of planar soap bubblesDavid Eppstein. 27-36 [doi]
- Efficiently hex-meshing things with topologyJeff Erickson. 37-46 [doi]
- Localized delaunay refinement for piecewise-smooth complexesTamal Krishna Dey, Andrew G. Slatton. 47-56 [doi]
- A parallel algorithm for computing the flow complexJoachim Giesen, Lars Kuehne. 57-66 [doi]
- Hyperbolic delaunay complexes and voronoi diagrams made practicalMikhail Bogdanov, Olivier Devillers, Monique Teillaud. 67-76 [doi]
- On a forgotten conjecture from a famous paper of ErdösImre Bárány, Edgardo Roldán-Pensado. 77-80 [doi]
- On planar point sets with the pentagon propertyJosef Cibulka, Jan Kyncl, Pavel Valtr. 81-90 [doi]
- Equal coefficients and tolerance in coloured tverberg partitionsPablo Soberón. 91-96 [doi]
- Improved bounds for incidences between points and circlesMicha Sharir, Adam Sheffer, Joshua Zahl. 97-106 [doi]
- Graph induced complex on point dataTamal Krishna Dey, Fengtao Fan, Yusu Wang. 107-116 [doi]
- 3Dominique Attali, Ulrich Bauer, Olivier Devillers, Marc Glisse, André Lieutier. 117-126 [doi]
- Parameterized complexity of discrete morse theoryBenjamin A. Burton, Thomas Lewiner, João Paixão, Jonathan Spreer. 127-136 [doi]
- Kinetic data structures for all nearest neighbors and closest pair in the planeZahed Rahmati, Valerie King, Sue Whitesides. 137-144 [doi]
- Kinetic 2-centers in the black-box modelMark de Berg, Marcel Roeloffzen, Bettina Speckmann. 145-154 [doi]
- Competitive query strategies for minimising the ply of the potential locations of moving pointsWilliam S. Evans, David G. Kirkpatrick, Maarten Löffler, Frank Staals. 155-164 [doi]
- Recent progress on the combinatorial diameter of polyhedra and simplicial complexesFrancisco Santos. 165-166 [doi]
- Complexity analysis of random geometric structures made simplerOlivier Devillers, Marc Glisse, Xavier Goaoc. 167-176 [doi]
- Union of random minkowski sums and network vulnerability analysisPankaj K. Agarwal, Haim Kaplan, Micha Sharir. 177-186 [doi]
- The maximum number of faces of the minkowski sum of three convex polytopesMenelaos I. Karavelas, Christos Konaxis, Eleni Tzanaki. 187-196 [doi]
- On the 2-sum embedding conjectureJames R. Lee, Daniel E. Poore. 197-206 [doi]
- Diverse near neighbor problemSofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi, Kasturi R. Varadarajan. 207-214 [doi]
- Compressive sensing using locality-preserving matricesElyot Grant, Piotr Indyk. 215-222 [doi]
- Range counting coresets for uncertain dataAmirali Abdullah, Samira Daruki, Jeff M. Phillips. 223-232 [doi]
- p, ε)-approximations for well-behaved range spacesEsther Ezra. 233-242 [doi]
- A constant-factor approximation for multi-covering with disksSantanu Bhowmick, Kasturi Varadarajan, Shi-Ke Xue. 243-248 [doi]
- Counting and sampling minimum cuts in genus g graphsErin W. Chambers, Kyle Fox, Amir Nayyeri. 249-258 [doi]
- Topological graphs: empty triangles and disjoint matchingsRadoslav Fulek, Andres J. Ruiz-Vargas. 259-266 [doi]
- Bichromatic compatible matchingsGreg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine. 267-276 [doi]
- Putting the turing into manufacturing: recent developments in algorithmic automationKenneth Y. Goldberg. 277-280 [doi]
- A new approach to output-sensitive voronoi diagrams and delaunay triangulationsGary L. Miller, Donald Sheehy. 281-288 [doi]
- A fast algorithm for well-spaced points and approximate delaunay graphsGary L. Miller, Donald Sheehy, Ameya Velingker. 289-298 [doi]
- Fast segment insertion and incremental construction of constrained delaunay triangulationsJonathan Richard Shewchuk, Brielin C. Brown. 299-308 [doi]
- Ramsey-type results for semi-algebraic relationsDavid Conlon, Jacob Fox, János Pach, Benny Sudakov, Andrew Suk. 309-318 [doi]
- Sharp bounds on Davenport-Schinzel sequences of every orderSeth Pettie. 319-328 [doi]
- Capture bounds for visibility-based pursuit evasionKyle Klein, Subhash Suri. 329-338 [doi]
- Polyominoes on twisted cylindersGill Barequet, Mira Shalah. 339-340 [doi]
- Interactive visualization of 3D configuration spacesJustin Stoecker, Victor Milenkovic. 341-342 [doi]
- Parametric search visualizationIvaylo Ilinkin. 343-344 [doi]
- Triangulating unknown environments using robot swarmsAaron Becker, Sándor P. Fekete, Alexander Kröller, SeoungKyou Lee, James McLurkin, Christiane Schmidt. 345-346 [doi]
- Point guards and point clouds: solving general art gallery problemsDorit Borrmann, Pedro J. de Rezende, Cid C. de Souza, Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Andreas Nüchter, Christiane Schmidt, Davi C. Tozoni. 347-348 [doi]
- On soft predicates in subdivision motion planningCong Wang, Yi-Jen Chiang, Chee Yap. 349-358 [doi]
- A near-optimal algorithm for shortest paths among curved obstacles in the planeJohn Hershberger, Subhash Suri, Hakan Yildiz. 359-368 [doi]
- Computing shortest paths among curved obstacles in the planeDanny Z. Chen, Haitao Wang. 369-378 [doi]
- The complexity of separating points in the planeSergio Cabello, Panos Giannopoulos. 379-386 [doi]
- Zigzag zoology: rips zigzags for homology inferenceSteve Y. Oudot, Donald Sheehy. 387-396 [doi]
- Geometry in the space of persistence modulesVin de Silva, Vidit Nanda. 397-404 [doi]
- Computing closed essential surfaces in knot complementsBenjamin A. Burton, Alexander Coward, Stephan Tillmann. 405-414 [doi]
- A new approach to crushing 3-manifold triangulationsBenjamin A. Burton. 415-424 [doi]
- Measuring similarity between curves on 2-manifolds via homotopy areaErin Wolf Chambers, Yusu Wang. 425-434 [doi]
- Lower bounds for k-distance approximationQuentin Mérigot. 435-440 [doi]
- Systems of distant representatives in euclidean spaceAdrian Dumitrescu, Minghui Jiang. 441-448 [doi]
- Robust geometric spannersProsenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid. 449-458 [doi]