Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with geometry-conversion
Search options not deleted
user 4537
A change from a geometry type to another, e.g., points to lines, lines to polygons, polygons to points, and the like.
2
votes
Accepted
Generate polygons from a set of intersecting lines
Here is another solution we could find.
Using
DCEL we
can make blocks from touching lines.
For Python there is a package {here}. It is a tiny implementation with some bugs. Nevertheless wi …
- 3,407
12
votes
6
answers
7k
views
Generate polygons from a set of intersecting lines
This is a simple and quite common question which has already been asked for different purposes (see this link and this too, for example), here, however, we are looking for not a software package but a …
- 3,407
7
votes
2
answers
333
views
Generating polygonal blocks using growing lines
We first generate a set of locations (i.e., points(x,y)), randomly. Then we assign for each point a number showing the angle of a line being centred at that point. The criteria for the length of lines …
- 3,407
7
votes
Generate polygons from a set of intersecting lines
Well, we put an answer here which is not a complete answer to our question, that is, the question will remain "open for answering". It is however a solution for the problem in the question. Here is th …
- 3,407
0
votes
Generating polygonal blocks using growing lines
We put our recent idea here as an answer instead of updates to the question.
Here are our efforts so far as solutions.
Pseudo-code of our initial solution:
while any(endpoint can grow):
for …
- 3,407