Improved Grid Map Layout by Point Set Matching

DOI10.1142/S0218195915500077MaRDI QIDQ3449120zbMATH OpenOpenAlexDBLPWikidataFDO

Authors David Eppstein, Bettina Speckmann, Frank Staals, Marc Van Kreveld

Publication date 3 November 2015

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195915500077

zbMATH Keywords

grid mappoint-set matchingvisualization

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Improved implementation of point location in general two-dimensional subdivisions
• Solution adaptive grid strategies based on point redistribution
• Algorithms and Data Structures
• Improved approximation bounds for planar point pattern matching
• Optimal grid representations
• Approximation of a set of points by points of a grid
• An improved strategy for exploring a grid polygon
• Translating a regular grid over a point set

Cites work

• Algorithmic aspects of proportional symbol maps
• Geometry helps in bottleneck matching and related problems
• Geometry Helps in Matching

Cited in

(7)

• On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps
• Table cartogram
• Computing stable Demers cartograms
• New variants of perfect non-crossing matchings
• StreamTable: an area proportional visualization for tables with flowing streams
• Fine-grained complexity of Earth mover's distance under translation
• New variants of perfect non-crossing matchings

This page was built for publication: Improved Grid Map Layout by Point Set Matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449120)