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

Optimization of Delaunay-Strebel graphs computation #58

Open
videlec opened this issue Jan 3, 2025 · 0 comments
Open

Optimization of Delaunay-Strebel graphs computation #58

videlec opened this issue Jan 3, 2025 · 0 comments

Comments

@videlec
Copy link
Contributor

videlec commented Jan 3, 2025 •
edited
Loading

  • currently, any computation in genus 3 takes forever. We should try to optimize the code to be able to at least perform some of them
    • H(4)^odd: 4 mins at 7571668 for a graph with 35476 vertices and 152176 edges
    • H(2,2)^odd: ? for a graph with 711568 vertices and ? edges
    • H(3,1): ? for a graph with 1317136 vertices and ? edges
    • H(2,1,1): ?
    • H(1,1,1,1): ?
  • computing the list of veering triangulations associated to a given Strebel graph could be extremely slow Optimization of StrebelGraph.veering_triangulations() #57
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@videlec