Vol. 18, Analytic and Geometric Stochastics: Papers in Honour of G. E. H. Reuter (Dec., 1986), pp. 59-72 (14 pages) An earlier paper [3] by one of us discussed shape-measures μ for random triangles ...
Complex polygon triangulation. A fast O(n*log(n)) algorithm based on "Triangulation of monotone polygons". The result can be represented as a Delaunay triangulation.
In this paper we consider location-allocation problems in which the region to be served is a convex polygon having a uniform demand distribution. Both single and multifacility formulations are ...
Abstract: As the most precise interval analysis (IA) method in antenna/radome areas, convex-polygon-based IA suffers from the exponentially increasing computational complexity with antenna/radome ...
Abstract: In this paper we present a novel range free method based on connectivity for homogeneous optical wireless networks. Optical attocells deployed homogeneously within an indoor scenario send ...
Hiya fellow arsians!<BR><BR>I've implemented depth of field in my raytracer and while it does look nice, it doesn't seem to realistic. After googling around and browsing some photographic magazines, I ...
At the International Workshop on Combinatorial Image Analysis, held in Brno, Czech Republic, our URGE To Compute team received the Best Student Paper Award for their presentation, "On Intersection ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback