Two experiments investigated components of participants’ spatial knowledge when they navigated large-scale ‘‘virtual buildings’’ using ‘‘desk-top’’ (i.e., nonimm...
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
Distributed Denial-of-Service (DDoS) attacks have emerged as a popular means of causing mass targeted service disruptions, often for extended periods of time. The relative ease an...
Abstract. Three dimensional medial paths or curve skeletons (CS) are an essential component of any virtual endoscopy (VE) system, because they serve as flight paths for a virtual ...
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...