A wireless communication network can be viewed as a collection of nodes, located in some domain, which can in turn be transmitters or receivers (depending on the network considered, nodes may be mobile users, base stations in a cellular network, access points of a WiFi mesh etc.). At a given time, several nodes transmit simultaneously, each toward its own receiver. Each transmitter–receiver pair requires its own wireless link. The signal received from the link transmitter may be jammed by the signals received from the other transmitters. Even in the simplest model where the signal power radiated from a point decays in an isotropic way with Euclidean distance, the geometry of the locations of the nodes plays a key role since it determines the signal to interference and noise ratio (SINR) at each receiver and hence the possibility of establishing simultaneously this collection of links at a given bit rate. The interference seen by a receiver is the sum of the signal powers received from all transmitters, except its own transmitter.
标签： Stochastic geometry Networks Wireless Volume and II
上传时间： 2020-06-01
上传用户：shancjb
CGAL is a collaborative effort of several sites in Europe and Israel. The goal is to make the most important of the solutions and methods developed in computational geometry available to users in industry and academia in a C++ library. The goal is to provide easy access to useful, reliable geometric algorithms
标签： collaborative several Europe Israel
上传时间： 2015-01-09
上传用户：refent
CGAL is a collaborative effort of several sites in Europe and Israel. The goal is to make the most important of the solutions and methods developed in computational geometry available to users in industry and academia in a C++ library.
标签： collaborative several Europe Israel
上传时间： 2015-04-10
上传用户：hopy
This a very simple Yee algorithm 3D FDTD code in C implementing the free space form of Maxwell s equations on a Cartesian grid. There are no internal materials or geometry. The code as delivered simulates an idealized rectangular waveguide by treating the interior of the mesh as free space/air and enforcing PEC (Perfect Electric Conductor) conditions on the faces of the mesh.
标签： implementing algorithm Maxwell simple
上传时间： 2015-05-14
上传用户：水中浮云
penMesh is a generic and efficient data structure for representing and manipulating polygonal meshes. OpenMesh is developed at the Computer Graphics Group, RWTH Aachen , as part of the OpenSGPlus project, is funded by the German Ministry for Research and Education ( BMBF), and will serve as geometry kernel upon which the so-called high level primitives (e.g. subdivision surfaces or progressive meshes) of OpenSGPlus are built. It was designed with the following goals in mind : Flexibility : provide a basis for many different algorithms without the need for adaptation. Efficiency : maximize time efficiency while keeping memory usage as low as possible. Ease of use : wrap complex internal structure in an easy-to-use interface.
标签： manipulating representing and efficient
上传时间： 2015-10-14
上传用户：米卡
his paper provides a tutorial and survey of methods for parameterizing surfaces with a view to applications in geometric modelling and computer graphics. We gather various concepts from di® erential geometry which are relevant to surface mapping and use them to understand the strengths and weaknesses of the many methods for parameterizing piecewise linear surfaces and their relationship to one another.
标签： parameterizing provides tutorial surfaces
上传时间： 2014-11-09
上传用户：努力努力再努力
The problem of image registration subsumes a number of problems and techniques in multiframe image analysis, including the computation of optic flow (general pixel-based motion), stereo correspondence, structure from motion, and feature tracking. We present a new registration algorithm based on spline representations of the displacement field which can be specialized to solve all of the above mentioned problems. In particular, we show how to compute local flow, global (parametric) flow, rigid flow resulting from camera egomotion, and multiframe versions of the above problems. Using a spline-based description of the flow removes the need for overlapping correlation windows, and produces an explicit measure of the correlation between adjacent flow estimates. We demonstrate our algorithm on multiframe image registration and the recovery of 3D projective scene geometry. We also provide results on a number of standard motion sequences.
标签： image registration multiframe techniques
上传时间： 2016-01-20
上传用户：520
染色体分割算法的经典文献，关键词：Image segmentation, chromosome analysis,overlapping chromosomes, computational geometry
标签： 分割算法
上传时间： 2013-12-16
上传用户：liglechongchong
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1 xng IR3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed to be known in advance — all are inferred automatically from the data. This problem naturally arises in a variety of practical situations such as range scanning an object from multiple view points, recovery of biological shapes from two-dimensional slices, and interactive surface sketching.
标签： demonstrate unorganized algorithm describe
上传时间： 2013-12-18
上传用户：xc216
A MATLAB GUI platform for realizing the radiation pattern of narrowband beamformer with random array geometry. User can specify the array geometry, directions of incoming signals, noise power, and the type of beamformer. Useful for gaining insight about collaborative beamforming in sensor networks and random arrays. You need both randomarray.fig and randomarray.m to work.
标签： beamformer narrowband realizing radiation
上传时间： 2014-01-06
上传用户：qb1993225
