21 search results - page 2 / 5 » On the Complexity of Point Recolouring in Geometric Graphs |
VCBM
2010
13 years 2 months ago
2010
We present the latest developments in modeling 3D biomedical data via the Medial Scaffold (MS), a 3D acyclic oriented graph representation of the Medial Axis (MA) [LK07, SP08]. Th...
BIOINFORMATICS
2008
13 years 7 months ago
2008
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
ENC
2004
IEEE
13 years 11 months ago
2004
IEEE
Point hierarchies are suitable for creating framecoherent animations of 3D models in non-photorealistic styles such as stippling, painterly and other artistic rendering. In this p...
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexit...
SPAA
2005
ACM
14 years 27 days ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...