Abstract
This paper presents a new linear-time algorithm for finding rectangular duals of planar triangular graphs. The algorithm is conceptually simpler than the previously known algorithm. The coordinates of the rectangular dual constructed by the new algorithm are integers and carry clear combinatorial meaning.
| Original language | English |
|---|---|
| Pages (from-to) | 1218-1226 |
| Number of pages | 9 |
| Journal | SIAM Journal on Computing |
| Volume | 22 |
| Issue number | 6 |
| DOIs | |
| State | Published - 1993 |
Fingerprint
Dive into the research topics of 'On finding the rectangular duals of planar triangular graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver