Corpus ID: 56148289

Proceedings of the 30th Canadian Conference on Computational Geometry, CCCG 2018, August 8-10, 2018, University of Manitoba, Winnipeg, Manitoba, Canada

@inproceedings{August2018ProceedingsOT,
  title={Proceedings of the 30th Canadian Conference on Computational Geometry, CCCG 2018, August 8-10, 2018, University of Manitoba, Winnipeg, Manitoba, Canada},
  author={August and S. Kamali and S. Durocher and M. Katz and M. V. Kreveld and Carola Wenk and D. Bremner and T. Mchedlidze and Mohammad Ali Abam and A. Abdelkader and A. Ahadi and Carlos Alegr{\'i}a-Galicia and Aritra Banik and J. Bowers and G. Br{\"u}ckner and L. E. Caraballo and Farah Chanchary and M. Davoodi and F. Duque and M. Farshi and K. Fox and K. Gardner and N. Giansiracusa and B. Gutierrez and A. Guzm{\'a}n-S{\'a}enz and Carlos Hidalgo-Toscano and Ivor V.D. Hoog and M. Jahanseir and M. Kazemi and Kamyar Khodamoradi and Bernhard Kilgus and Chih-Hung Liu and B. Niedermann and Tim Ophelders and J. Phillips and Marcel Roeloffzen and {\'E}rika Rold{\'a}n and Rasoul Shahsavarifar and Naghmeh Shahverdi Zade Shargh and Willem Sonke and Frank Staals and Katharine Turner and J{\'e}r{\^o}me Urhausen and M. V. Kerkhof and E. V. Leeuwen and J. Vermeulen},
  booktitle={CCCG},
  year={2018}
}
  • August, S. Kamali, +44 authors J. Vermeulen
  • Published in CCCG 2018
  • Computer Science
  • Ply number is a recently developed graph drawing metric inspired by studying road networks. Informally, for each vertex v, which is associated with a point in the plane, a disk is drawn centered on v with a radius that is α times the length of the longest edge incident to v, for some constant α ∈ (0, 0.5]. The ply number is the maximum number of disks that overlap at a single point. We show that any tree with maximum degree ∆ has a 1-ply drawing when α = O(1/∆). We also show that trees can be… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-6 OF 6 REFERENCES
    Solving geometric problems with the rotating calipers
    • 537
    • Highly Influential
    Approximating extent measures of points
    • 317
    • Highly Influential
    • Open Access
    Epsilon geometry: building robust algorithms from imprecise computations
    • 251
    • Highly Influential
    • Open Access
    Data Imprecision in Computational Geometry
    • 62
    • Highly Influential
    Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
    • 41
    • Open Access
    Computational geometry and facility location
    • 50
    • Highly Influential