Abstract is missing.
- Orthogonal range searching on the RAM, revisitedTimothy M. Chan, Kasper Green Larsen, Mihai Patrascu. 1-10 [doi]
- Convex hull of imprecise points in ::::o(n log n):::: time after preprocessingEsther Ezra, Wolfgang Mulzer. 11-20 [doi]
- Three problems about dynamic convex hullsTimothy M. Chan. 27-36 [doi]
- Metric graph reconstruction from noisy dataMridul Aanjaneya, Frédéric Chazal, Daniel Chen, Marc Glisse, Leonidas J. Guibas, Dmitriy Morozov. 37-46 [doi]
- Comparing distributions and shapes using the kernel distanceSarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phillips, Suresh Venkatasubramanian. 47-56 [doi]
- Witnessed k-distanceLeonidas J. Guibas, Quentin Mérigot, Dmitriy Morozov. 57-64 [doi]
- Stochastic minimum spanning trees in euclidean spacesPegah Kamousi, Timothy M. Chan, Subhash Suri. 65-74 [doi]
- Can they cross? and how?: (the hitchhiker s guide to the universe of geometric intersection graphs)Jan Kratochvíl. 75-76 [doi]
- Exploiting temporal coherence in forest dynamics simulationPankaj K. Agarwal, Thomas Mølhave, Hai Yu, James S. Clark. 77-86 [doi]
- Compressive sensing with local geometric featuresRishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin. 87-96 [doi]
- Persistence-based clustering in riemannian manifoldsFrédéric Chazal, Leonidas J. Guibas, Steve Y. Oudot, Primoz Skraba. 97-106 [doi]
- A kuratowski-type theorem for planarity of partially embedded graphsVít Jelínek, Jan Kratochvíl, Ignaz Rutter. 107-116 [doi]
- A center transversal theorem for hyperplanes and applications to graph drawingVida Dujmovic, Stefan Langerman. 117-124 [doi]
- Disjoint compatible geometric matchingsMashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth. 125-134 [doi]
- The least spanning area of a knot and the optimal bounding chain problemNathan M. Dunfield, Anil N. Hirani. 135-144 [doi]
- A tree traversal algorithm for decision problems in knot theory and 3-manifold topologyBenjamin A. Burton, Melih Ozlen. 145-152 [doi]
- Space crossing numbersBoris Bukh, Alfredo Hubard. 163-170 [doi]
- Theoretical and practical results on straight skeletons of planar straight-line graphsStefan Huber, Martin Held. 171-178 [doi]
- A generic algebraic kernel for non-linear geometric applicationsEric Berberich, Michael Hemmer, Michael Kerber. 179-186 [doi]
- Deconstructing approximate offsetsEric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova. 187-196 [doi]
- Stable snap roundingJohn Hershberger. 197-206 [doi]
- An output-sensitive algorithm for persistent homologyChao Chen, Michael Kerber. 207-216 [doi]
- Zigzag persistent homology in matrix multiplication timeNikola Milosavljevic, Dmitriy Morozov, Primoz Skraba. 216-225 [doi]
- Reeb graphs: approximation and persistenceTamal K. Dey, Yusu Wang. 226-235 [doi]
- Shortest non-trivial cycles in directed surface graphsJeff Erickson. 236-243 [doi]
- Kinetic convex hulls and delaunay triangulations in the black-box modelMark de Berg, Marcel Roeloffzen, Bettina Speckmann. 244-253 [doi]
- The geometric stability of voronoi diagrams with respect to small changes of the sitesDaniel Reem. 254-263 [doi]
- Improved upper bound on the stretch factor of delaunay triangulationsGe Xia. 264-273 [doi]
- Delaunay triangulations of point sets in closed euclidean d-manifoldsManuel Caroli, Monique Teillaud. 274-282 [doi]
- Redelmeier s algorithm for counting lattice animalsGadi Aleksandrowicz, Gill Barequet. 283-284 [doi]
- Geometric computation with smart pixelsPaul Accisano, Alper Üngör. 285-286 [doi]
- Ant-sweep: a decentral strategy for cooperative cleaning in expanding domainsThilo Beckmann, Rolf Klein, David Kriesel, Elmar Langetepe. 287-288 [doi]
- Visualization of discrete gradient constructionAttila Gyulassy, Joshua A. Levine, Valerio Pascucci. 289-290 [doi]
- Fitting spheres to electron densityJack Snoeyink, Vishal Verma. 291-292 [doi]
- Minimum perimeter convex hull of imprecise points in convex regionsChristophe Weibel, Linqiao Zhang. 293-294 [doi]
- A pedagogic JavaScript program for point location strategiesOlivier Devillers, Pedro Machado Manhães de Castro. 295-296 [doi]
- Answering geographic questions with user generated content: experiences from the coal faceRoss S. Purves. 297-299 [doi]
- Integer representations of convex polygon intersection graphsTobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen. 300-307 [doi]
- Sphere and dot product representations of graphsRoss J. Kang, Tobias Müller. 308-314 [doi]
- Contact representations of planar graphs with cubesStefan Felsner, Mathew C. Francis. 315-320 [doi]
- Beating the spread: time-optimal point meshingGary L. Miller, Todd Phillips, Don Sheehy. 321-330 [doi]
- Edge flips and deforming surface meshesSiu-Wing Cheng, Jiongxin Jin. 331-340 [doi]
- Kinetic mesh refinement in 2DUmut A. Acar, Benoît Hudson, Duru Türkoglu. 341-350 [doi]
- Minors in random and expanding hypergraphsUli Wagner. 351-360 [doi]
- On the structure and composition of forbidden sequences, with geometric applicationsSeth Pettie. 370-379 [doi]
- A new upper bound for the VC-dimension of visibility regionsAlexander Gilbers, Rolf Klein. 380-386 [doi]
- Guarding polyominoesTherese C. Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell. 387-396 [doi]
- Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanesMenelaos I. Karavelas, Eleni Tzanaki. 397-406 [doi]
- Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygonsMohammad Ali Abam, Boris Aronov, Mark de Berg, AmirAli Khosravi. 407-416 [doi]
- Covering cubes and the closest vector problemFriedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier. 417-423 [doi]
- The potential to improve the choice: list conflict-free coloring for geometric hypergraphsPanagiotis Cheilaris, Shakhar Smorodinsky, Marek Sulovský. 424-432 [doi]
- On the euclidean bottleneck full Steiner tree problemA. Karim Abu-Affash. 433-439 [doi]
- The euclidean bottleneck steiner path problemA. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal. 440-447 [doi]
- The frechet distance revisited and extendedSariel Har-Peled, Benjamin Raichel. 448-457 [doi]
- Tight lower bounds for the size of epsilon-netsJános Pach, Gábor Tardos. 458-463 [doi]
- No dimension independent core-sets for containment under homotheticsRené Brandenberg, Stefan König. 464-471 [doi]
- Extremal reaches in polynomial timeCiprian Borcea, Ileana Streinu. 472-480 [doi]
- Exact workspace boundary by extremal reachesCiprian Borcea, Ileana Streinu. 481-490 [doi]
- Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapesDominique Attali, André Lieutier, David Salinas. 491-500 [doi]
- Efficient data structure for representing and simplifying simplicial complexes in high dimensionsDominique Attali, André Lieutier, David Salinas. 501-509 [doi]
- Boundary of a non-uniform point cloud for reconstruction: extended abstractNicolas Chevallier, Yvan Maillot. 510-518 [doi]