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

How to obtain initial seeds? #15

Open
jiayily opened this issue Sep 18, 2024 · 0 comments
Open

How to obtain initial seeds? #15

jiayily opened this issue Sep 18, 2024 · 0 comments

Comments

@jiayily
Copy link

jiayily commented Sep 18, 2024

Not really understand the rule of picking ground seeds.

for(int i=0 ; i< (int) p_sorted.points.size() ; i++){
if(p_sorted.points[i].z < lpr_height + TH_SEEDS_){
if (p_sorted.points[i].z < lpr_height-TH_OUTLIER_) continue;
init_seeds.points.push_back(p_sorted.points[i]);
}
}

The processing above calculates the mean z in a tri-grid node and pick points whose z belong to [mean_z-TH_OUTLIER_, mean_z+TH_SEEDS_). This may include many points from obstacles. Why not pick Lowest Points?

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

No branches or pull requests

1 participant