Exploring Curved Schematization of Territorial Outlines

Goethem, Arthur van; Meulemans, Wouter; Speckmann, Bettina; Wood, Jo

doi:10.1109/tvcg.2015.2401025

Cited by 11 publications

(5 citation statements)

References 27 publications

(34 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Schematic cartography, different from conventional cartography, applies generalizations to improve a map's functionality that goes beyond the adaptation of the map's features into a specific map scale [50] i.e., independent of the scale the map is presented at, a generalization is applied because it improves the map's function as a task solving tool. The cognitive adequacy and the usability related to the map's functionality justifies the schematic layout criteria that are later transformed into drawing rules.…”

Section: Route Schematization Layout Criteria For Wayfinding and Spat...mentioning

confidence: 99%

Route schematization with landmarks

Galvão¹,

Krukar²,

Nöllenburg³

et al. 2020

JOSIS

View full text Add to dashboard Cite

Modern navigation applications make use of a turn-by-turn instructions approach and are mostly supported by digital devices with limited display size. This combination does little to improve users' orientation or spatial knowledge acquisition. Considering this limitation, we propose a route schematization method to facilitate the readability of route information and survey knowledge acquisition. Current schematization methods focus on the route path and ignore context information, specially polygonal landmarks such as lakes, parks, and regions, which is crucial for promoting orientation. Our schematization method, in addition to the route path, takes as input: adjacent streets, point-like landmarks, and polygonal landmarks. Moreover, the schematic layout highlights spatial relations between route and context information, improves the readability of turns at decision points, and the visibility of the surroundings. The focus of the paper is the schematization method that combines geometric transformations and integer linear programming to produce the maps. Two routes are used as examples to present the execution information and the outputs. We complement our results with a user study that indicates a preference for our schematic layout in matching textual route instructions. The contribution of this paper is a method that produces schematic route maps with context information to support the user in wayfinding and orientation.

show abstract

Section: Route Schematization Layout Criteria For Wayfinding and Spat...mentioning

confidence: 99%

Route schematization with landmarks

Galvão¹,

Krukar²,

Nöllenburg³

et al. 2020

JOSIS

View full text Add to dashboard Cite

show abstract

“…For example, the shapes of geometric entities, such as buildings, are also abstracted by level‐of‐detail simplification based on image‐processing techniques, including the scale‐space theory [May05] and a set of optimization techniques [Ses05]. The schematization of line segments has been popular in that many technical challenges have been tackled for rectangular cartograms [SvKF06, BMS11b,BMS11a] and curved schematization [vGMR*13] along with area preservation [vGMSW14, vGMSW15]. Line schematization has also been addressed by ontology‐based semantic analysis [KDE05] and categorization of geometric features [PY11].…”

Section: Related Workmentioning

confidence: 99%

Interactive Optimization for Cartographic Aggregation of Building Features

Takahashi,

Kokubun,

Nishimura

et al. 2024

Computer Graphics Forum

View full text Add to dashboard Cite

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 reduction of the 2D map. Automating this design process effectively helps professional cartographers design both paper and digital maps, but finding the best aggregation result from the numerous combinations of building features has been a challenge. This paper presents a novel approach to assist cartographers in interactively designing the aggregation of building features in scale‐aware map visualization. Our contribution is to provide an appropriate set of candidates for the cartographer to choose from among a limited number of possible combinations of building features. This is achieved by collecting locally optimal solutions that emerge in the course of aggregation operations, formulated as a label cost optimization problem. Users can also explore better aggregation results by interactively adjusting the design parameters to update the set of possible combinations, along with an operator to force the combination of manually selected building features. Each cluster of aggregated building features is tightly enclosed by a concave hull, which is later adaptively simplified to abstract its boundary shapes. Experimental design examples and evaluations by expert cartographers demonstrate the feasibility of the proposed approach to interactive aggregation.

show abstract

“…Multiple other approaches for polygonal hulls of polygons exist-some of them can be solved in polynomial time [29], while others are shown to be NP-hard [30]. A closely related field is the topologically correct simplification and schematization of polygonal subdivisions [11,24,38,40,53]. For the case that multiple geometric objects are the input of the problem, there exist several techniques for combining the aggregation and representation by a more simple geometry.…”

Section: Related Workmentioning

confidence: 99%

Shortcut Hulls: Vertex-restricted Outer Simplifications of Polygons

Bonerath¹,

Haunert²,

Mitchell³

et al. 2021

Preprint

View full text Add to dashboard Cite

Let P be a crossing-free polygon and C a set of shortcuts, where each shortcut is a directed straight-line segment connecting two vertices of P . A shortcut hull of P is another crossing-free polygon that encloses P and whose oriented boundary is composed of elements from C. Shortcut hulls find their application in geo-related problems such as the simplification of contour lines. We aim at a shortcut hull that linearly balances the enclosed area and perimeter. If no holes in the shortcut hull are allowed, the problem admits a straight-forward solution via shortest paths. For the more challenging case that the shortcut hull may contain holes, we present a polynomial-time algorithm that is based on computing a constrained, weighted triangulation of the input polygon's exterior. We use this problem as a starting point for investigating further variants, e.g., restricting the number of edges or bends. We demonstrate that shortcut hulls can be used for drawing the rough extent of point sets as well as for the schematization of polygons.

show abstract

Exploring Curved Schematization of Territorial Outlines

Cited by 11 publications

References 27 publications

Route schematization with landmarks

Route schematization with landmarks

Interactive Optimization for Cartographic Aggregation of Building Features

Shortcut Hulls: Vertex-restricted Outer Simplifications of Polygons

Contact Info

Product

Resources

About