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.
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
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.
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.
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.
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.
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.
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.
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.
