| Record ID | marc_loc_2016/BooksAll.2016.part19.utf8:60874509:1016 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_2016/BooksAll.2016.part19.utf8:60874509:1016?format=raw |
LEADER: 01016cam a2200253 a 4500
001 88622226
003 DLC
005 20130418092721.0
008 900217s1988 ilua b s000 0 eng
010 $a 88622226
040 $aDLC$cDLC$dDLC
050 00 $aQA76$b.I4 no. 1419$aQA608
082 00 $a004 s$a516/.183$220
100 1 $aChazelle, B.$q(Bernard)
245 13 $aAn optimal algorithm for intersecting line segments in the plane /$cby Bernard Chazelle and Herbert Edelsbrunner.
260 $aUrbana (1303 W. Springfield Ave., Urbana 61801) :$bDept. of Computer Science, University of Illinois at Urbana-Champaign,$c[1988]
300 $a70 p. :$bill. ;$c28 cm.
490 1 $aReport ;$vno. UIUCDCS-R-88-1419
500 $a"March 1988."
504 $aBibliography: p. 69-70.
500 $a"UILU-ENG-88-1724"--Cover.
650 0 $aLine geometry$xData processing.
700 1 $aEdelsbrunner, Herbert.
830 0 $aReport (University of Illinois at Urbana-Champaign. Department of Computer Science) ;$vno. UIUCDCS-R-88-1419.