Computational-geometric methods for polygonal approximations of a curve
Computer Vision, Graphics, and Image Processing
Approximating monotone polygonal curves using the uniform metric
Proceedings of the twelfth annual symposium on Computational geometry
Efficiently approximating polygonal paths in three and higher dimensions
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
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Approximation of Convex Polygons
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Shape Matching: Similarity Measures and Algorithms
SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
Distance-preserving approximations of polygonal paths
Computational Geometry: Theory and Applications
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
Area-preserving subdivision schematization
GIScience'10 Proceedings of the 6th international conference on Geographic information science
A new method for subdivision simplification with applications to urban-area generalization
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Geometric heuristics for rural radio maps approximation
Journal of Heuristics
Computing polygonal path simplification under area measures
Graphical Models
Fast and simple approach for polygon schematization
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
Adaptive volumetric shadow maps
EGSR'10 Proceedings of the 21st Eurographics conference on Rendering
Measuring similarity between curves on 2-manifolds via homotopy area
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
Let P be an x-monotone polygonal path in the plane. For a path Q that approximates P let W"A(Q) be the area above P and below Q, and let W"B(Q) be the area above Q and below P. Given P and an integer k, we show how to compute a path Q with at most k edges that minimizes W"A(Q)+W"B(Q). Given P and a cost C, we show how to find a path Q with the smallest possible number of edges such that W"A(Q)+W"B(Q)=