query: How can I draw the Minkowski sum of two sets?
positive_passages.docid: 69235
positive_passages.text: padded boundary of convex hull
negative_passages.docid: 41560
negative_passages.text: What is the best way get the symmetric difference between two sets in java?
negative_passages.docid: 30572
negative_passages.text: Intersection of nested closed bounded convex sets in Euclidean space
negative_passages.docid: 19776
negative_passages.text: Simplify a combinatorial sum
negative_passages.docid: 148649
negative_passages.text: How do I get a slanted \sum symbol?
negative_passages.docid: 141482
negative_passages.text: Proof that plane with $N$ lines can be painted with two colors so that any two neighboring regions are painted in different colors
negative_passages.docid: 70327
negative_passages.text: the numer of partial function between two sets in combinatoric way
negative_passages.docid: 122339
negative_passages.text: Sums-of-Squares (total, between, within): how to compute them from a Distance Matrix?
negative_passages.docid: 42270
negative_passages.text: Combinatorics - Painting the Unit Squares of a 3x3 Square
negative_passages.docid: 126583
negative_passages.text: Coloring points on an n-gon
negative_passages.docid: 62180
negative_passages.text: Best way to find the intersection of multiple sets?
negative_passages.docid: 52479
negative_passages.text: Drawing Cantor Set
negative_passages.docid: 110472
negative_passages.text: Existence of a Pivot Point in Euclidean Geometry
negative_passages.docid: 80156
negative_passages.text: Formatting the union of sets
negative_passages.docid: 136585
negative_passages.text: How do I draw the graph of inequalities in the coordinate plane?
negative_passages.docid: 146664
negative_passages.text: The union of two linearly independent subsets
negative_passages.docid: 145322
negative_passages.text: Sum of a Hyper-geometric series. (NBHM 2011)