Given any > 0 and any planar region bounded by a simple n-gon P we construct a (1 + )-quasiconformal map between and the unit disk in time C()n. One can take C() = C + C log ...
We propose a method for estimating the credibility of the posted information from users. The system displays these information on the map. Since posted information can include sub...
Koji Yamamoto, Daisuke Katagami, Katsumi Nitta, Ak...
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
Mark de Berg, Herman J. Haverkort, Constantinos P....
Abstract. Current commercial mobile navigation systems often use a predetermined scale selection schema without considering differences in spatial complexity of locations. To ident...
We examine schema mappings from a type-theoretic perspective and aim to facilitate and formalize the reuse of mappings. Starting with the mapping language of Clio, we present a ty...