This paper presents a randomized incremental algorithm for computing a single face in an arrangement of n line segments in the plane that is fairly simple to implement. The expected running time of the algorithm is O (not (n) log n). The analysis of the algorithm uses a novel approach that generalizes and extends the Clarkson-Shor analysis technique [in Discrete Comput. Geom., 4 (1989), pp. 387...

We consider the problem of defining an appropriate notion of non-interference (NI) for deterministic interactive programs. Previous work on the security of interactive programs by O’Neill, Clarkson and Chong (CSFW 2006) builds on earlier ideas due to Wittbold and Johnson (Symposium on Security and Privacy 1990), and argues for a notion of NI defined in terms of strategies modelling the behaviou...

Eaton GM, Lauer MA, Sheldon WS, Grines CL, Halpern S, Crowe T, Blankenship JC, Kerensky R. Effect of recombinant ApoA-I Milano on coronary atherosclerosis in patients with acute coronary syndromes: a randomized controlled trial. JAMA 2003;290:2292–2300. 14. Di Mario C, Gorge G, Peters R, Kearney P, Pinto F, Hausmann D, von Birgelen C, Colombo A, Mudra H, Roelandt J, Erbel R. Clinical applicatio...

This paper presents a framework for calculating measures of data integrity for programs in a small imperative language. We develop a Markov chain semantics for our language which calculates Clarkson and Schneider’s definitions of data contamination, data suppression, program suppression and program transmission. We then propose our own definition of program integrity for probabilistic specifica...

Given n lines in the plane, a (1/r)-cutting is a subdivision of the plane into cells such that each cell intersects at most n/r lines. Cuttings are fundamental to the design of geometric divide-and-conquer algorithms and have numerous applications. Early suboptimal constructions of cuttings were given implicitly in the works by Megiddo and by Dyer in the 80s; simple randomized constructions wer...

Abstract Voronoi diagrams were introduced by R . Klein [Kle89b, Kle88a, Kle88b] as an axiomatic basis ofVoronoi diagrams. We show how to construct abstract Voronoi diagrams in time O(nlogn) by a randomized algorithm, which is based on Clarkson and Shor's randomized incremental construction technique [CS89]. The new algorithm has the following advantages over previous algorithms: • It can handle...