Sciweavers

26 search results - page 1 / 6
» Computing Radial Drawings on the Minimum Number of Circles
Sort
View
GD
2004
Springer
14 years 28 days ago
Computing Radial Drawings on the Minimum Number of Circles
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta,...
BMVC
1998
13 years 9 months ago
Planar Curve Representation and Matching
In this paper, we discuss a method for representing and matching planar curves. The technique is based on using calculations from concentric circles to represent each curve by two...
Maher Al-Khaiyat, Farhad Kamangar
SOFSEM
2005
Springer
14 years 1 months ago
Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
Radoslav Fulek, Hongmei He, Ondrej Sýkora, ...
JPDC
2006
148views more  JPDC 2006»
13 years 7 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 1 months ago
Alternative Symbol Representations with Radial Symmetry for PAPR Reduction in OFDM Systems
— This paper proposes a new method for peak to average power ratio (PAPR) reduction in orthogonal frequency division multiplexing (OFDM) systems using two alternative signalling ...
Ali Al-Shaikhi, Jacek Ilow