Sciweavers

PPL
2000
91views more  PPL 2000»
14 years 6 days ago
A Parallel Algorithm for Planar Orthogonal Grid Drawings
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott...
ICALP
1991
Springer
14 years 4 months ago
The Expected Extremes in a Delaunay Triangulation
We give an expected-case analysis of Delaunay triangulations. To avoid edge effects we consider a unit-intensity Poisson process in Euclidean d-space, and then limit attention to...
Marshall W. Bern, David Eppstein, F. Frances Yao
ICDCS
2008
IEEE
14 years 7 months ago
On the Longest RNG Edge of Wireless Ad Hoc Networks
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei...