Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Implement efficient distance field calculation #24

Draft
wants to merge 10 commits into
base: develop
Choose a base branch
from

Conversation

CuddlyBunion341
Copy link
Owner

@CuddlyBunion341 CuddlyBunion341 commented Jan 30, 2024

A distance field (or distance transform or distance map) is a gridded structure where each cell in the grid represents the shortest distance from that cell to a cell with some other property. Most often that "other property" is a boundary type of cell, such as a wall that a player cannot pass, or the surface of a mesh.
Stack Exchange

This is the basis for a efficient jump list for the glsl raymarcher #21.

Possible implementations

  • Grid sweeping
  • ...

The distance fields are not being calculated, yet.
@CuddlyBunion341 CuddlyBunion341 marked this pull request as draft January 30, 2024 07:22
@CuddlyBunion341 CuddlyBunion341 self-assigned this Jan 30, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant