The visible perimeter of an arrangement of disks

DOI10.1016/j.comgeo.2013.08.006zbMath1288.65028OpenAlexW3101817382MaRDI QIDQ390363

János Pach, Gábor Tardos, Gabriel Nivasch

Publication date: 8 January 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.08.006

zbMATH Keywords

visibilitydense point setopaque diskoverlapping symbolsstacking ordervisible perimeter

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Unnamed Item
• Convex independent sets and 7-holes in restricted planar point sets
• Nice point sets can have nasty Delaunay triangulations
• Lines, line-point incidences and crossing families in dense sets
• Algorithmic aspects of proportional symbol maps
• The maximum size of a convex polygon in a restricted set of points in the plane

This page was built for publication: The visible perimeter of an arrangement of disks