An Optimal Algorithm for Finding the Kernel of a Polygon
Journal of the ACM (JACM)
An optimal real-time algorithm for planar convex hulls
Communications of the ACM
Computational geometry.
Determining sector visibility of a polygon
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Stabbing pairwise disjoint translates in linear time
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Computing shortest transversals of sets (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
An approach for the estimation of the precision of a real object from its digitization
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Multi-dimensional online tracking
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating Points by a Piecewise Linear Function: I
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Stabbers of line segments in the plane
Computational Geometry: Theory and Applications
Improved points approximation algorithms based on simplicial thickness data structures
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Unsupervised polygonal reconstruction of noisy contours by a discrete irregular approach
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Multidimensional online tracking
ACM Transactions on Algorithms (TALG)
Outlier respecting points approximation
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
An adaptive algorithm for online time series segmentation with error bound guarantee
Proceedings of the 15th International Conference on Extending Database Technology
A combined multi-scale/irregular algorithm for the vectorization of noisy digital contours
Computer Vision and Image Understanding
| Hi-index | 48.22 |
Applications often require fitting straight lines to data that is input incrementally. The case where a data range [&agr;k, &ohgr;k] is received at each tk, t1 t2 tn, is considered. An algorithm is presented that finds all the straight lines u = mt + b that pierce each data range, i.e., all pairs (m, b) such that &agr;k ≤ mtk + b ≤ &ohgr;k for k = 1, … , n. It may be that no single line fits all the ranges, and different alternatives for handling this possibility are considered. The algorithm is on-line, producing the correct partial result after processing the first k ranges for all k n. For each k, the set of (m, b) pairs constitutes a convex polygon in the m-b parameter space, which can be constructed as the intersection of 2k half-planes. It is shown that the O(n logn) half-plane intersection algorithm of Shamos and Hoey can be improved in this special case to O(n).