Volume 20,
Number 1,
February 2010
- Takeshi Tokuyama:
Foreword.
1-2
- Eric Y. Chen:
Geometric Streaming Algorithm with a Sorting Primitive.
3-18
- Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle:
Finding Popular Places.
19-42
- Jinhui Xu, Yang Yang, Yongding Zhu, Naoki Katoh:
A Geometric Spanner of Segments.
43-67
- Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang:
Dilation-Optimal Edge Deletion in Polygonal Cycles.
69-87
- Boris Aronov, Tetsuo Asano, Stefan Funke:
Optimal Triangulations of Points and Segments with Steiner Points.
89-104
Volume 20,
Number 2,
April 2010
- Sergey Bereg, Adrian Dumitrescu, Minghui Jiang:
Maximum Area Independent Sets in Disk Intersection Graphs.
105-118
- Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta:
Generalized Watchman Route Problem with Discrete View Cost.
119-146
- Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx:
Computing Geometric Minimum-Dilation Graphs is NP-Hard.
147-173
- Tsunehiko Kameda, John Z. Zhang:
Finding All Door Locations that Make a Room Searchable.
175-201
- Mark de Berg, Elena Mumford, Bettina Speckmann:
Optimal BSPs and Rectilinear Cartograms.
203-222
- Andrzej Zak:
Dissections of Polygons into Convex Polygons.
223-244
Volume 20,
Number 3,
June 2010
- Erik D. Demaine, John Iacono, Stefan Langerman:
Grid Vertex-Unfolding Orthostacks.
245-254
- Yoav Gabriely, Elon Rimon:
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems.
255-283
- Frédéric Chazal, André Lieutier, Jarek Rossignac, Brian Whited:
Ball-Map: Homeomorphism between Compatible Surfaces.
285-306
- Tom Kamphans, Elmar Langetepe:
Leaving an Unknown Maze Using an Error-Prone Compass.
307-325
- Peter Brass, Hyeon-Suk Na, Chan-Su Shin:
Guarding a Polygon from Two Nearly-Opposite Directions.
327-339
- Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw:
A Lower Bound on the Area of a 3-Coloured Disk Packing.
341-360
- Rodrigo I. Silveira, René van Oostrum:
Flooding Countries and Destroying dams.
361-380
Volume 20,
Number 4,
August 2010
- Chris Gray, Maarten Löffler, Rodrigo I. Silveira:
Smoothing Imprecise 1.5D Terrains.
381-414
- Sanjiv Kapoor, Xiang-Yang Li:
Proximity Structures for Geometric Graphs.
415-429
- Pankaj Kumar, Piyush Kumar:
Almost Optimal Solutions to k-Clustering Problems.
431-447
- Danny Z. Chen, Ewa Misiolek:
Finding Many Optimal Paths without Growing any Optimal Path Trees.
449-469
- Sergey Bereg, Kevin Buchin, Maike Buchin, Marina L. Gavrilova, Binhai Zhu:
Voronoi Diagram of Polygonal Chains under the Discrete FRéChet Distance.
471-484
- Victor Milenkovic, Elisha Sacks:
Two Approximate Minkowski Sum Algorithms.
485-509
Volume 20,
Number 5,
October 2010
- Andrea Anghinolfi, Luca Costa, Massimo Ferri, Enrico Viarani:
A Covering Projection for Robot Navigation under Strong anisotropy.
511-525
- Mikio Kano, Miyuki Uno:
Balanced Subdivisions with Boundary Condition of Two Sets of Points in the Plane.
527-541
- Ranjith Unnikrishnan, Jean-François Lalonde, Nicolas Vandapel, Martial Hebert:
Scale Selection for Geometric Fitting in Noisy Point Clouds.
543-575
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Constrained Point-Set Embeddability of Planar Graphs.
577-600
- Yoav Amit, Joseph S. B. Mitchell, Eli Packer:
Locating Guards for Visibility Coverage of Polygons.
601-630
Volume 20,
Number 6,
December 2010
Last update Sat May 26 06:25:51 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
