Area Requirement of Gabriel Drawings.
BROWN UNIV PROVIDENCE RI CENTER FOR COMPUTER AND INFORMATION SCIENCES
Pagination or Media Count:
In this paper we investigate the area requirement of proximity drawings and we prove an exponential lower bound. Namely, our main contribution is to show the existence of a class of Gabriel-drawable graphs that require exponential area for any Gabriel drawing and any resolution rule. Also, we extend the result to an infinite class of proximity drawings.
- Numerical Mathematics