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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Antiquariat Deinbacher, Murstetten, Austria
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. Nº de ref. del artículo: 141171
Cantidad disponible: 1 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9783540556114_new
Cantidad disponible: Más de 20 disponibles
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
Paperback. Condición: New. 1992 ed. 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 E. Knuth, is one of the greatest computer scientists of our time. A few years ago, he and some of his students were looking at a map that pinpointed the locations of about 100 cities. They asked, "Which of these cities are neighbours of each other?" They knew intuitively that some pairs of cities were neighbours and some were not; they wanted to find a formal mathematical characterization that would match their intuition. This monograph is the result. Nº de ref. del artículo: LU-9783540556114
Cantidad disponible: Más de 20 disponibles
Librería: Chiron Media, Wallingford, Reino Unido
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9783540556114
Cantidad disponible: 10 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 124 pp. Englisch. Nº de ref. del artículo: 9783540556114
Cantidad disponible: 2 disponibles
Librería: BennettBooksLtd, Los Angeles, CA, Estados Unidos de America
paperback. Condición: New. In shrink wrap. Looks like an interesting title! Nº de ref. del artículo: Q-3540556117
Cantidad disponible: 1 disponibles
Librería: BennettBooksLtd, Los Angeles, CA, Estados Unidos de America
paperback. Condición: New. In shrink wrap. Looks like an interesting title! Nº de ref. del artículo: SL-3540556117
Cantidad disponible: 1 disponibles
Librería: moluna, Greven, Alemania
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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. Nº de ref. del artículo: 4893667
Cantidad disponible: Más de 20 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This monograph, by one of the greatest computer scientists of our time, attempts a comprehensive investigation of a basic computational problem: to find a formal mathematical characterization of which pairs of cities on a map are neighbors of each other.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 124 pp. Englisch. Nº de ref. del artículo: 9783540556114
Cantidad disponible: 1 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540556114
Cantidad disponible: 1 disponibles