arXiv (OAI Expanded)
open access
Computing the minimal perimeter polygon for digital objects in the triangular tiling
This work presents an algorithm, together with its correctness proof, to determine the minimum perimeter polygon (MPP) for digital objects given as regular complexes in the triangular plane tiling. Such objects are edge-adjacency-connected sets of triangle tiles that have no end tiles, and the point
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
- Hexagonal Tiling of the Plane#177103
- Approximation Algorithms for Perfect Fair-Triangle Packing#652430
- Approximation Algorithms for Perfect Fair-Triangle Packing#650977
- Trihexagonal Magic Figures: A High-Constraint-Density Triangular Combinatorial Design and the Possibility of a Phase Transition#972597
- Combinatorial and graph-theoretic properties of the (1,1)-octagonal tilings#332321
Record · ID 1083616
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