Polygonal path simplification with angle constraints

Authors:
Danny Z. Chen;Ovidiu Daescu;John Hershberger;Peter M. Kogge;Ningfang Mi;Jack Snoeyink
Affiliations:
Department of Comp. Sci. and Eng., University of Notre Dame, Notre Dame, IN 46556, USA;Department of Comp. Sci., Univ. of Texas at Dallas, Richardson, TX 75083, USA;Mentor Graphics, 8005 S.W. Boeckman Road, Wilsonville, OR 97070, USA;Department of Comp. Sci. and Eng., University of Notre Dame, Notre Dame, IN 46556, USA;Department of Comp. Sci., Univ. of Texas at Dallas, Richardson, TX 75083, USA;Department of Comp. Sci., Univ. of North Carolina at Chapel Hill, Chapel Hill, NC 27599, USA
Venue:
Computational Geometry: Theory and Applications
Year:
2005

Citing 9
Cited 5

Computational-geometric methods for polygonal approximations of a curve

Computer Vision, Graphics, and Image Processing
Approximation of convex polygons

Proceedings of the seventeenth international colloquium on Automata, languages and programming
Fitting polygonal functions to a set of points in the plane

CVGIP: Graphical Models and Image Processing
On approximating polygonal curves in two and three dimensions

CVGIP: Graphical Models and Image Processing
Curvature-constrained shortest paths in a convex polygon (extended abstract)

Proceedings of the fourteenth annual symposium on Computational geometry
Simplifying a polygonal subdivision while keeping it simple

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Near-Linear Time Approximation Algorithms for Curve Simplification

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
An O(N) algorithm for polygonal approximation

Pattern Recognition Letters

Distance-preserving approximations of polygonal paths

Computational Geometry: Theory and Applications
Polygonal chain simplification for flight simulation systems

SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
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
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

We present efficient geometric algorithms for simplifying polygonal paths in R^2 and R^3 that have angle constraints, improving by nearly a linear factor over the graph-theoretic solutions based on known techniques. The algorithms we present match the time bounds for their unconstrained counterparts. As a key step in our solutions, we formulate and solve an off-line ball exclusion search problem, which may be of interest in its own right.