Abstract is missing.
- Paul Erdös memorial lectureLuc Devroye. [doi]
- Proximate point searchingErik D. Demaine, John Iacono, Stefan Langerman. 1-4 [doi]
- Point location algorithms of minimum sizeValentina Damerow, Lukas Finschi, Martin Ziegler. 5-9 [doi]
- Using simplicial partitions to determine a closest point to a query lineAsish Mukhopadhyay. 10-12 [doi]
- On the hardness of turn-angle-restricted rectilinear cycle cover problemsStephane Durocher, David G. Kirkpatrick. 13-16 [doi]
- Ordered theta graphsProsenjit Bose, Joachim Gudmundsson, Pat Morin. 17-21 [doi]
- Logarithmic path-length in space-filling curvesJens-Michael Wierum. 22-26 [doi]
- On flat-state connectivity of chains with fixed acute anglesGreg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O Rourke, Ileana Streinu, Godfried T. Toussaint. 27-30 [doi]
- Push-2-f is pspace-completeErik D. Demaine, Robert A. Hearn, Michael Hoffmann. 31-35 [doi]
- Constructing convex 3-polytopes from two triangulations of a polygonBenjamin Marlin, Godfried T. Toussaint. 36-39 [doi]
- Hierarchical planar voronoi diagram approximationsImma Boada, Narcís Coll, Joan Antoni Sellarès. 40-44 [doi]
- The complexity of flow diagrams in the planeJoachim Giesen, Matthias John. 45-48 [doi]
- On sampling and reconstructing surfaces with boundariesMeenakshisundaram Gopi. 49-53 [doi]
- Efficient answering of polyhedral queries in r:::d::: using bbs-treesKhaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel. 54-57 [doi]
- Connecting points in the presence of obstacles in the planeMichael Hoffmann, Csaba D. Tóth. 63-67 [doi]
- Computing signed permutations of polygonsGreg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint. 68-71 [doi]
- An exact algebraic predicate for maintaining the topology of the voronoi diagram for circlesFrancois Anton, David G. Kirkpatrick, Darka Mioc. 72-76 [doi]
- A reliable algorithm for computing the generalized voronoi diagram for a set of spheres in the euclidean d-dimensional spaceMarina L. Gavrilova. 82-87 [doi]
- Partitioning a deformed urban gridLeonard Hagger, Ian Sanders. 88-92 [doi]
- Exact and approximation algorithms for computing ::::a::::-fat decompositionsMirela Damian-Iordache. 93-96 [doi]
- Partitioning orthogonal polygons into fat rectangles in polynomial timeJoseph O Rourke, Geetika Tewari. 97-100 [doi]
- Tighter bounds on the genus of nonorthogonal polyhedra built from rectanglesTherese C. Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang. 105-108 [doi]
- Cost-optimal quadtrees for ray shootingHervé Brönnimann, Marc Glisse, David R. Wood. 109-112 [doi]
- On the number of lines tangent to four convex polyhedraHervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides. 113-117 [doi]
- Computing closest points for segmentsSergei Bespamyatnikh. 118-122 [doi]
- A sweep line algorithm for nearest neighbour queriesJoao Dinis, Margarida Mamede. 123-127 [doi]
- On reverse nearest neighbor queriesAnil Maheshwari, Jan Vahrenhold, Norbert Zeh. 128-132 [doi]
- A near-quadratic algorithm for the alpha-connected two-center decision problemPo-Hsueh Huang, Yin-Te Tsai, Chuan Yi Tang. 133-136 [doi]
- Searching for the center of a circleTherese C. Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar. 137-141 [doi]
- Drawing ::::k::::::2::, ::::n::::: A lower boundTherese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz. 146-148 [doi]
- A linear algorithm for compact box-drawings of treesMasud Hasan, Md. Saidur Rahman, Takao Nishizeki. 154-157 [doi]
- Enumerating pseudo-triangulations in the planeSergei Bespamyatnikh. 162-166 [doi]
- Asymptotically efficient triangulations of the ::::d::::-cubeDavid Orden, Francisco Santos. 167-169 [doi]
- Constructing differentiable homeomorphisms between isomorphic triangulationsFrederick Crimins, Diane L. Souvaine. 170-173 [doi]
- A machine resolution of a four-color hoaxStan Wagon. 174-185 [doi]
- Cinderella: Computation, complexity, geometryUlrich Kortenkamp. 186-191 [doi]