Citation: G. Liotta et al., ROBUST PROXIMITY QUERIES - AN ILLUSTRATION OF DEGREE-DRIVEN ALGORITHMDESIGN, SIAM journal on computing (Print), 28(3), 1999, pp. 864-889
Citation: O. Devillers et Fp. Preparata, A PROBABILISTIC ANALYSIS OF THE POWER OF ARITHMETIC FILTERS, Discrete & computational geometry, 20(4), 1998, pp. 523-547
Citation: G. Bilardi et Fp. Preparata, PROCESSOR-TIME TRADEOFFS UNDER BOUNDED-SPEED MESSAGE PROPAGATION .1. UPPER-BOUNDS, theory of computing systems, 30(6), 1997, pp. 523-546
Citation: A. Pietracaprina et Fp. Preparata, PRACTICAL CONSTRUCTIVE SCHEMES FOR DETERMINISTIC SHARED-MEMORY ACCESS, theory of computing systems, 30(1), 1997, pp. 3-37
Citation: Yj. Chiang et al., A UNIFIED APPROACH TO DYNAMIC POINT LOCATION, RAY SHOOTING, AND SHORTEST PATHS IN PLANAR MAPS, SIAM journal on computing, 25(1), 1996, pp. 207-233