نتایج جستجو برای: log convex structure
تعداد نتایج: 1685501 فیلتر نتایج به سال:
We present a data structure for ray-shooting queries in a set of convex fat polyhedra of total complexity n in R. The data structure uses O(n) storage and preprocessing time, and queries can be answered in O(log n) time. A trade-off between storage and query time is also possible: for any m with n < m < n, we can construct a structure that uses O(m) storage and preprocessing time such that quer...
In this paper we preprocess a set P of n points so that we can answer queries of the following form: Given a convex m-gon Q, report the minimum circle containing P and excluding Q. Our data structure can be constructed in O(n log n) time using O(n) space, and answers queries in O(log n+ logm) time.
We provide an efficient data structure for dynamically maintaining a ham-sandwich cut of two nonoverlapping convex polygons in the plane. Given two non-overlapping convex polygons P1 and P2 in the plane, the ham-sandwich cut of P1 and P2 is a line that simultaneously bisects the area (or perimeter or vertex count) of both polygons. We provide a data structure that supports queries for the ham-s...
Abstract In this paper, we prove that the sequences of Stirling numbers first and second kind with higher level are both Pólya frequency log-concave. Then, show some polynomials related to above q -log-convex or strongly -log-convex. Furthermore, establish linear transformation 2 preserves log-convexity.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید