78 research outputs found
Recommended from our members
Polyhedra of small order and their Hamiltonian properties
We describe the results of an enumeration of several classes of polyhedra. The enumerated classes include polyhedra with up to 12 vertices and up to 26 edges, simplical polyhedra with up to 16 vertices, 4-connected polyhedra with up to 15 vertices, and bipartite polyhedra with up to 22 vertices.The results of the enumeration were used to systematically search for certain minimal non-Hamiltonian polyhedra. In particular, the smallest polyhedra satisfying certain toughness-like properties are presented here, as are the smallest non-Hamiltonian, 3-connected, Delaunay tessellations and triangulations. Improved upper and lower bounds on the size of the smallest non-Hamiltonian, inscribable polyhedra are also given
Recommended from our members
GraphTool : a tool for interactive design and manipulation of graphs and graph algorithms
GraphTool is an interactive tool for editing graphs and visualizing the execution and results of graph algorithms. It runs under both the SunView and X Windows environments and has a full window/mouse interface which is as similar as possible for the two windowing systems. In addition, there is a standalone program called the Wrapper which simulates the Graph-Tool interface without graphics for batch processing of graph algorithms. While the primary purpose of GraphTool is to provide a means for experimentally investigating the performance of graph algorithms, it has other useful features as well. It provides features for printing graphs in a visually appealing format, which makes it easier to prepare papers for publication. It also provides a facility for "animating" algorithms, which means that it can be used in computer assisted instruction (CAI) and for preparing video presentations of algorithms
Recommended from our members
Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees
A variant of the plane sweep paradigm known as topological sweep is adapted to solve geometric problems involving two-dimensional regions when the underlying representation is a region quadtree. The utility of this technique is illustrated by showing how it can be used to extract the boundaries of a map in O(M) space and O(Ma(M)) time, where M is the number of quad tree blocks in the map, and a(·) is the (extremely slowly growing) inverse of Ackerman's function. The algorithm works for maps that contain multiple regions as well as holes. The algorithm makes use of active objects (in the form of regions) and an active border. It keeps track of the current position in the active border so that at each step no search is necessary. The algorithm represents a considerable improvement over a previous approach whose worst-case execution time is proportional to the product of the number of blocks in the map and the resolution of the quad tree (i.e., the maximum level of decomposition). The algorithm works for many different quadtree representations including those where the quadtree is stored in external storage
Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
AbstractIt is shown that it is an NP-complete problem to determine whether a Delaunay triangulation or an inscribable polyhedron has a Hamiltonian cycle. It is also shown that there exist nondegenerate Delaunay triangulations and simplicial, inscribable polyhedra without 2-factors
Recommended from our members
Graph-theoretical conditions for inscribability and Delaunay realizability
We present new graph-theoretical conditions for inscribable polyhedra and Delaunay triangulations. We establish several sufficient conditions of the following general form: if a polyhedron has a sufficiently rich collection of Hamiltonian subgraphs, then it is inscribable. These results have several consequences:All 4-connected polyhedra are inscribable.All simplical polyhedra in which all vertex degrees are between 4 and 6, inclusive, are inscribable.All triangulations without chords or nonfacial triangles are realizable as Delaunay triangulations.We also strengthen some earlier results about matchings in inscribable polyhedra. Specifically, we show that any nonbipartite inscribable polyhedron has a perfect matching containing any specified edge, and that any bipartite inscribable polyhedron has a perfect matching containing any two specified disjoint edges. We give examples showing that these results are best possible
Choosing Colors for Geometric Graphs via Color Space Embeddings
Graph drawing research traditionally focuses on producing geometric
embeddings of graphs satisfying various aesthetic constraints. After the
geometric embedding is specified, there is an additional step that is often
overlooked or ignored: assigning display colors to the graph's vertices. We
study the additional aesthetic criterion of assigning distinct colors to
vertices of a geometric graph so that the colors assigned to adjacent vertices
are as different from one another as possible. We formulate this as a problem
involving perceptual metrics in color space and we develop algorithms for
solving this problem by embedding the graph in color space. We also present an
application of this work to a distributed load-balancing visualization problem.Comment: 12 pages, 4 figures. To appear at 14th Int. Symp. Graph Drawing, 200
A general approach to connected-component labeling for arbitrary image representations
Recommended from our members
Polyhedra of small order and their Hamiltonian properties
We describe the results of an enumeration of several classes of polyhedra. The enumerated classes include polyhedra with up to 12 vertices and up to 26 edges, simplical polyhedra with up to 16 vertices, 4-connected polyhedra with up to 15 vertices, and bipartite polyhedra with up to 22 vertices.The results of the enumeration were used to systematically search for certain minimal non-Hamiltonian polyhedra. In particular, the smallest polyhedra satisfying certain toughness-like properties are presented here, as are the smallest non-Hamiltonian, 3-connected, Delaunay tessellations and triangulations. Improved upper and lower bounds on the size of the smallest non-Hamiltonian, inscribable polyhedra are also given
Polyhedra of Small Order and Their Hamiltonian Properties
... The results of the enumeration were used to systematically search for certain smallest non-Hamiltonian polyhedral graphs. In particular, the smallest non-Hamiltonian planar graphs satisfying certain toughness-like properties are presented here, as are the smallest non-Hamiltonian, 3-connected, Delaunay tessellations and triangulations. Improved upper and lower bounds on the size of the smallest non-Hamiltonian, inscribable polyhedra are also given
- …