Skip to main content
Computer Science

Questions tagged [square-grid]

Ask Question

The tag has no summary.

41 questions
Newest Active Bountied Unanswered
1 vote
0 answers
47 views

I have a Python program that receives a 2D square grid-based data, converts it to a graph, does some transformations and then it should embed the resulting graph back on a grid and output it. Any ...
GulgDev's user avatar
  • 11
1 vote
2 answers
94 views

The problem is to find two disjont longest possible (but with equal length) horizontal or vertical lines in given 2D matrix, where some cells are excluded from use. The disjont means that any cell ...
Szyszka947's user avatar
  • 65
2 votes
1 answer
177 views

We have an $ n \times n $ table, and in each cell of the table, there is a number from $1$ to $ 2n $. We want to change the numbers in some of the cells and replace them with other numbers from $1$ to ...
Ferran Gonzalez's user avatar
  • 367
0 votes
1 answer
76 views

I am working on an floorplan application where I save elements on an infinite grid in a sparse manner. Specifically, I have the following Python class representing a sparse grid (basically a ...
Mate de Vita's user avatar
  • 103
0 votes
1 answer
167 views

Suppose we have a grid of points (which can also be very dense 10000x10000) like the one in the figure in which the points are marked with two different colors. What is the best algorithm from a ...
aSpagno's user avatar
  • 5
3 votes
2 answers
313 views

I need to solve an optimization problem for a given set of polyominoes, for example the five Tetrominoes known from Tetris. The goal is to place each one of the figures on the 2d grid, so the area ...
Tobi's user avatar
  • 162
0 votes
0 answers
85 views

I would like to experiment with displaying the output of an analog to digital converter on computer. Samples of the ADC output would determine the intensity of one pixel. The input to the ADC is an ...
Otto Hunt's user avatar
  • 1
1 vote
1 answer
111 views

Let's assume I have graph above with spanning tree pointed out by blue edges. Vertex at position (1,1) (row 1, column 1) is connected to the bottom vertex and has degree 1. Vertex at position (4,2) (...
Looft's user avatar
  • 175
0 votes
0 answers
119 views

I have an undirected fully-connected weighted graph of $n$ nodes, where $n=m\times m$. I want to visualize this graph on an $m$ x $m$ 2D grid. My goal is to place nodes connected with edges of higher ...
Md Hasan Shahriar's user avatar
  • 9
1 vote
1 answer
56 views

While solving This algorithm problem I was unable to come up with condition for the collision to occur ( other than the naive O(n^2) algorithm ) on reading the explanation they say Let’s deepen the ...
Pawan Nirpal's user avatar
  • 229
4 votes
0 answers
96 views

Given a $n \times n$ grid with some walls and two cells $a$ and $b$, I want to compute the non-homotopics paths from $a$ to $b$ on this grid. A path is a sequence of adjacent cells (diagonal does not ...
Johan's user avatar
  • 141
0 votes
1 answer
1k views

I am currently dealing with a network flow problem and I am trying to find some similar solved problems to help me formulate my solution. The text is: You are the owner of a large chain of franchise ...
th3gr3yman's user avatar
  • 9
1 vote
1 answer
360 views

Let's suppose we have a square grid board like the one shown in the picture below: I'm wondering how I can find the path with minimum number of "bending" points (like the ones shown in red) ...
Fish_n_Chips's user avatar
  • 153
1 vote
1 answer
238 views

In the answer to an earlier question "SAT algorithm for determining if a graph is disjoint" a formula is constructed that is satisfiable iff a given graph is connected. The formula uses a ...
Hendrik Jan's user avatar
  • 31.6k
1 vote
0 answers
42 views

...
sten's user avatar
  • 139

15 30 50 per page
1
2 3