Research map / Graph learning / Graph algorithms and clustering
On the Problem of Covering a 3-D Terrain
Eduard Eiben, Isuru Godage, Iyad Kanj, Ge Xia
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Increase camera range from 4 to 12 | Grid-based heuristic · terrain range 10 | covering vertices / total vertices: 0.3774 -> 0.1242 | Improved |
| Increase camera range from 4 to 12 | Grid-based heuristic · terrain range 10 | tour weight / total edge weight: 0.6317 -> 0.3267 | Improved |
| Increase camera range from 4 to 12 | Global heuristic · terrain range 80 | tour weight / MST weight: 1.0559 -> 0.5289 | Improved |
| Increase terrain elevation range from 10 to 80 | Grid-based heuristic · camera range 4 | covering vertices / total vertices: 0.3774 -> 0.4246 | Hurt |
| Increase terrain elevation range from 10 to 80 | Grid-based heuristic · camera range 12 | tour weight / total edge weight: 0.3267 -> 0.3518 | Hurt |
| Increase terrain elevation range from 10 to 40 | Grid-based heuristic · camera range 4 | covering vertices / total vertices: 0.3774 -> 0.3750 | No clear effect |
| Global MST-based tour instead of per-grid-cell tours | heuristic algorithm · terrain range 10, camera 4 | tour weight / total edge weight: 0.6317 -> 0.6079 | Improved |
| Global MST-based tour instead of per-grid-cell tours | heuristic algorithm · terrain range 80, camera 12 | tour weight / MST weight: 0.5576 -> 0.5289 | Improved |
| Global heuristic instead of grid heuristic | heuristic algorithm · terrain range 40, camera 4 | covering vertices / total vertices: 0.3750 -> 0.3413 | Improved |
| Global heuristic instead of grid heuristic | heuristic algorithm · terrain range 80, camera 4 | tour weight / MST weight: 1.0904 -> 1.0559 | Improved |
Closest papers by meaning
- Heterogeneous Multi-Robot Graph Coverage with Proximity and Movement Constraints (AAAI 2025 · similarity 0.85)
- Large-Scale Multi-Robot Coverage Path Planning via Local Search (AAAI 2024 · similarity 0.85)
- Quasiconvex Plane Sweep for Triangulation With Outliers (ICCV 2017 · similarity 0.80)
- PL$${}_{1}$$P: Point-Line Minimal Problems under Partial Visibility in Three Views (IJCV 2024 · similarity 0.80)
- PL₁P - Point-line Minimal Problems under Partial Visibility in Three Views (ECCV 2020 · similarity 0.80)
- Lifting Vectorial Variational Problems: A Natural Formulation Based on Geometric Measure Theory and Discrete Exterior Calculus (CVPR 2019 · similarity 0.80)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
