Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Convex polytopes

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Ordered algebraic structures --- Gröbner bases --- Convex polytopes --- 512.62 --- Grobner bases --- Polytopes --- Gröbner basis theory --- Commutative algebra --- Fields. Polynomials --- Convex polytopes. --- Gröbner bases. --- 512.62 Fields. Polynomials --- Gröbner bases

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Polytopes --- Combinatorial optimization --- Polyhedra --- #TELE:SISTA --- Hyperspace --- Topology --- Polyhedral figures --- Polyhedrons --- Geometry, Solid --- Shapes --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- Geometry --- Convex polytopes --- Géométrie --- Polytopes convexes --- Géométrie

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Algorithmes --- Algorithms --- Algoritmen --- Convex polytopes --- Convexe polytopen --- Matroiden --- Matroides --- Matroids --- Polytopes convexes --- Matroïdes --- 519.1 --- Combinatorial designs and configurations --- Polytopes --- Algorism --- Algebra --- Arithmetic --- Combinatorics. Graph theory --- Foundations --- Algorithms. --- Convex polytopes. --- Matroids. --- 519.1 Combinatorics. Graph theory --- Matroïdes --- Information theory. --- Computer science. --- Computer graphics. --- Computer software. --- Combinatorics. --- Theory of Computation. --- Computer Applications. --- Discrete Mathematics. --- Computer Graphics. --- Algorithm Analysis and Problem Complexity. --- Combinatorics --- Mathematical analysis --- Software, Computer --- Computer systems --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer art --- Graphic arts --- Electronic data processing --- Engineering graphics --- Image processing --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics --- Digital techniques