Journal ArticleDOI
An on-line algorithm for fitting straight lines between data ranges
Reads0
Chats0
TLDR
An algorithm is presented that finds all the straight lines that pierce each data range, and it is shown that the half-plane intersection algorithm of Shamos and Hoey can be improved in this special case to O(n).Abstract:
Applications often require fitting straight lines to data that is input incrementally. The case where a data range [ak, ok] is received at each tk, t1read more
Citations
More filters
Book
Algorithms in Combinatorial Geometry
TL;DR: This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems with an important role in this study.
Book ChapterDOI
Reconstructions of Noisy Digital Contours with Maximal Primitives Based on Multi-Scale/Irregular Geometric Representation and Generalized Linear Programming
TL;DR: A novel approach combining multi-scale and irregular isothetic representations of the input contour, as an extension of a previous work, improves the representation of the contour by 1-D intervals, and achieves afterwards the decomposition of thecontour into maximal arcs or segments.
Solving geometric problems with the rotating calipers
TL;DR: This paper shows that the diameter of a convex n-sided polygon could be computed in O(n) time using a very elegant and simple procedure which resembles rotating a set of calipers around the polygon once, and that this simple idea can be generalized in two ways.
Journal ArticleDOI
Approximating polygons and subdivisions with minimum-link paths
TL;DR: This work investigates fattening by convolving the segments or vertices with disks and attempts to approximate objects with the minimum number of line segments, or with near the minimum, by using efficient greedy algorithms.
Book ChapterDOI
Geometric Transversal Theory
TL;DR: Theorem 1.1 (Helly's Theorem) of transversal theory has its origins in Helly's theorem as mentioned in this paper, which states that if every d + 1 members of a convex set have a common point, then there is a point common to all the members of the set.
References
More filters
Journal ArticleDOI
An optimal algorithm for mutual exclusion in computer networks
Glenn Ricart,Ashok K. Agrawala +1 more
TL;DR: An algorithm is proposed that creates mutual exclusion in a computer network whose nodes communicate only by messages and do not share memory, and it is shown that the number can be contained in a fixed amount of memory by storing it as the residue of a modulus.
Proceedings ArticleDOI
Geometric intersection problems
Michael Ian Shamos,Dan Hoey +1 more
TL;DR: An O(N log N) algorithm is given to determine whether any two intersect and use it to detect whether two simple plane polygons intersect and to show that the Simplex method is not optimal.
Image Analysis of Human Motion Using Constraint Propagation
Joseph O'Rourke,Norman I. Badler +1 more
TL;DR: In this paper, a system capable of analyzing image sequences of human motion is described, which is structured as a feedback loop between high and low levels: predictions are made at the semantic level, and verifications are sought at the image level.
Journal ArticleDOI
Model-based image analysis of human motion using constraint propagation
Joseph O'Rourke,Norman I. Badler +1 more
TL;DR: A system capable of analyzing image sequences of human motion is described, structured as a feedback loop between high and low levels: predictions are made at the semantic level and verifications are sought at the image level.