arXiv (All)
open access
Best of Two Worlds: Combining High and Low Resolution to Compute Viewsheds on terrains
The viewshed of a point $v$ on a grid terrain $T$, viewshed$_T(v)$, is defined as the set of grid points in $T$ that are visible from $v$. We describe a novel algorithm for computing viewshed$_T(v)$ using a multi-resolution approach: Given a parameter $k >1$ that represents the block size, we create
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Structured Distributed Computation under Communication and Computation Constraints#796406
- Adapting a Foundation Model for Lunar Surface Height Estimation#924330
- Adapting a Foundation Model for Lunar Surface Height Estimation#920099
- Automated extraction of elevation profiles from limited imagery for bridge design / Morris Florek, Maximilian Kellner, Johannes Reimer, Steffen Marx, Alexander Reiterer, Chongjie Kang#780416
- Terrain Synthesis and Authoring based on Iso‐Contours#153845
Record · ID 1155876
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive