How could raytracing algorithms be generalized to higher dimensions, "surface tracing" or "volume tracing"? For instance, instead of computing ray-surface intersection, what if we wanted surface-volume intersections?
As far as I know, you just solve the equation. e.g. which points satisfy the equation for the line and the sphere. For a 1 d line intersecting a 2d surface, the result is generically a point. But for higher dimensions it could be anything. What would that mean in terms of pixels?
-
-
It's fundamentally just a geometric intersection algorithm. The goal here would not be rendering, but finding points in a surface or volume (as opposed to a ray) that intersect an object. Intersections are more complex and need to be "walked over", but that's my question.
-
If you define your objects implicitly (e.g. x^2+y^2=1), then finding intersections is trivial. Can you elaborate on the question in case I’m not getting it?
- Näytä vastaukset
Uusi keskustelu -
Lataaminen näyttää kestävän hetken.
Twitter saattaa olla ruuhkautunut tai ongelma on muuten hetkellinen. Yritä uudelleen tai käy Twitterin tilasivulla saadaksesi lisätietoja.