(no title)
ColinDabritz | 1 year ago
https://dukenukem.fandom.com/wiki/Lunatic_Fringe
This level had a circular hallway ring around the outside that had two full rotations around without intersecting, using the 'build' engine's ability to separate areas by their room connections that also drove the 'room over room' technology which was groundbreaking at the time.
It made for fun multiplayer, and the illusion held well there. The central chamber has 4 entrances/exits if I recall, and you would only encounter two of them in each loop around the outside.
I recall building a toy level while experimenting with the engine that "solves" the "3 houses with 3 utilities without crossing" puzzle using this trick as well.
lucianbr|1 year ago
ColinDabritz|1 year ago
snthpy|1 year ago
unknown|1 year ago
[deleted]
whoopdedo|1 year ago
Bungie's Marathon from 1994 could also do this and demonstrated it in the deathmatch map 5-D Space[1]. It was really only Doom that bugged out on overlapping sectors.
[1] https://www.lhowon.org/level/marathon/30
immibis|1 year ago
If you can rasterize the inside of a convex shape, you can rasterize a sector-portal-world by marking certain faces as portals, and when rendering one, setting the clipping region (or stencil buffer) to where the face would be, then rendering the sector behind it with an appropriate transformation (which is part of the portal's data, alongside the ID of the other sector).
Collisions through portals are much harder than rendering through portals.
dfox|1 year ago
While Lunatic Fringe is pretty in-your-face example of impossible geometry in build, the duke3d maps contain many more cases of intersecting geometry. Obviously such things are impossible in Doom because there is no way to build BSP tree out of that and because doom only tracks X/Y coordinates of player(s)/monsters.
somat|1 year ago
https://www.youtube.com/watch?v=Iq1-TZXz9xo (myhouse.wad)
There is nothing about the data structures ID choose to use in doom that prevent portal shenanigans. ID(John Carmack) just did not implement them.
formerly_proven|1 year ago
wizzwizz4|1 year ago
justsomehnguy|1 year ago
It does, otherwise Lost Souls and Cacodemons wouldn't able to fly.
ant6n|1 year ago
Andrew_nenakhov|1 year ago
jandrese|1 year ago
Synaesthesia|1 year ago
https://www.youtube.com/watch?v=UitzmhJe578
thaumasiotes|1 year ago
In graph theory's terminology, this is "K3,3", one of two irreducible nonplanar graphs. The other one is K5.
You can also make all the connections without crossing any edges if you embed the graph in a torus, which is equivalent to building a bridge over some set of edges that other edges are allowed to take.
eek2121|1 year ago
Thanks for the throwback!
SJC_Hacker|1 year ago
Descent did this in 1994.
ChrisClark|1 year ago