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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have