Volume 47, Issue 4 | Discrete & Computational Geometry

Search all Discrete & Computational Geometry articles

Volume 47, Issue 4

June 2012

Special Issue: 26th Annual Symposium on Computational Geometry; Guest Editor: David Kirkpatrick

Issue Editor:

David Kirkpatrick

6 articles in this issue

Guest Editor’s Foreword
David Kirkpatrick
OriginalPaper 23 February 2012 Pages: 659 - 660
Optimal Partition Trees
Timothy M. Chan
OriginalPaper 24 February 2012 Pages: 661 - 690
Consistent Digital Line Segments
Tobias Christ
Dömötör Pálvölgyi
Miloš Stojaković
OriginalPaper 28 February 2012 Pages: 691 - 710
Tight Lower Bounds for Halfspace Range Searching
Sunil Arya
David M. Mount
Jian Xia
OriginalPaper 28 February 2012 Pages: 711 - 730
Linkless and Flat Embeddings in 3-Space
Ken-ichi Kawarabayashi
Stephan Kreutzer
Bojan Mohar
OriginalPaper 16 March 2012 Pages: 731 - 755
On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions
Marc Glisse
Sylvain Lazard
OriginalPaper 24 February 2012 Pages: 756 - 772