1633 search results - page 74 / 327 » Planar Map Graphs |
167
click to vote
GD
2006
Springer
15 years 9 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
150
click to vote
CCCG
2007
15 years 7 months ago
2007
We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a tr...
168
click to vote
CCCG
2003
15 years 7 months ago
2003
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S, E). For the case that G for...
398
click to vote
IWOCA
2010
Springer
15 years 29 days ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
191
click to vote
COCOON
1999
Springer
15 years 10 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...