David Rappaport. Tight Bounds for Visibility Matching of f-Equal Width Objects. In Jin Akiyama, Mikio Kano, editors, Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers. Volume 2866 of Lecture Notes in Computer Science, pages 246-250, Springer, 2002. [doi]
@inproceedings{Rappaport02,
title = {Tight Bounds for Visibility Matching of f-Equal Width Objects},
author = {David Rappaport},
year = {2002},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2866&spage=246},
researchr = {https://researchr.org/publication/Rappaport02},
cites = {0},
citedby = {0},
pages = {246-250},
booktitle = {Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers},
editor = {Jin Akiyama and Mikio Kano},
volume = {2866},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-20776-7},
}