When the available information is imperfect, it is often desirable to represent it in the database, so that it can be used to answer queries of interest as much as possible. The da...
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yih...
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
Abstract. Aggregate window queries return summarized information about objects that fall inside a query rectangle (e.g., the number of objects instead of their concrete ids). Tradi...