Sciweavers

21 search results - page 1 / 5
» Generating Random Orthogonal Polygons
Sort
View
CAEPIA
2003
Springer
13 years 10 months ago
Generating Random Orthogonal Polygons
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
Ana Paula Tomás, António Leslie Baju...
ICCSA
2004
Springer
13 years 10 months ago
Quadratic-Time Linear-Space Algorithms for Generating Orthogonal Polygons with a Given Number of Vertices
We propose Inflate-Paste – a new technique for generating orthogonal polygons with a given number of vertices from a unit square based on gluing rectangles. It is dual to Inflate...
Ana Paula Tomás, António Leslie Baju...
CORR
2007
Springer
79views Education» more  CORR 2007»
13 years 4 months ago
Connecting Polygonizations via Stretches and Twangs
We show that the space of polygonizations of a fixed planar point set S of n points is connected by O(n2 ) “moves” between simple polygons. Each move is composed of a sequence...
Mirela Damian, Robin Y. Flatland, Joseph O'Rourke,...
GLOBECOM
2008
IEEE
13 years 11 months ago
High-Throughput Non-Orthogonal Interleaved Random Space-Time Coding for Multi-Source Cooperation
Abstract— In this paper, we propose a novel distributed Interleaved Random Space-Time Code (IR-STC) designed for MultiSource Cooperation (MSC) employing various relaying techniqu...
Rong Zhang, Lajos Hanzo
TWC
2008
133views more  TWC 2008»
13 years 4 months ago
Beam Selection Strategies for Orthogonal Random Beamforming in Sparse Networks
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
José López Vicario, Roberto Bosisio,...