EllipticCurve's comments

I am currently writing my own compiler for a smaller language :)

This is my first real compiler and it's lots of fun!!! It's also my first time working with x86-64 assembler (compiler target).

I'll write a Show HN post when I finished it.

Location: Hamburg, Germany

Remote: Maybe, not ideal

Willing to relocate: No

Technologies: C/C++, Go, Python (+ many more), OpenGL, Computergraphics, GPGPU, algorithm development (Currently working on Radar clustering/classification)

Résumé/CV: https://github.com/MauriceGit/Organisation/blob/master/proje...

Email: [email protected]

In addition to the advice given by the others, I would suggest to maybe participate in the Advent-of-code (https://adventofcode.com/). It started a few days ago but you should be able to quickly catch up.

You might do it to get back into coding, put it on a resume or just for fun (my reason to do it).

But the community around it (https://www.reddit.com/r/adventofcode/) is really great and it's a lot of fun!

It also provides as a specific daily purpose, in contrast to some random code test online.

Best of luck!

Thanks for the link, participated.

Nice concise, adaptive survey.

C++ and Python3 in the automated driving industry

I'm exactly in the same position. I'd love to do something on my own. But it seems, I'm just not the idea guy.

If you don't mind - What sector are you in/is your recruiter working in? Really good recruiters (such as yours it seems) are really scarce. Would you mind sharing the contact of her on LinkedIn/Xing (Here or per mail (see my profile))?

I learned, that working in a cutting edge field in a huge well known/respected company (europe) is most of the time really not that exciting and the actual work not that cutting edge.

My feeling is, that we were doing more complex problem solving at university and my personal projects are much more challenging than most things we do at work.

It's honestly quite a bit frustrating. And makes me want to build something up myself. Problem is, I am just not an idea-person...

Right. Must have slipped me, fits a lot better, I agree! Next time..

Thanks, that means a lot :)

In this case real-time in the sense that one can adjust parameters and (for not too many points) get an instant result instead of an image on disk. Additionally, I used all components to have it displayed with an adjustable fps count (OpenGL based rendering).

But I see, that the meaning of real-time is a bit biased. Any suggestions?

I completely agree! That's why I wrote the underlaying Voronoi/Delaunay library myself from scratch as well (turns out - not the fastest but still really fast and robust compared other implementations).

Do you have any interesting ideas for other projects on top of your head? I struggle a bit to actually use it in a useful way.

That is awesome, do it :)

That is a really cool idea! The whole Voronoi topic is kind of a passion project - I really like the look and feel of the Voronoi pattern.

So I'll keep that in mind for later, thanks!

I still use Geany every day! From writing up todo-lists at work, to maintaining my Go, Python and C/C++ projects.

Geany is my absolute go-to editor of choice. Fast, stable and really clean interface. Absolutely love it!!!

I like the idea. But unfortunately, it gave me matches with ~80% confidence with the tags not matching anything I ever touched (and not even know what that is).

And, when hitting enter, it just resets the github name instead of searching (little inconvenient).

Except, that you give out your location data by yourself. A choice no one makes for you except yourself.

Or: Using basic computergraphics to display a nodosaur 3D model

Pretty neat :)

But sometimes straight lines have some kind of angle introduced which shouldn't be there in a correct Voronoi tessellation.

For example: {"sites":[355,413,372,413],"queries":[]} should be a straight line, but has two angles. Have I missed something?

I have a simple Python implementation of Countingsort, Bucketsort and Radixsort, if it helps: https://github.com/MauriceGit/Advanced_Algorithms

Yeah, well, now you get an exception. Not much better...

You should look into bucketsort. That allows you to sort in finite universes in Theta(n+k) without allocating huge arrays for large integers.

That is true. Just want to add, that the lower bound for sorting is O(n log(n)) for comparison based sorting in infinite universes. The comparison based factor rules out sorting of any element, that can not be reduced to an integer. Infinite universes in sense, that we don't know about the elements/element-range beforehand.

Sorting in θ(n+k) w.c. and a.c. (most of the time this is equal to O(n)) is possible for finite boundaries that allows for countingsort or bucketsort (radixsort uses countingsort internally).

Some implementations of those algorithms in Python: https://github.com/MauriceGit/Advanced_Algorithms