The expected size of some graphs in computational geometry
نویسندگان
چکیده
منابع مشابه
The Expected Size of Some Graphs In
We consider n independent points with a common but arbitrary density fin R a. Two points (X~, Xj) are joined by an edge when a certain set S(X~, Xj) does not contain any other data points. The expected number E(N) of edges in the graph depends upon n, f and the definition of S. Examples include rectangles, spheres and loons; these lead to the graph of all dominance pairs, the Gabriel graph and ...
متن کاملCentral Limit Theorems for Some Graphs in Computational Geometry
Let Bn be an increasing sequence of regions in d-dimensional space with volume n and with union d. We prove a general central limit theorem for functionals of point sets, obtained either by restricting a homogeneous Poisson process to Bn, or by by taking n uniformly distributed points in Bn. The sets Bn could be all cubes but a more general class of regions Bn is considered. Using this general ...
متن کاملSome Dynamic Computational Geometry Problems
\‘c consider some problems in computattonal geometry when every one of the input points i\ movmg in a prescribed manner.
متن کاملSome Problems in Distributed Computational Geometry
A geometric network is a distributed network where each processor is identified by two numbers, representing the coordinates of the point in the plane where the processor is located. The edges of the network correspond to straight line segments such that no two of them intersect. In this paper we introduce the study of distributed computing in geometric networks. We study several computational ...
متن کاملextensions of some polynomial inequalities to the polar derivative
توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1988
ISSN: 0898-1221
DOI: 10.1016/0898-1221(88)90071-5