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.

Sign up for GitHub

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

Jump to bottom

HDX/AV: Divide and Conquer Closest Pairs enhancements #485

Closed
6 of 10 tasks
jteresco opened this issue Feb 22, 2023 · 1 comment
Closed
6 of 10 tasks

HDX/AV: Divide and Conquer Closest Pairs enhancements #485

jteresco opened this issue Feb 22, 2023 · 1 comment
Assignees
@jteresco
Labels
D&C Closest Pair AV enhancement existing algorithm visualization pedagogical user interface

Comments

@jteresco
Copy link
Contributor

jteresco commented Feb 22, 2023 •
edited
Loading

  • bounding box on current recursive call's point range (decided not to implement)
  • display number of points in each recursive call's range and number of points
  • user-specified limit on number of recursive levels
  • show closest pairs found so far on the way out of recursion
  • show number of points in the center strip
  • show number of distance computations in the brute force base case (decided not to implement)
  • show total number of distance computations
  • option to show details of brute-force base case searches (now HDX/AV: D&C Closest Pair base case details #488)
  • option to hide details of center strip searches (to emphasize the divide and conquer nature without overly complicating the visualization) (now HDX/AV: D&C Closest Pair hide details of overlap search #489)
  • count of the number of closest pairs found in overlap regions
jteresco added a commit that referenced this issue Feb 22, 2023
@jteresco
Toward #485, honoring recursion limit for D&C closest pairs.
ca093f2
jteresco added a commit that referenced this issue Feb 23, 2023
@jteresco
Progress on D&C closest pairs, #485
bc920c6
jteresco added a commit that referenced this issue Feb 24, 2023
@jteresco
Progress on D&C closest pairs, number of points in current call range, …
5c799c8 
…#485
@jteresco jteresco self-assigned this Feb 25, 2023
jteresco added a commit that referenced this issue Feb 28, 2023
@jteresco
D&C Closest Pair rewrites, toward #485
ba84b8c
jteresco added a commit that referenced this issue Mar 1, 2023
@jteresco
Progress on D&C closest pairs, #485
6aa03c6
jteresco added a commit that referenced this issue Mar 1, 2023
@jteresco
Progress on D&C closest pairs, #485
b2e7546
jteresco added a commit that referenced this issue Mar 1, 2023
@jteresco
Distance comparison counter for D&C closest pairs, #485
112403b
jteresco added a commit that referenced this issue Mar 1, 2023
@jteresco
Leader connecting lines and removal of defeated leaders, D&C closest …
ce89e1c 
…pairs, toward #485
jteresco referenced this issue Mar 3, 2023
@jteresco
Correct longitude range computation, other work on D&C closest pair, #…
415b969 
…465
jteresco referenced this issue Mar 3, 2023
@jteresco
First working D&C closest pairs, toward #465
b5f35ea
jteresco referenced this issue Mar 3, 2023
@jteresco
Add box for search area in overlap, D&C closest pairs, toward #465
c977959
jteresco added a commit that referenced this issue Mar 3, 2023
@jteresco
Report overlap points and new leaders found, D&C closest pairs, toward …
13aba3a 
…#485
jteresco added a commit that referenced this issue Mar 3, 2023
@jteresco
Show current overlap count, D&C closest pairs, toward #485
818bf9c
This was referenced Mar 3, 2023
Open
Open
@jteresco jteresco closed this as completed Mar 3, 2023
@jteresco
Copy link
Contributor Author

jteresco commented Mar 3, 2023

Moved remaining enhancements that are still under consideration to new Issues #488 and #489.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@jteresco jteresco

Labels
D&C Closest Pair AV enhancement existing algorithm visualization pedagogical user interface
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@jteresco