Skip to main content
Stack Overflow
  1. About
  3. For Teams
Filter by
Sorted by
Tagged with
1 vote
1 answer
90 views

The code I am writing is in C#, but pseudocode is also appreciated. I have a function that generates a list of faces (which is an ordered list of nodes) of a planar graph. So the function signature ...
0 votes
1 answer
187 views

Does anyone know of an algorithm that can produce an outerplanar embedding of a graph? I am looking for something similar to check_planarity from NetworkX, which returns a planar embedding if the ...
1 vote
2 answers
480 views

I'm working on an algorithms' assignment at my college, which involves finding the vertices that belong to the face of a strictly planar and connected graph. However, I've encountered an issue with ...
3 votes
2 answers
1k views

Given a simple graph, problem is to check if there is a subgraph homeomorphic to k5 or k3,3, and if there is, output which one is present(k5 or k3,3 or both). I need a reasonably fast algorithm that ...
1 vote
1 answer
214 views

I am running the following code to get a plannar graph with a specific embedding: import numpy as np import matplotlib.pyplot as plt import networkx as nx #Defining the graph with pannar embedding H=...
1 vote
0 answers
77 views

It's been almost 2 weeks since I started to think about solution to that problem, as u probably see, without success ;) Recently I was experimenting with OGDF function for planar graphs, such as "...
0 votes
1 answer
202 views

Starting with the graph on the left, I would like to compare all of the lines, and anywhere they intersect (not counting the corners), keep only the shortest of the intersecting lines. I have the data ...
-2 votes
1 answer
106 views

I need an approaching method theoretically to solve the below problem. (6pts.) For n ≥ 1 let Gn be the simple graph with vertex set V(Gn) = {1, 2, ..., n} in which two different vertices i and j are ...
0 votes
3 answers
345 views

I have a set of puzzle pieces (triangles and squares) of e.g. the form {[1, 2, 3, 4], [2, 4, 5], [1 , 3, 6]} Now, I want to check if these pieces can be put together on a grid. A valid layout would e....
0 votes
1 answer
279 views

I am looking for a way to generate a random planar graph in C#. I've looked into some algorithms like Voronoi Diagram, Delaunay Triangulation and convex hull algorithms. They were quit useful and I ...
Adam Q's user avatar
  • 11
1 vote
0 answers
379 views

I’m working on the following task: I have 6 fisheye cameras and would like to produce a 360 degree stitched image. After carrying out the calibration procedure with findChessboardCorners, ...
0 votes
1 answer
572 views

Take the cube as an example, there are 8 nodes and 12 edges, and each node is connected with 3 nodes. With networkx, I must input all the edges manually. For example, the following code is to ...
3 votes
3 answers
1k views

I have a planar graph which I am creating myself. I want to find the faces of this graph but I can't find a working algorithm for doing so. What I've done so far is using an algorithm to find all the ...
1 vote
1 answer
105 views

I want to save what are the outer nodes of my graph. For that, I have the following code (I am showing the parts I believe are relevant for the problem, I do have all the #include headers etc...): ...
ma7642's user avatar
  • 149
0 votes
1 answer
618 views

I'm practicing my recursion skills at the moment and came across the 6 color theorem that states: Every planar graph can be colored with 6 colors. That theorem follows from the observation that every ...
user avatar

15 30 50 per page
1
2 3 4 5

AltStyle によって変換されたページ (->オリジナル) /