Computational geometry: an introduction
Computational geometry: an introduction
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Linear programming in O(n × 3d2) time
Information Processing Letters
A linear time algorithm with minimum link paths inside a simple polygon
Computer Vision, Graphics, and Image Processing
Computational-geometric methods for polygonal approximations of a curve
Computer Vision, Graphics, and Image Processing
Methods in approximation: techniques for mathematical modelling
Methods in approximation: techniques for mathematical modelling
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
SIAM Journal on Computing
Art gallery theorems and algorithms
Art gallery theorems and algorithms
Optimal shortest path queries in a simple polygon
SCG '87 Proceedings of the third annual symposium on Computational geometry
Computing the link center of a simple polygon
Discrete & Computational Geometry - ACM Symposium on Computational Geometry, Waterloo
SIAM Journal on Computing
An algorithmic approach to some problems in terrain navigation
Artificial Intelligence - Special issue on geometric reasoning
Optimal shortest path queries in a simple polygon
Journal of Computer and System Sciences
Computing geodesic furthest neighbors in simple polygons
Journal of Computer and System Sciences
An optimal-time algorithm for slope selection
SIAM Journal on Computing
An efficient algorithm for link-distance problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Introduction to algorithms
Minimum-link paths among obstacles in the plane
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Selecting distances in the plane
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Computing the visibility polygon from a convex set and related problems
Journal of Algorithms
Fitting polygonal functions to a set of points in the plane
CVGIP: Graphical Models and Image Processing
Computing external farthest neighbors for a simple polygon
Discrete Applied Mathematics
Ray shooting in polygons using Geodesic triangulations
Proceedings of the 18th international colloquium on Automata, languages and programming
A new data structure for shortest path queries in a simple polygon
Information Processing Letters
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Applications of parametric searching in geometric optimization
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Optimal link path queries in a simple polygon
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Separation and approximation of polyhedral objects
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A subexponential bound for linear programming
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Diameter, width, closest line pair, and parametric searching
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Curve and surface fitting with splines
Curve and surface fitting with splines
Dynamic ray shooting and shortest paths via balanced geodesic triangulations
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Finding minimal convex nested polygons
SCG '85 Proceedings of the first annual symposium on Computational geometry
Elementary Numerical Analysis: An Algorithmic Approach
Elementary Numerical Analysis: An Algorithmic Approach
Parallel Algorithms for All Minimum Link Paths and Link Center Problems
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Plane Sweep Algorithms for the Polygonal Approximation Problems with Applications
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Linear Approximation of Simple Objects
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Approximating Polygons and Subdivisions with Minimum Link Paths
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
Minimum link paths in polygons and related problems
Minimum link paths in polygons and related problems
Approximating monotone polygonal curves using the uniform metric
Proceedings of the twelfth annual symposium on Computational geometry
Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Automatic generation of triangular irregular networks using greedy cuts
VIS '95 Proceedings of the 6th conference on Visualization '95
Handling inverted temperature dependence in static timing analysis
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Approximating a set of points by a step function
Journal of Visual Communication and Image Representation
Fast and quality-guaranteed data streaming in resource-constrained sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
AMDO '08 Proceedings of the 5th international conference on Articulated Motion and Deformable Objects
Approximating Points by a Piecewise Linear Function: I
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A randomized algorithm for weighted approximation of points by a step function
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Adaptive sampling of motion trajectories for discrete task-based analysis and synthesis of gesture
GW'05 Proceedings of the 6th international conference on Gesture in Human-Computer Interaction and Simulation
Frame deformation energy matching of on-line handwritten characters
CIARP'05 Proceedings of the 10th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis and Applications
Representing a functional curve by curves with fewer peaks
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Adaptive numerical cumulative distribution functions for efficient importance sampling
EGSR'05 Proceedings of the Sixteenth Eurographics conference on Rendering Techniques
| Hi-index | 0.00 |
We give an O(nlogn)-time method for finding a best k-link piecewise-linear function approximating an n-point planar data set using the well-known uniform metric to measure the error, &egr;≥0, of the approximation. Our method is based upon new characterizations of such functions, which we exploit to design an efficient algorithm using a plane sweep in “&egr; space” followed by several applications of the parametric searching technique. The previous best running time for this problem was O(n2).