Comment by dagss
I obviously don't know that my past two days of work would have taken two weeks in the alternative route, but it's my feeling for this particular work:
I'm implementing a drawing tool on top of maps for fire departments (see demo.syncmap.no -- it's only in Norwegian for now though, plan to launch in English and Show HN it in some months). Typescript, Svelte, Go, Postgres.
This week I have been making the drawing tools more powerful (not deployed publicly yet).
* Gesture recognition to turn wobbly lines into straight lines in some conditions
* Auto-fill closed shapes: Vector graphics graph algorithms to segment the graph and compute the right fill regions that feel natural in the UI (default SVG fill regions were not right, took some trial and error to find something that just feels natural enough)
* Splines to make smoother curves .. fitting Catmull-Rom, converting those to other splines for SVG representation etc
* Constraints when dragging graph nodes around that shapes don't intersect when I don't want them to etc
I haven't been working all that much with polygon graphics before, so the LLM is very helpful in a) explaining me the concepts and b) providing robust implementations for whatever I need.
And I've had many dead ends that didn't feel natural in UI that I could discard after trying them out in full, without loosing huge investment.
These are all things that are very algorithm and formula intensive and where I would have had do to a lot of reading and research to do things right myself. (I could deal with it, but it takes a lot of time to read up on it.)
I review to see that it "looks sensible", not every single addition and division in the spline interpolations, or every step of the graph segmentation algorithms used to compute fill regions. I review function signatures and overall architecture, not the small details (in frontend -- obviously the backend authorization code is reviewed line by line..)
Fresh example:
I described a problem on UI level. LLM suggested the Ramer-Douglas-Peucker algorithm to solve it, which I have never heard about before. It implemented it. Works perfectly. It is 40 lines of code (of which I only really need to review the function signature, and note the fact that it's a recursive bisection algorithm). I would have spent a very long trying to figure out what to do here otherwise and the LLM handed me the solution.