DCG
2000
13 years 5 months ago
2000
Let A be a (d + 1)
DCG
2000
13 years 5 months ago
2000
This paper addresses three questions related to minimal triangulations of a 3-dimensional convex polytope P.
DCG
2000
13 years 5 months ago
2000
We provide a multiple purpose algorithm for generating oriented matroids. An application disproves a conjecture of Gr
DCG
2000
13 years 5 months ago
2000
Points P1, . . . , Pn in the unit square define a convex n-chain if they are below y = x and, together with P0 = (0, 0) and Pn+1 = (1, 1), they are in convex position. Under unifo...
DCG
2000
13 years 5 months ago
2000
DCG
2000
13 years 5 months ago
2000
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...