[Feat] Add adaptive graph construction (k-NN + Delaunay)#121
Open
Riya3024 wants to merge 1 commit intomllam:mainfrom
Open
[Feat] Add adaptive graph construction (k-NN + Delaunay)#121Riya3024 wants to merge 1 commit intomllam:mainfrom
Riya3024 wants to merge 1 commit intomllam:mainfrom
Conversation
Author
|
Initial prototype implementation for adaptive graph construction. Open to feedback and suggestions for integration. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR introduces a prototype for adaptive graph construction to support non-uniform input grids.
Motivation:
Current graph construction assumes regular rectilinear grids. This PR explores methods for irregular and sparse datasets.
Features:
This work aligns with GSoC 2026 Project 1 (Flexible Graph Construction).
Next steps:
Related: #119