LEADER 03726nam  22007215  450 
001 996465760703316
005 20200629131423.0
010   $a3-540-47259-2
024 7 $a10.1007/3-540-55611-7
035   $a(CKB)1000000000233837
035   $a(SSID)ssj0000321565
035   $a(PQKBManifestationID)11235568
035   $a(PQKBTitleCode)TC0000321565
035   $a(PQKBWorkID)10279923
035   $a(PQKB)10483061
035   $a(DE-He213)978-3-540-47259-9
035   $a(PPN)155188402
035   $a(EXLCZ)991000000000233837
100   $a20121227d1992      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aAxioms and Hulls$b[electronic resource] /$fby Donald E. Knuth
205   $a1st ed. 1992.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1992.
215   $a1 online resource (X, 114 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v606
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-55611-7 
330   $aOne way to advance the science of computational geometry is to make a comprehensive study of fundamental operations that are used in many different algorithms. This monograph attempts such an investigation in the case of two basic predicates: the counterclockwise relation pqr, which states that the circle through points (p, q, r) is traversed counterclockwise when we encounter the points in cyclic order p, q, r, p,...; and the incircle relation pqrs, which states that s lies inside that circle if pqr is true, or outside that circle if pqr is false. The author, Donald Knuth, is one of the greatest computer scientists of our time. A few years ago, he and some of his students were looking at amap that pinpointed the locations of about 100 cities. They asked, "Which ofthese cities are neighbors of each other?" They knew intuitively that some pairs of cities were neighbors and some were not; they wanted to find a formal mathematical characterization that would match their intuition.This monograph is the result.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v606
606   $aComputers
606   $aApplication software
606   $aDiscrete mathematics
606   $aComputer graphics
606   $aAlgorithms
606   $aCombinatorics
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aComputer Applications$3https://scigraph.springernature.com/ontologies/product-market-codes/I23001
606   $aDiscrete Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29000
606   $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010
615  0$aComputers.
615  0$aApplication software.
615  0$aDiscrete mathematics.
615  0$aComputer graphics.
615  0$aAlgorithms.
615  0$aCombinatorics.
615 14$aTheory of Computation.
615 24$aComputer Applications.
615 24$aDiscrete Mathematics.
615 24$aComputer Graphics.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aCombinatorics.
676   $a516/.08
700   $aKnuth$b Donald E$4aut$4http://id.loc.gov/vocabulary/relators/aut$048274
906   $aBOOK
912   $a996465760703316
996   $aAxioms and hulls$932591
997   $aUNISA