Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Missing the city for buildings? A critical review of pan-scalar map generalization and design in contemporary zoomable maps
Most of the maps used today are what we call pan-scalar maps, ie interactive zoomable
applications comprised of numerous maps of a particular area at different zoom levels (ie …
applications comprised of numerous maps of a particular area at different zoom levels (ie …
Area-preserving simplification and schematization of polygonal subdivisions
In this article, we study automated simplification and schematization of territorial outlines. We
present a quadratic-time simplification algorithm based on an operation called edge-move …
present a quadratic-time simplification algorithm based on an operation called edge-move …
Interactive optimization for cartographic aggregation of building features
S Takahashi, R Kokubun, S Nishimura… - Computer Graphics …, 2024 - Wiley Online Library
Aggregation, as an operation of cartographic generalization, provides an effective means of
abstracting the configuration of building features by combining them according to the scale …
abstracting the configuration of building features by combining them according to the scale …
Interactive focus maps using least-squares optimization
We present a new algorithm that enlarges a focus region in a given network map without
removing non-focus (ie, context) network parts from the map or changing the map's size. In …
removing non-focus (ie, context) network parts from the map or changing the map's size. In …
Map schematization with circular arcs
We present an algorithm to compute schematic maps with circular arcs. Our algorithm
iteratively replaces two consecutive arcs with a single arc to reduce the complexity of the …
iteratively replaces two consecutive arcs with a single arc to reduce the complexity of the …
Computing schematic layouts for spatial hypergraphs on concentric circles and grids
MA Bekos, DJC Dekker, F Frank… - Computer Graphics …, 2022 - Wiley Online Library
Set systems can be visualized in various ways. An important distinction between techniques
is whether the elements have a spatial location that is to be used for the visualization; for …
is whether the elements have a spatial location that is to be used for the visualization; for …
Partitioning polygons via graph augmentation
We study graph augmentation under the dilation criterion. In our case, we consider a plane
geometric graph G=(V, E) and a set C of edges. We aim to add to G a minimal number of …
geometric graph G=(V, E) and a set C of edges. We aim to add to G a minimal number of …
Optimizing the balance between area and orientation distortions for variable-scale maps
Applying a variable scale transformation to maps leads to area distortions of the maps, ie
enlarging interesting areas on maps to larger scales and shrinking other areas. Such area …
enlarging interesting areas on maps to larger scales and shrinking other areas. Such area …
Location‐dependent generalization of road networks based on equivalent destinations
Suppose a user located at a certain vertex in a road network wants to plan a route using a
wayfinding map. The user's exact destination may be irrelevant for planning most of the …
wayfinding map. The user's exact destination may be irrelevant for planning most of the …
Variable-scale maps in real-time generalisation using a quadtree data structure and space deforming algorithms
Variable-scale maps have been advocated by several authors in the context of mobile
cartography. In the literature on real-time map generalisation, however, corresponding …
cartography. In the literature on real-time map generalisation, however, corresponding …