Results 201 to 210 of about 1,282,765 (250)
Some of the next articles are maybe not open access.
European Conference on Computer Vision, 2019
This paper tackles a 2D architecture vectorization problem, whose task is to infer an outdoor building architecture as a 2D planar graph from a single RGB image.
Nelson Nauata, Yasutaka Furukawa
semanticscholar +1 more source
This paper tackles a 2D architecture vectorization problem, whose task is to infer an outdoor building architecture as a 2D planar graph from a single RGB image.
Nelson Nauata, Yasutaka Furukawa
semanticscholar +1 more source
Contracting a Planar Graph Efficiently
Embedded Systems and Applications, 2017We present a data structure that can maintain a simple planar graph under edge contractions in linear total time. The data structure supports adjacency queries and provides access to neighbor lists in $O(1)$ time.
J. Holm +5 more
semanticscholar +1 more source
Gracker: A Graph-Based Planar Object Tracker
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2018Matching-based algorithms have been commonly used in planar object tracking. They often model a planar object as a set of keypoints, and then find correspondences between keypoint sets via descriptor matching.
Tao Wang, Haibin Ling
semanticscholar +1 more source
On the Number of Spanning Trees a Planar Graph Can Have
Embedded Systems and Applications, 2009We prove that any planar graph on n vertices has less than O(5.2852n) spanning trees. Under the restriction that the planar graph is 3-connected and contains no triangle and no quadrilateral the number of its spanning trees is less than O(2.7156n).
K. Buchin, A. Schulz
semanticscholar +1 more source
A GRASP for graph planarization
Networks, 1997Summary: A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. We describe a GRASP for the graph planarization problem, extending the heuristic of \textit{O. Goldschmidt} and \textit{A. Takvorian} [Networks 24, No. 2, 69-73 (1994; Zbl 0789.90083)].
Mauricio G. C. Resende, Celso C. Ribeiro
openaire +3 more sources
3-connected Planar Graph Isomorphism is in Log-space
Foundations of Software Technology and Theoretical Computer Science, 2008We consider theisomorphism and canonization problem for3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL (TW08). In this paper, we give a determin- istic log-space algorithm for 3-connected planar graph isomorphism and ...
Samir Datta +2 more
semanticscholar +1 more source
Journal of the Franklin Institute, 1965
Abstract Some new properties of the distribution of elements and vertices with respect to the windows of a connected planar graph G are established. It is also shown that a window matrix of G has properties similar to the properties of an incidence matrix of a graph which is not necessarily planar.
Alan Budner, David P. Brown
openaire +3 more sources
Abstract Some new properties of the distribution of elements and vertices with respect to the windows of a connected planar graph G are established. It is also shown that a window matrix of G has properties similar to the properties of an incidence matrix of a graph which is not necessarily planar.
Alan Budner, David P. Brown
openaire +3 more sources
Representations of Planar Graphs
SIAM Journal on Discrete Mathematics, 1993Summary: This paper shows that every 3-connected planar graph \(G\) can be represented as a collection of circles, one circle representing each vertex and each face, so that, for each edge of \(G\), the four circles representing the two endpoints and the two neighboring faces meet at a point, and furthermore the vertex-circles cross the face-circles at
Graham Brightwell, Edward R. Scheinerman
openaire +2 more sources