نتایج جستجو برای: convex polygon domain
تعداد نتایج: 464581 فیلتر نتایج به سال:
Let K be a compact convex domain in the Euclidean plane. The mixed area A(K,−K) of and −K can bounded from above by 1/(6 3)L(K)2, where L(K) is perimeter K. This was proved Ulrich Betke Wolfgang Weil [5]. They also showed that if polygon, then equality holds only regular triangle. We prove among all domains, this case, as conjectured Weil. achieved establishing stronger stability result for geo...
We present an order n algorithm which computes the convex hull of a two-dimensional non-selfintersecting polygon. The algorithm recovers much of the simplicity of the one presented by Sklansky (Sklansky, 1972), and subsequently disproved. Unlike several algorithms which have been found since then, the modified algorithm executes a truly uniform (modeless) traversal of all the vertices of the po...
We present a diagram that captures containment information for scalable translations of a convex polygon. For a given polygon P and contact point q in a set S, the diagram parameterizes possible translations and scales of the polygon in order to represent containment regions for each other point v in S. We present geometric and combinatorial properties for this diagram, and describe how it can ...
We continue the investigation of computational aspects of restricted-orientation convexity (O-convexity) in two dimensions. We introduce one notion of an O-halfplane, for a set O of orientations, and we investigate O-connected convexity. The O-connected convex hull of a nite set X can be computed in time O(jXj log jXj + jOj). The O-connected hull is a basis for determining the O-convex hull of ...
An effective strategy for accelerating the calculation of convex hulls for point sets is to filter the input points by discarding interior points. In this paper, we present such a straightforward and efficient preprocessing approach by exploiting the GPU. The basic idea behind our approach is to discard the points that locate inside a convex polygon formed by 16 extreme points. Due to the fact ...
A technique to triangulate planar convex polygons presenting T{vertices is described. Simple strip or fan tessellation of a polygon with T{vertices can result in zero{area triangles and compromise the rendering process. Our technique splits such a polygon into one triangle strip and, at most, one triangle fan. The utility is particularly useful in multiresolution or adaptive representation of p...
A random polygon is the convex hull of uniformly distributed random points in a convex body K ⊂ R. General upper bounds are established for the variance of the area of a random polygon and also for the variance of its number of vertices. The upper bounds have the same order of magnitude as the known lower bounds on variance for these functionals. The results imply a strong law of large numbers ...
We present shortest path maps that support min-link queries from any source point on a line segment to destination points in either a simple polygon or a polygonal domain (a polygon with holes). These structures are more versatile than the traditional shortest path map from a fixed source point, and we use them to compute the min-link Fréchet distance between two polygonal curves. In addition t...
Inthispaper, (L,M)-fuzzy domain finiteness and (L,M)-fuzzy restricted hull spaces are introduced, and several characterizations of the category (L,M)-CS of (L,M)-fuzzy convex spaces are obtained. Then, (L,M)-fuzzy stratified (resp. weakly induced, induced) convex spaces are introduced. It is proved that both categories, the category (L,M)-SCS of (L,M)-fuzzy stratified convex spaces and the cate...
The problem of cutting a convex polygon P out of a piece of planar material Q with minimum total cutting length is a well studied problem in computational geometry. Researchers studied several variations of the problem, such as P and Q are convex or non-convex polygons and the cuts are line cuts or ray cuts. In this paper we consider yet another variation of the problem where Q is a circle and ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید