Article history: Available online 17 July 2008

3 Proof of Theorem 1 9 3.1 Estimation of the g1 term. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.2 Estimation of the g3 term. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.3 Estimation of the g2 term. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.4 Putting everything together. . . . . . . . . . . . . . . . . . . . . ....

Abstract So-called respectively readings have posed serious challenges for theories of syntax and semantics. Sentences like George and Martha respectively denounced and were denounced by the governor (McCawley 1998) show that although the conjoined verbal expressions share the same syntactic subject, they do not predicate that subject in the same way; George (not Martha) denounced the governor,...

We present an algorithm for computing Minkowski sums among surfaces of revolution and surfaces of linear extrusion, generated by slope-monotone closed curves. The special structure of these simple surfaces allows the process of normal matching between two surfaces to be expressed as an explicit equation. Based on this insight, we also present an efficient algorithm for computing the distance be...

We show that for polytopes P1, P2, . . . , Pr ⊂ R, each having ni ≥ d + 1 vertices, the Minkowski sum P1 + P2 + · · · + Pr cannot achieve the maximum of ∏ i ni vertices if r ≥ d. This complements a recent result of Fukuda & Weibel (2006), who show that this is possible for up to d − 1 summands. The result is obtained by combining methods from discrete geometry (Gale transforms) and topological ...