One 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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Antiquariat Deinbacher, Murstetten, Österreich
8° , Softcover/Paperback. 1.Auflage,. vii, 109 Seiten Einband etwas berieben, Bibl.Ex., innen guter und sauberer Zustand 9783540556114 Sprache: Englisch Gewicht in Gramm: 250. Artikel-Nr. 141171
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Artikel-Nr. ria9783540556114_new
Anzahl: Mehr als 20 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - One way to advance the science of computational geometry isto make a comprehensive study of fundamental operations thatare used in many different algorithms. This monographattempts such an investigation in the case of two basicpredicates: the counterclockwise relation pqr, which statesthat the circle through points (p, q, r) is traversedcounterclockwise when we encounter the points in cyclicorder p, q, r, p,.; and the incircle relation pqrs, whichstates that s lies inside that circle if pqr is true, oroutside that circle if pqr is false. The author, DonaldKnuth, is one of the greatest computer scientists of ourtime. A few years ago, he and some of his students werelooking at amap that pinpointed the locations of about 100cities. They asked, 'Which ofthese cities are neighbors ofeach other ' They knew intuitively that some pairs of citieswere neighbors and some were not; they wanted to find aformal mathematical characterization that would match theirintuition.This monograph is the result. Artikel-Nr. 9783540556114
Anzahl: 1 verfügbar
Anbieter: Buchpark, Trebbin, Deutschland
Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | One way to advance the science of computational geometry isto make a comprehensive study of fundamental operations thatare used in many different algorithms. This monographattempts such an investigation in the case of two basicpredicates: the counterclockwise relation pqr, which statesthat the circle through points (p, q, r) is traversedcounterclockwise when we encounter the points in cyclicorder p, q, r, p,.; and the incircle relation pqrs, whichstates that s lies inside that circle if pqr is true, oroutside that circle if pqr is false. The author, DonaldKnuth, is one of the greatest computer scientists of ourtime. A few years ago, he and some of his students werelooking at amap that pinpointed the locations of about 100cities. They asked, "Which ofthese cities are neighbors ofeach other?" They knew intuitively that some pairs of citieswere neighbors and some were not; they wanted to find aformal mathematical characterization that would match theirintuition.This monograph is the result. Artikel-Nr. 3946052/2
Anzahl: 1 verfügbar