We address the question: How many edge guards are needed to guard an orthogonal polyhedron of e edges, r of which are reflex? It was previously established [3] that e/12 are sometimes necessary and e/6 always suffice. In contrast to the closed edge guards used for these bounds, we introduce a new model, open edge guards (excluding the endpoints of the edge), which we argue are in some sense mor...

This paper presents a new synthesis-based approach for writing low-level memory-safe code. Given a partial program with missing guards, our algorithm synthesizes concrete predicates to plug in for the missing guards such that all buffer accesses in the program are memory safe. Furthermore, guards synthesized by our technique are the simplest and weakest among guards that guarantee memory safety...

In the wireless localization problem, given a polygon P ⊂ R, we have to place guards and fix their angular range such that P can be described using these guards. The guards describe P if for every point pair p ∈ P and q / ∈ P , there is a guard that sees p but does not see q. We consider the analogous problem in 3D: given a polyhedron P ⊂ R, place guards—which now are polyhedral cones—that coll...

Art gallery problems are, broadly speaking, the study of the relation between the shapes of regions in the plane and the number of points needed to guard them. These problems have been extensively studied over the last decade and have found different type of applications in practical situation. Normally the number of sides of a polygon or the general shape of the polygon is used as a measure of...

Biometrical JournalVolume 64, Issue 8 p. 1367-1367 EDITORIAL BOARDFree Access Editorial Board: Journal 8'22 First published: 09 December 2022 https://doi.org/10.1002/bimj.202270082AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text full-text accessPlease review our Terms and Conditions of Use check box below share version article.I...