2026/01/19

Newest at the top

2026-01-19 22:59:34 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-01-19 22:55:37 +0100debayan(~debayan@user/debayan) (Quit: WeeChat 4.8.1)
2026-01-19 22:52:54 +0100marinelli(~weechat@gateway/tor-sasl/marinelli) marinelli
2026-01-19 22:49:55 +0100debayan(~debayan@user/debayan) debayan
2026-01-19 22:49:04 +0100trickard_(~trickard@cpe-82-98-47-163.wireline.com.au)
2026-01-19 22:48:29 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 250 seconds)
2026-01-19 22:46:33 +0100trickard(~trickard@cpe-82-98-47-163.wireline.com.au) (Read error: Connection reset by peer)
2026-01-19 22:43:49 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-01-19 22:36:47 +0100tromp(~textual@2001:1c00:3487:1b00:6d43:de22:a68b:dec7)
2026-01-19 22:35:37 +0100 <EvanR> yeah
2026-01-19 22:34:38 +0100 <jreicher> ("smooth")
2026-01-19 22:34:32 +0100 <jreicher> Not just closed, but "no corners"
2026-01-19 22:32:46 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 255 seconds)
2026-01-19 22:31:00 +0100tromp(~textual@2001:1c00:3487:1b00:f96f:f7c1:9b58:4be8) (Quit: My iMac has gone to sleep. ZZZzzz…)
2026-01-19 22:28:02 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-01-19 22:25:30 +0100 <EvanR> then it sweeps over the entire plane
2026-01-19 22:24:44 +0100 <EvanR> or you mean if it's one closed curve
2026-01-19 22:24:32 +0100 <EvanR> taking the square again, it misses huge parts of the plane entirely
2026-01-19 22:24:16 +0100 <EvanR> no, that was a botched prediction
2026-01-19 22:20:31 +0100 <jreicher> So if the curve is an analytic function (very smooth) then you agree every point on the plane will be coloured?
2026-01-19 22:19:03 +0100 <EvanR> at corners if there are any, stop and start again in another direction
2026-01-19 22:18:45 +0100 <jreicher> There was a bit of ambiguity about what would happen at the corners
2026-01-19 22:18:33 +0100 <jreicher> *now
2026-01-19 22:18:29 +0100 <jreicher> Ah, no I get you.
2026-01-19 22:18:28 +0100 <EvanR> 4?
2026-01-19 22:18:12 +0100 <EvanR> e.g. taking a solid square tile as an example, the interior has 8 rays going through it at any given point
2026-01-19 22:16:53 +0100 <EvanR> not every point
2026-01-19 22:16:43 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 246 seconds)
2026-01-19 22:16:40 +0100 <jreicher> If you don't "step" along the curve in discrete amounts I think probie is right and that every point will have an infinite number of rays passing through. You might be able to concoct some kind of "density" measure though. incidentally this is reminiscent of https://en.wikipedia.org/wiki/Jordan_curve_theorem
2026-01-19 22:14:50 +0100 <EvanR> jreicher, yeah
2026-01-19 22:14:44 +0100 <EvanR> noodling it out, points might have finite rays through it, or infinite if there was a caustic focus point
2026-01-19 22:12:24 +0100 <jreicher> BTW by "two rays" do you mean one on one side of the curve and one on the other? So the idea is one ray is "inside" the shape and the other is "outside"?
2026-01-19 22:12:23 +0100 <probie> Or are there a finite number of points on each curve?
2026-01-19 22:11:36 +0100 <probie> Would every ball on this plane have an infinite numbers of rays going through it?
2026-01-19 22:11:30 +0100 <jreicher> I think it's a geometric construction
2026-01-19 22:11:04 +0100 <EvanR> in fact it's totally wrong, but is it even an algorithm
2026-01-19 22:10:55 +0100sajenim(~sajenim@user/sajenim) (Ping timeout: 240 seconds)
2026-01-19 22:10:01 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-01-19 22:04:53 +0100 <EvanR> it might also be just wrong, but I'm tabling that for now xD
2026-01-19 22:02:33 +0100pavonia(~user@user/siracusa) siracusa
2026-01-19 22:01:23 +0100Tuplanolla(~Tuplanoll@85-156-32-207.elisa-laajakaista.fi) Tuplanolla
2026-01-19 22:00:34 +0100 <EvanR> the issue is, is this even an algorithm
2026-01-19 22:00:22 +0100 <EvanR> which you interpret as the color
2026-01-19 22:00:04 +0100 <EvanR> after following all the curves, either forever, or to their conclusion, the plane is populated with positive or negative numbers (no zeros, unless you did something messed up like crossing two curves)
2026-01-19 21:59:19 +0100 <EvanR> I have an algorithm for drawing certain black and white shapes, but there might be an issue with it. First the algorithm: start with an infinite plane of all 0s. for each smooth segment of the shapes boundary, follow the curve and paint 2 rays going 90 degrees to the curve at each point. The rays add +1 or -1 respectively anywhere they go, depending on if this is the black ray or white ray
2026-01-19 21:59:13 +0100marinelli(~weechat@gateway/tor-sasl/marinelli) (Client Quit)
2026-01-19 21:59:13 +0100 <yin> great
2026-01-19 21:59:05 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 245 seconds)
2026-01-19 21:58:59 +0100marinelli(~weechat@gateway/tor-sasl/marinelli) marinelli
2026-01-19 21:58:41 +0100marinelli(~weechat@gateway/tor-sasl/marinelli) (Remote host closed the connection)