An $O(n)$ Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection (Q4037686)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(n) Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection |
scientific article; zbMATH DE number 169002
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An $O(n)$ Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection |
scientific article; zbMATH DE number 169002 |
Statements
An $O(n)$ Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection (English)
0 references
16 May 1993
0 references
depth-first search
0 references
rectangular dissection
0 references
wall representation
0 references
subregion-tree representation
0 references
transitive reduction
0 references
acyclic digraph
0 references
0.7560863494873047
0 references
0.7386412024497986
0 references
0.7358967065811157
0 references
0.7320857644081116
0 references
0.7311140894889832
0 references
