| Record ID | marc_records_scriblio_net/part19.dat:183311586:997 |
| Source | Scriblio |
| Download Link | /show-records/marc_records_scriblio_net/part19.dat:183311586:997?format=raw |
LEADER: 00997nam 2200253 a 4500
001 87621771
003 DLC
005 19880714101340.7
008 880107s1987 ilua b s00010 eng
010 $a 87621771
050 0 $aQA76$b.I4 no. 1325$aQA640.3
100 10 $aChazelle, B.$q(Bernard)
245 14 $aThe complexity of cutting complexes /$cby B. Chazelle, H. Edelsbrunner, L.J. Guibas.
260 0 $aUrbana, Il (1304 W. Springfield Ave., Urbana 61801) :$bDept. of Computer Science, University of Illinois at Urbana-Champaign,$c[1987]
300 $a48 p. :$bill. ;$c28 cm.
490 1 $aReport ;$vno.UIUCDCS-R-87-1325
500 $a"March 1987."
504 $aBibliography: p. 48.
500 $a"UILU-ENG-87-1712"--Cover.
650 0 $aConvex polytopes.
650 0 $aCombinatorial geometry$xData processing.
700 10 $aEdelsbrunner, Herbert.
700 10 $aGuibas, Leonidas J.
830 0 $aReport (University of Illinois at Urbana-Champaign. Dept. of Computer Science) ;$vno. UIUCDCS-R-87-1325.