The Topology of Wireless Communication Merav Parter Department of Computer Science and Applied Mathematics Weizmann Institute Joint work with Erez Kantor,
Xiao Zhang 1, Wang-Chien Lee 1, Prasenjit Mitra 1, 2, Baihua Zheng 3 1 Department of Computer Science and Engineering 2 College of Information Science.
Special Cases of the Hidden Line Elimination Problem Computational Geometry, WS 2007/08 Lecture 16 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen,
Hidden-Line Elimination Computational Geometry, WS 2006/07 Lecture 14 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.
Reverse Furthest Neighbors in Spatial Databases
The Planar Point Location Problem
Bin Yao, Feifei Li, Piyush Kumar Presenter: Lian Liu.
Processing Transitive Nearest-Neighbor Queries in Multi-Channel Access Environments
Spatial Query Processing Spatial DBs do not have a set of operators that are considered to be basic elements in a query evaluation. Spatial DBs handle.
