ISTA Publications
metadata only
Mesh simplification for unfolding
We present a computational approach for unfolding 3D shapes isometrically into the plane as a single patch without overlapping triangles. This is a hard, sometimes impossible, problem, which existing methods are forced to soften by allowing for map distortions or multiple patches. Instead, we propos
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
- Computational Geometry#3535
- Hexagonal Tiling of the Plane#177103
- Optimization of a Triangular Delaunay Mesh Generator using Reinforcement Learning#798589
- Optimization of a Triangular Delaunay Mesh Generator using Reinforcement Learning#797176
- An advancing-ridge approach for recovering boundary $(d-1)$-simplices in $d$-dimensional meshes#612599
Record · ID 1358965
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