Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
From MaRDI portal
Publication:5943320
DOI10.1016/S0925-7721(01)00009-8zbMath0990.68190MaRDI QIDQ5943320
Nathan S. Netanyahu, David M. Mount
Publication date: 9 September 2001
Published in: Computational Geometry (Search for Journal in Brave)
Related Items (6)
Selecting distances in arrangements of hyperplanes spanned by points. ⋮ Unnamed Item ⋮ Unbiasedness of the Theil–Sen estimator ⋮ Consistency and asymptotic distribution of the Theil-Sen estimator ⋮ Proximity problems on line segments spanned by points ⋮ Detection of Lines by Combinatorial Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal slope selection via expanders
- \(\epsilon\)-nets and simplex range queries
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time
- Randomized optimal algorithm for slope selection
- Efficient partition trees
- On range searching with semialgebraic sets
- Efficient randomized algorithms for the repeated median line estimator
- Optimal slope selection via cuttings
- Quasi-optimal range searching in spaces of finite VC-dimension
- Use of the Hough transformation to detect lines and curves in pictures
- Least Median of Squares Regression
- Computing Least Median of Squares Regression Lines and Guided Topological Sweep
- Time- and Space-Efficient Algorithms for Least Median of Squares Regression
- An Optimal-Time Algorithm for Slope Selection
- Polygon Retrieval
- Robust regression using repeated medians
- Expected time bounds for selection
- A least square error estimation of the center and radii of concentric arcs
- Optimal circular fit to objects in two and three dimensions
- Estimates of the Regression Coefficient Based on Kendall's Tau
- Proof of a program
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Robust Statistics
- A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
This page was built for publication: Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
