Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons

M.A. Abam, B. Aronov, M.T. Berg, de, A. Khosravi Dehkordi

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

5 Citations (Scopus)
345 Downloads (Pure)

Fingerprint

Dive into the research topics of 'Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons'. Together they form a unique fingerprint.

Mathematics

Computer Science