106 search results - page 12 / 22 » Manhattan-Geodesic Embedding of Planar Graphs |
77
Voted
FCT
2009
Springer
15 years 8 months ago
2009
Springer
118
Voted
CAGD
2006
15 years 1 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...
116
Voted
ISAAC
2005
Springer
15 years 7 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 ...
137
click to vote
COMPGEOM
2010
ACM
15 years 7 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 ...
130
Voted
CLA
2004
15 years 3 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 ...