arXiv (All)
open access
An empirical study of various candidate selection and partitioning techniques in the DIRECT framework
Over the last three decades, many attempts have been made to improve the DIRECT (DIviding RECTangles) algorithm's efficiency. Various novel ideas and extensions have been suggested. The main two steps of DIRECT-type algorithms are selecting and partitioning potentially optimal rectangles. However, t
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
- Parameterized Complexity of Edge-Constrained Graph Partitioning#793011
- Parameterized Complexity of Edge-Constrained Graph Partitioning#789007
- Graphical approach to minimum flowrate targeting for partitioning water pretreatment units#474642
- Solution Space Partitioning for Extremal Set Theory#1083157
- Explainable pulmonary fibrosis detection using edge-strengthened dilated holistic edge detection-based lung segmentation and ResNet-V2 classification.#430790
Record · ID 986060
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