Distance-preserving approximations of polygonal paths

Authors:
Joachim Gudmundsson;Giri Narasimhan;Michiel Smid
Affiliations:
National ICT Australia22NICTA is funded through the Australian Government's Backing Australia's Ability initiative, in part through the Australian Research Council. Ltd, Australia;School of Computer Science, Florida International University, Miami, FL 33199, USA;School of Computer Science, Carleton University, Ottawa, Ontario K1S 5B6, Canada
Venue:
Computational Geometry: Theory and Applications
Year:
2007

Citing 8
Cited 4

Computational-geometric methods for polygonal approximations of a curve

Computer Vision, Graphics, and Image Processing
Introduction to algorithms

Introduction to algorithms
On approximating polygonal curves in two and three dimensions

CVGIP: Graphical Models and Image Processing
A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields

Journal of the ACM (JACM)
Cartographic line simplification and polygon CSG formulæ in O(n log* n) time

WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Area-preserving approximations of polygonal paths

Journal of Discrete Algorithms
Polygonal path simplification with angle constraints

Computational Geometry: Theory and Applications
Constructing interference-minimal networks

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science

Path simplification for metro map layout

GD'06 Proceedings of the 14th international conference on Graph drawing
Optimal and topologically safe simplification of building footprints

Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Constructing interference-minimal networks

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Fast and simple approach for polygon schematization

ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a polygonal path P with vertices p"1,p"2,...,p"n@?R^d and a real number t=1, a path Q=(p"i"""1,p"i"""2,...,p"i"""k) is a t-distance-preserving approximation of P if 1=i"1