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?
-
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?
-
-
Suppose you have a function 𝑓: ℝⁿ ↦ ℝ. Then define a level hypersurface 𝑓(𝒓) = c. Say I want to adaptively approximate points of that surface in ℝⁿ up to a certain precision. Except the points aren't constrained to rays, but some pre-defined surface or volume element.
-
For concreteness let’s assume we’re intersecting with a plane. I would start with a random point on the plane and evaluate f, if the value is c then you add the point to your collection. It it isn’t, calculate the derivatives and do gradient descent.
Keskustelun loppu
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.