Sciweavers

1633 search results - page 80 / 327
» Planar Map Graphs
Sort
View
WADS
1993
Springer
115views Algorithms» more  WADS 1993»
14 years 2 months ago
Parallel Construction of Quadtrees and Quality Triangulations
We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(log n) for p...
Marshall W. Bern, David Eppstein, Shang-Hua Teng
IPL
2006
98views more  IPL 2006»
13 years 10 months ago
Transforming spanning trees and pseudo-triangulations
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
Oswin Aichholzer, Franz Aurenhammer, Clemens Hueme...
HICSS
1995
IEEE
82views Biometrics» more  HICSS 1995»
14 years 1 months ago
A graph-theoretic data model for genome mapping databases
Graphs are a natural foundation for genome map databases. Mapping and other genomic data can be clearly represented by graphs, and graphs can be stored in a database. Graphs are d...
Mark Graves, Ellen R. Bergeman, Charles B. Lawrenc...
CORR
2010
Springer
65views Education» more  CORR 2010»
13 years 7 months ago
A Note on Solid Coloring of Pure Simplicial Complexes
We establish a simple generalization of a known result in the plane. The simplices in any pure simplicial complex in Rd may be colored with d+1 colors so that no two simplices tha...
Joseph O'Rourke
EJC
2008
13 years 10 months ago
On tension-continuous mappings
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...
Jaroslav Nesetril, Robert Sámal