Privacy sets for constrained space-filling

From MaRDI portal




Abstract: The paper provides typology for space filling into what we call "soft" and "hard" methods along with introducing the central notion of privacy sets for dealing with the latter. A heuristic algorithm based on this notion is presented and we compare its performance on some well-known examples.









This page was built for publication: Privacy sets for constrained space-filling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q254194)