arXiv (All)
open access
Convex Quadratic Distance Field Computation
Methods for computing distances from sources on discrete meshes commonly either compute geodesics directly on polyhedral surfaces or approximate the distance in a finite-element framework. Exact window-based polyhedral methods are highly accurate on clean manifold surfaces, but their unfolding const
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
- Geodesic Difference-in-Differences#793411
- Geodesic Difference-in-Differences#789407
- Closure complexity of Bänsch-type algorithms for tetrahedral mesh refinement#1077544
- On the treatment of topology changes on 3D polyhedral moving meshes via 4D space-time hole-like elements in direct ALE ADER-DG methods#665775
- On the treatment of topology changes on 3D polyhedral moving meshes via 4D space-time hole-like elements in direct ALE ADER-DG methods#664275
Record · ID 985004
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