Volume 34, Number 1, April 2006
Special Issue on the Japan Conference on Discrete and Computational Geometry 2004
- Jin Akiyama, Mikio Kano, Xuehou Tan:
Editorial.
1
- Jin Akiyama, Koichi Hirata, Midori Kobayashi, Gisaku Nakamura:
Convex developments of a regular tetrahedron.
2-10
- János Pach, Rados Radoicic, Jan Vondrák:
Nearly equal distances and Szemerédi's regularity lemma.
11-19
- Sergey Bereg, Prosenjit Bose, David G. Kirkpatrick:
Equitable subdivisions within polygonal regions.
20-27
- Rolf Klein, Christos Levcopoulos, Andrzej Lingas:
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation.
28-34
- Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel:
Moving coins.
35-48
Volume 34, Number 2, May 2006
- Stephan Eidenbenz:
Finding minimum hidden guard sets in polygons - tight approximability results.
49-57
- Clara I. Grima, Alberto Márquez, Lidia M. Ortega:
A new 2D tessellation for angle problems: The polar diagram.
58-74
- Hervé Brönnimann, Timothy M. Chan:
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time.
75-82
- Pankaj K. Agarwal, Nabil H. Mustafa:
Independent set of intersection graphs of convex objects in 2D.
83-95
- Christopher Dyken, Michael S. Floater:
Preferred directions for resolving the non-uniqueness of Delaunay triangulations.
96-101
- Sándor P. Fekete, Rolf Klein, Andreas Nüchter:
Online searching with an autonomous robot.
102-115
- Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood:
Partitions of complete geometric graphs into plane trees.
116-125
Volume 34, Number 3, July 2006
Last update Tue May 21 18:34:01 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
