Sciweavers

1370 search results - page 23 / 274
» On grids in topological graphs
Sort
View
CPC
2006
84views more  CPC 2006»
13 years 8 months ago
Splitter Theorems for Cubic Graphs
Let ;k g be the class of k-connected cubic graphs of girth at least g. For several choices of k and g, we determine a set Ok g of graph operations, for which, if G and H are graph...
Guoli Ding, Jinko Kanno
SMI
2010
IEEE
165views Image Analysis» more  SMI 2010»
13 years 6 months ago
Designing a Topological Modeler Kernel: A Rule-Based Approach
In this article, we present a rule-based language dedicated to topological operations, based on graph transformations. Generalized maps are described as a particular class of graph...
Thomas Bellet, Mathieu Poudret, Agnès Arnou...
GG
2008
Springer
13 years 9 months ago
Graph Transformation for Topology Modelling
In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our p...
Mathieu Poudret, Agnès Arnould, Jean-Paul C...
ICRA
1999
IEEE
138views Robotics» more  ICRA 1999»
14 years 23 days ago
Efficient Topological Exploration
We consider the robot exploration of a planar graphlike world. The robot's goal is to build a complete map of its environment. The environment is modeled as an arbitrary undi...
Ioannis M. Rekleitis, Vida Dujmovic, Gregory Dudek
PPL
2000
91views more  PPL 2000»
13 years 8 months 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...