نتایج جستجو برای: point standard addition

تعداد نتایج: 1633307  

2009
Geir Agnarsson Walter D. Morris

We investigate the structure of the Minkowski sum of standard simplices in R. In particular, we investigate the one-dimensional structure, the vertices, their degrees and the edges in the Minkowski sum polytope. 2000 MSC: 52B05, 52B11, 05C07.

Journal: :Combinatorics, Probability & Computing 2011
Yahya Ould Hamidoune Juanjo Rué

Let A be a finite nonempty set of integers. An asymptotic estimate of several dilates sum size was obtained by Bukh. The unique known exact bound concerns the sum |A + k ·A|, where k is a prime and |A| is large. In its full generality, this bound is due to Cilleruelo, Serra and the first author. Let k be an odd prime and assume that |A| > 8kk. A corollary to our main result states that |2 · A +...

Journal: :Electr. J. Comb. 2010
Ondrej Bílka Kevin Buchin Radoslav Fulek Masashi Kiyomi Yoshio Okamoto Shin-ichi Tanigawa Csaba D. Tóth

Recently, Eisenbrand, Pach, Rothvoß, and Sopher studied the function M(m, n), which is the largest cardinality of a convexly independent subset of the Minkowski sum of some planar point sets P and Q with |P | = m and |Q| = n. They proved that M(m, n) = O(m2/3n2/3+m+n), and asked whether a superlinear lower bound exists for M(n, n). In this note, we show that their upper bound is the best possib...

2004
GINO VAN DEN BERGEN

This paper presents a new algorithm for computing the hit point and normal of a ray and a general convex object. The algorithm is loosely based on the the Gilbert-Johnson-Keerthi algorithm for computing the distance between convex objects in the sense that it is applicable to the same family of convex objects and uses the same subalgorithm for computing the closest point of a simplex. Since thi...

Journal: :Computer Aided Geometric Design 2008
Jyh-Ming Lien

Article history: Available online 17 July 2008

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید