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

Omit additional nodes created by DCEL algorithm in output #487

Open
peterstace opened this issue Jan 12, 2023 · 1 comment
Open

Omit additional nodes created by DCEL algorithm in output #487

peterstace opened this issue Jan 12, 2023 · 1 comment
Assignees
Labels
DCEL Doubly Connected Edge List

Comments

@peterstace
Copy link
Owner

Idea:

  • Keep track of which nodes are introduced artificially when re-noding geometries.
  • E.g. this could be done as a map[triple]struct{}, where triple is 3 XY values (before the node, the node itself, and after the node).
  • During the output phase, the map can be checked and any artificially introduced nodes can be removed.
@peterstace peterstace added the DCEL Doubly Connected Edge List label Jan 12, 2023
@peterstace peterstace self-assigned this Jan 19, 2023
@peterstace peterstace added the up next What we're planning to do next label Jan 19, 2023
@peterstace peterstace removed the up next What we're planning to do next label Feb 2, 2023
@peterstace
Copy link
Owner Author

This may be exacerbated by the introduction of "ghost joining" geometries.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
DCEL Doubly Connected Edge List
Projects
None yet
Development

No branches or pull requests

1 participant