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

Better way to detect whether there are occlusion in plots for ranking #423

Open
kanitw opened this issue Nov 29, 2017 · 0 comments
Open

Better way to detect whether there are occlusion in plots for ranking #423

kanitw opened this issue Nov 29, 2017 · 0 comments

Comments

@kanitw
Copy link
Member

kanitw commented Nov 29, 2017

I believe right now we only check if the plot is aggregated.

But if the plot is aggregated but have other detail channels (e.g., detail, color), they there might be occlusion.

In addition, for x:discrete/y:discrete plots if each pair of (x,y) has only one unique value / row, then there is no occlusion too.
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
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@kanitw