Sciweavers

124 search results - page 23 / 25
» Crossing Number of Toroidal Graphs
Sort
View
DCG
2006
110views more  DCG 2006»
14 years 9 months ago
High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...
David L. Donoho
BMCBI
2010
143views more  BMCBI 2010»
14 years 9 months ago
An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location inf
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...
Kaname Kojima, Masao Nagasaki, Satoru Miyano
FOCS
2006
IEEE
15 years 3 months ago
On a Geometric Generalization of the Upper Bound Theorem
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
Uli Wagner
RIVF
2003
14 years 10 months ago
Airspace Sectorization By Constraint Programming
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
Huy Trandac, Philippe Baptiste, Vu Duong
INFOVIS
2005
IEEE
15 years 3 months ago
Flow Map Layout
Cartographers have long used flow maps to show the movement of objects from one location to another, such as the number of people in a migration, the amount of goods being traded,...
Doantam Phan, Ling Xiao, Ron B. Yeh, Pat Hanrahan,...