106 search results - page 12 / 22 » Manhattan-Geodesic Embedding of Planar Graphs |
FCT
2009
Springer
14 years 4 months ago
2009
Springer
CAGD
2006
13 years 10 months ago
2006
We describe how some simple properties of discrete one-forms directly relate to some old and new results concerning the parameterization of 3D mesh data. Our first result is an ea...
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
COMPGEOM
2010
ACM
14 years 2 months 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 ...
CLA
2004
13 years 11 months ago
2004
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...