Journal of Computational Geometry, Volume 6
Articles
Ronald Ortner:
Forcing subarrangements in complete arrangements of pseudocircles. 235-248 Danny Z. Chen,
Haitao Wang:
A new algorithm for computing visibility graphs of polygonal obstacles in the plane. 316-345
Special issue of Selected Papers from SoCG 2014
Tal Kaminker,
Micha Sharir:
Finding the largest disk containing a query point in logarithmic time with linear storage. 3-18 Shay Solomon:
Euclidean Steiner shallow-light trees. 113-139
maintained by

, founded at
