Name
Abstract | ||
|---|---|---|
This document is a companion for the Maple program Summing a polynomial function over integral points of a polygon. It contains two parts. First, we see what this programs does. In the second part, we briefly recall the mathematical back- ground. The present article is a user's guide for the Maple program Sum- ming a polynomial function over integral points of a polygon, available at http://www.math.polytechnique.fr/~berline/maple.html. The Maple program contains two types of computation. The first com- putation does just what the title says. The input consists of a finite set of rational points in Q2, whose convex hull is a polygon p, and a polynomial h(x, y) with rational coefficients. The output is the sum X |
Year | Venue | Keywords |
|---|---|---|
2009 | Clinical Orthopaedics and Related Research | rational point,convex hull,computational geometry |
Field | DocType | Volume |
Maple,Discrete mathematics,Combinatorics,Polygon,Polynomial,Polygon covering,Convex hull,Krein–Milman theorem,Pick's theorem,Mathematics,Monotone polygon | Journal | abs/0905.1 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Velleda Baldoni | 1 | 39 | 4.82 |
| Nicole Berline | 2 | 29 | 3.31 |
| Michèle Vergne | 3 | 59 | 8.21 |