27 search results - page 3 / 6 » Crossing Stars in Topological Graphs |
COMPGEOM
2010
ACM
14 years 16 days ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
CIS
2010
Springer
13 years 2 months ago
2010
Springer
A group of mobile robots can localize cooperatively, using relative position and absolute orientation measurements, fused through an extended Kalman filter (ekf). The topology of ...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
SG
2005
Springer
14 years 28 days ago
2005
Springer
: Cross-sectioning is a popular method for visualizing the complicated inner structures of three-dimensional volume datasets. However, the process is usually manual, meaning that a...
CCCG
2009
13 years 8 months ago
2009
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...