Abstract is missing.
- On topological changes in the delaunay triangulation of moving pointsNatan Rubin. 1-10 [doi]
- Geometric packing under non-uniform constraintsAlina Ene, Sariel Har-Peled, Benjamin Raichel. 11-20 [doi]
- Computing cartograms with optimal complexityMd. Jawaherul Alam, Therese C. Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt. 21-30 [doi]
- Approximate bregman near neighbors in sublinear time: beyond the triangle inequalityAmirali Abdullah, John Moeller, Suresh Venkatasubramanian. 31-40 [doi]
- The point-set embeddability problem for plane graphsTherese C. Biedl, Martin Vatshelle. 41-50 [doi]
- Algorithmic complexity of finding cross-cycles in flag complexesMichal Adamaszek, Juraj Stacho. 51-60 [doi]
- Counting crossing-free structuresVictor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray. 61-68 [doi]
- A fast and simple surface reconstruction algorithmSiu-Wing Cheng, Jiongxin Jin, Man-Kit Lau. 69-78 [doi]
- Protein molecules in 3D: complex behavior from simple local geometry plus weak interactionsJane S. Richardson, David C. Richardson. 79-80 [doi]
- Higher-order Erdös: Szekeres theoremsMarek Eliáý, Jiõí Matouýek. 81-90 [doi]
- Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensionsHerbert Edelsbrunner, Brittany Terese Fasy, Günter Rote. 91-100 [doi]
- On the expected complexity of voronoi diagrams on terrainsAnne Driemel, Sariel Har-Peled, Benjamin Raichel. 101-110 [doi]
- On Klee's measure problem for grounded boxesHakan Yildiz, Subhash Suri. 111-120 [doi]
- How to walk your dog in the mountains with no magic leashSariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos. 121-130 [doi]
- Tracing compressed curves in triangulated surfacesJeff Erickson, Amir Nayyeri. 131-140 [doi]
- Testing graph isotopies on surfacesArnaud de Mesmay, Éric Colin de Verdière. 141-150 [doi]
- On laplacians of random complexesAnna Gundert, Uli Wagner. 151-160 [doi]
- Approximating low-dimensional coverage problemsAshwinkumar Badanidiyuru, Robert Kleinberg, Hooyeon Lee. 161-170 [doi]
- Improved range searching lower boundsKasper Green Larsen, Huy Le Nguyen. 171-178 [doi]
- An output-sensitive algorithm for computing projections of resultant polytopesIoannis Z. Emiris, Vissarion Fisikopoulos, Christos Konaxis, Luis Mariano Peñaranda. 179-188 [doi]
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's techniqueMicha Sharir, Adam Sheffer, Emo Welzl. 189-198 [doi]
- Mappings and meshesChristopher J. Bishop. 199-200 [doi]
- Cubic plane graphs on a given point setJens M. Schmidt, Pavel Valtr. 201-208 [doi]
- Multinerves and helly numbers of acyclic familiesÉric Colin de Verdière, Grégory Ginot, Xavier Goaoc. 209-218 [doi]
- Duals of orphan-free anisotropic voronoi diagrams are embedded meshesGuillermo D. Cañas, Steven J. Gortler. 219-228 [doi]
- Stability of Delaunay-type structures for manifolds: [extended abstract]Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh. 229-238 [doi]
- Linear-size approximations to the vietoris-rips filtrationDonald Sheehy. 239-248 [doi]
- Alexander duality for functions: the persistent behavior of land and water and shoreHerbert Edelsbrunner, Michael Kerber. 249-258 [doi]
- Certified computation of planar morse-smale complexesGert Vegter, Amit Chattopadhyay, Chee-Keng Yap. 259-268 [doi]
- o(m log m) time algorithm for the reeb graphSalman Parsa. 269-276 [doi]
- Self-improving algorithms for coordinate-wise maximaKenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri. 277-286 [doi]
- Finding the maximal empty disk containing a query pointHaim Kaplan, Micha Sharir. 287-292 [doi]
- Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent setTimothy M. Chan. 293-302 [doi]
- Approximating Tverberg points in linear time for any fixed dimensionWolfgang Mulzer, Daniel Werner. 303-310 [doi]
- Tessellation analysis of the cosmic webRien van de Weygaert. 311-312 [doi]
- Stabbing horizontal segments with vertical raysYufei Tao. 313-322 [doi]
- Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine modelPeyman Afshani, Lars Arge, Kasper Green Larsen. 323-332 [doi]
- A theorem of bárány revisited and extendedNabil H. Mustafa, Saurabh Ray. 333-338 [doi]
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problemsPeyman Afshani. 339-346 [doi]
- Periodic body-and-bar frameworksCiprian Borcea, Ileana Streinu, Shin-ichi Tanigawa. 347-356 [doi]
- On sub-determinants and the diameter of polyhedraNicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier. 357-362 [doi]
- Optimal area-sensitive bounds for polytope approximationSunil Arya, Guilherme Dias da Fonseca, David M. Mount. 363-372 [doi]
- Object-image correspondence for curves under central and parallel projectionsJoseph M. Burdis, Irina A. Kogan. 373-382 [doi]
- Disjoint edges in complete topological graphsAndrew Suk. 383-386 [doi]
- Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensionsAbhijin Adiga, L. Sunil Chandran. 387-396 [doi]
- nBernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar. 397-404 [doi]
- String graphs and incomparability graphsJacob Fox, János Pach. 405-414 [doi]
- Configuration space visualizationDror Atariah, Günter Rote. 415-416 [doi]
- Surface patches from unorganized space curvesFatemeh Abbasinejad, Pushkar Joshi, Nina Amenta. 417-418 [doi]
- Lang's universal molecule algorithmJohn Christopher Bowers, Ileana Streinu. 419-420 [doi]
- The sticky geometry of the cosmic webJohan Hidding, Rien van de Weygaert, Gert Vegter, Bernard J. T. Jones, Monique Teillaud. 421-422 [doi]