A linear time algorithm with minimum link paths inside a simple polygon
Computer Vision, Graphics, and Image Processing
On-line construction of the convex hull of a simple polyline
Information Processing Letters
Clique partitions, graph compression and speeding-up algorithms
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Fitting polygonal functions to a set of points in the plane
CVGIP: Graphical Models and Image Processing
Randomized optimal algorithm for slope selection
Information Processing Letters
Applications of a new space-partitioning technique
Discrete & Computational Geometry
An expander-based approach to geometric optimization
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Can visibility graphs be represented compactly?
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Efficient piecewise-linear function approximation using the uniform metric: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On approximating polygonal curves in two and three dimensions
CVGIP: Graphical Models and Image Processing
Computing minimum length paths of a given homotopy class
Computational Geometry: Theory and Applications
Polygonal approximations that minimize the number of inflections
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Finding minimal convex nested polygons
SCG '85 Proceedings of the first annual symposium on Computational geometry
Approximation of Polygonal Curves with Minimum Number of Line Segments
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
Number Theory Helps Line Detection in Digital Images
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Efficiently approximating polygonal paths in three and higher dimensions
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Area-preserving approximations of polygonal paths
Journal of Discrete Algorithms
Approximating a set of points by a step function
Journal of Visual Communication and Image Representation
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
Computational Geometry: Theory and Applications
Approximating Points by a Piecewise Linear Function: I
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Simplifying 3D polygonal chains under the discrete Fréchet distance
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Efficient real-time trajectory tracking
The VLDB Journal — The International Journal on Very Large Data Bases
Representing a functional curve by curves with fewer peaks
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Rectilinear approximation of a set of points in the plane
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |