Samuel Oren Yusim is a user on mastodon.gamedev.place. You can follow them or interact with them if you have an account anywhere in the fediverse. If you don't, you can sign up here.

Samuel Oren Yusim @fonzonzonz@mastodon.gamedev.place

Pinned toot

Things about me:
Likes:
πŸ”Έ video games
πŸ”Ή (creator-owned) comics
πŸ”Έ math
πŸ”Ή drawing and writing and making music sometimes
🌺 flowers

Dislikes:
◼️ superheroes
◾️ the news
◼️ sleeping
πŸ’° capitalism

🎢
friends told her she was better off at the bottom of a river
than in a bed with him
he said until you try both you won't know what you like better
why don't we go for a swim

well friends told her this and friends told her that
but friends don't choose what echoes in your head
when she got bored with all
the idle chit and chat
started thinkin bout what he said

I'll swim even when the water's cold
that's the one thing that I know

Best number?
πŸ”Έ 69
πŸ”Ή 420
πŸ”Έ other

Yo. This morning I'm making slides for a talk about drawing graphs on surfaces, based primarily on the (free to download!) paper at sciencedirect.com/science/arti

πŸ‡¨πŸ‡¦ πŸ‡¨πŸ‡¦ πŸ‡¨πŸ‡¦ Also, 2/3 authors are Canadian!!! πŸ‡¨πŸ‡¦ πŸ‡¨πŸ‡¦ πŸ‡¨πŸ‡¦

Gotta say, October is a way better month for thanksgiving than November. πŸ‡¨πŸ‡¦ 4ever

I am finding that the less I do, the more tired I am. πŸ”„

What are people's opinions on the Corgi Engine? I love the way it looks.

Here's a problem: you want to draw n closed curves such that every one touches every other one, but with the minimum possible number of intersections between the curves. Here are some optimal drawings for n=5 and n=6. mastodon.gamedev.place/media/8

Today I am yet again writing about drawing graphs with as few edge crossings as possible.

Hill's conjecture says that the formula below gives the minimum number of crossings in a drawing of a complete graph on n vertices. It's unknown whether it holds for n >= 13, and this is a pretty active area of research within graph theory.

My plan: set up some basic top-down RPG mechanics and add features and story in a sort of stream-of-consciousness way

Remember when you could get the new year glasses that looked like this: 2πŸ‘€ 2

Currently: researching Heaven's Gate for a possible game idea

Good morning! Here's a complete graph drawn with as few crossings as possible. The only known proofs of this are done by computers and aren't human-readable.

I am the ANALOG HACKER *randomly spinning dial on a combination lock for 35 minutes straight until it opens* I"M IN