Abstract is missing.
- A unified algorithm for adaptive spacetime meshing with nonlocal cone constraintsShripad Thite. 1-4 [doi]
- Quality triangulations made smallerAlper Üngör. 5-8 [doi]
- The relative neighbourhood graph is a part of every 30°-triangulationJ. Mark Keil, Tzvetalin S. Vassilev. 9-12 [doi]
- Bounds on optimally triangulating connected subsets of the minimum weight convex partitionMagdalene Grantson, Christos Levcopoulos. 13-16 [doi]
- Incremental construction along space-filling curvesKevin Buchin. 17-20 [doi]
- Region counting graphsJean Cardinal, Sébastien Collette, Stefan Langerman. 21-24 [doi]
- Homotopic spannersSergio Cabello, Bojan Mohar, Arjana Zitnik. 25-28 [doi]
- Finding the best shortcut in a geometric networkMohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson. 29-32 [doi]
- An exclusion region for minimum dilation triangulationsChristian Knauer, Wolfgang Mulzer. 33-36 [doi]
- Improved lower bound on the geometric dilation of point setsAdrian Dumitrescu, Ansgar Grüne, Günter Rote. 37-40 [doi]
- On computing Fréchet distance of two paths on a convex polyhedronAnil Maheshwari, Jiehua Yi. 41-44 [doi]
- Semi-computability of the Fréchet distance between surfacesHelmut Alt, Maike Buchin. 45-48 [doi]
- Matching surfaces with characteristic pointsDarko Dimitrov, Christian Knauer, Klaus Kriegel. 49-51 [doi]
- Approximation algorithms for the Earth mover s distance under transformations using reference pointsOliver Klein, Remco C. Veltkamp. 53-56 [doi]
- Matching point sets with respect to the Earth mover s distanceSergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote. 57-60 [doi]
- Abstract order type extension and new results on the rectilinear crossing numberOswin Aichholzer, Hannes Krasser. 61-64 [doi]
- Quadrangulations and 2-colorationsCarmen Cortés, Alberto Márquez, Atsuhiro Nakamoto, Jesus Valenzuela. 65-68 [doi]
- Discrete curvatures and Gauss maps for polyhedral surfacesLyuba Alboul, Gilberto Echeverria, Marcos A. Rodrigues. 69-72 [doi]
- On the number of facets of three-dimensional Dirichlet stereohedra III: Cubic groupPilar Sabariego, Francisco Santos. 73-76 [doi]
- A pointed Delaunay pseudo-triangulation of a simple polygonGünter Rote, André Schulz. 77-80 [doi]
- Transforming spanning trees and pseudo-triangulationsOswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser. 81-84 [doi]
- Pseudo-tetrahedral complexesFranz Aurenhammer, Hannes Krasser. 85-88 [doi]
- On pseudo-convex decompositions, partitions, and coveringsOswin Aichholzer, Clemens Huemer, Sarah Renkl, Bettina Speckmann, Csaba D. Tóth. 89-92 [doi]
- Pointed binary encompassing trees: Simple and optimalMichael Hoffmann, Csaba D. Tóth. 93-96 [doi]
- Approximate multi-visibility map computationNarcÃs Coll, Marta Fort, Joan Antoni Sellarès. 97-100 [doi]
- Approximation schemes for the generalized geometric problems with geographic clusteringCorinne Feremans, Alexander Grigoriev. 101-102 [doi]
- Approximation algorithm for the L1-fitting circle problemSariel Har-Peled. 103-106 [doi]
- Competitive online searching for a ray in the planeAndrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen. 107-110 [doi]
- On optimizing multi-sequence functionals for competitive analysisTom Kamphans, Elmar Langetepe. 111-114 [doi]
- Minimizing local minima in terrains with higher-order Delaunay triangulationsThierry de Kok, Marc J. van Kreveld, Maarten Löffler. 115-118 [doi]
- On properties of higher-order Delaunay graphs with applicationsManuel Abellanas, Prosenjit Bose, Jesús GarcÃa, Ferran Hurtado, Mariano Nicolás, Pedro A. Ramos. 119-122 [doi]
- Constructing higher-order Voronoi diagrams in parallelHenning Meyerhenke. 123-126 [doi]
- Delineating boundaries for imprecise regionsIris Reinbacher, Marc Benkert, Marc J. van Kreveld, Alexander Wolff. 127-130 [doi]
- An efficient algorithm for label updating in 2PM model to avoid a moving objectFarshad Rostamabadi, Mohammad Ghodsi. 131-134 [doi]
- Exact analysis of optimal configurations in radii computationsRené Brandenberg, Thorsten Theobald. 135-138 [doi]
- Boolean operations on 3D selective Nef complexes: Optimized implementation and experimentsPeter Hachenberger, Lutz Kettner. 139-142 [doi]
- Ternary blending operationsGalina Pasko, Alexander A. Pasko, Tosiyasu L. Kunii. 143-145 [doi]
- Algebraic study of the Apollonius circle of three ellipsesIoannis Z. Emiris, George M. Tzoumas. 147-150 [doi]
- The visibility-Voronoi complex and its applicationsRon Wein, Jur P. van den Berg, Dan Halperin. 151-154 [doi]
- Constructing the city Voronoi diagram fasterRobert Görke, Alexander Wolff. 155-158 [doi]
- Computing transportation Voronoi diagrams in optimal timeYaron Ostrovsky-Berman. 159-162 [doi]
- Approximations of 3D generalized Voronoi diagramsImma Boada, NarcÃs Coll, Narcis Madern, Joan Antoni Sellarès. 163-166 [doi]
- Average case complexity of Voronoi diagrams of n sites from the unit cubeMarcin Bienkowski, Valentina Damerow, Friedhelm Meyer auf der Heide, Christian Sohler. 167-170 [doi]
- Lower bounds for kinetic sortingMohammad Ali Abam, Mark de Berg. 171-174 [doi]
- Uncertainty envelopesYaron Ostrovsky-Berman, Leo Joskowicz. 175-178 [doi]
- Covering point sets with two convex objectsJosé Miguel DÃaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura. 179-182 [doi]
- Maximum line-pair stabbing problem and its variationsSebastian Böcker, Veli Mäkinen. 183-186 [doi]
- The fastest way to view a query point in simple polygonsRamtin Khosravi, Mohammad Ghodsi. 187-190 [doi]
- The minimum area spanning tree problemPaz Carmi, Matthew J. Katz. 191-194 [doi]
- Spanning trees with few crossings in geometric and topological graphsChristian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff. 195-198 [doi]
- Bi-chromatic minimum spanning treesMagdalene Grantson, Henk Meijer, David Rappaport. 199-202 [doi]
- Constructing interference-minimal networksMarc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff. 203-206 [doi]
- A note on simultaneous embedding of planar graphsEmilio Di Giacomo, Giuseppe Liotta. 207-210 [doi]