Skip to main content

All Questions

2 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
3 votes
0 answers
111 views

Is there a Havel-Hakimi for geometric graphs?

Suppose that we are given $n$ points in the plane, with a degree prescribed for each, and the question is whether we can place a geometric graph on them. Is there an efficient algorithm for this? ...
domotorp's user avatar
  • 19k
1 vote
0 answers
79 views

Touring a sequence of convex polygons with minimal energy

There is a known problem of touring a sequence of $n$ polygons: given a starting point $s$, an ending point $t$ and a sequence of polygons $P_1,\dots,P_k$ with a total of $n$ vertices, find points $...
ssss nnnn's user avatar
  • 177