Approximate shape fitting via linearization

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 66-73

  Har Peled, Sariel ^a   Varadarajan, Kasturi R ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING; SET THEORY;

SHAPE FITTING;

COMPUTER SCIENCE;

EID: 0035175322     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2001.959881     Document Type: Article

References (33)

1. Approximation and exact algorithms for minimum-width annuli and shells
2. Computing envelopes in four dimensions with applications
3. Exact and approximation algorithms for minimum-width cylindrical shells
4. Parametric and kinetic minimum spanning trees
5. Maintaining the extent of a moving point set
6. Cylindrical static and kinetic binary space partitions
7. Maintaining the approximate extent measures of moving points
8. On range searching with semi-algebraic sets
9. Efficient randomized algorithms for some geometric optimization problems
10. Applications of parametric searching in geometric optimization
11. A linear-time algorithm for computing the Voronoi diagram of a convex polygon
12. Fast algorithms for projected clustering
13. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
14. Data structures for mobile data
15. Approximating the diameter, width, smallest enclosing cylinder and minimum-width annulus
16. Evaluating the cylindricity of a nominally cylindrical point set
17. Metric entropy of some classes of sets with differentiable boundaries
18. Roundness algorithms using the Voronoi diagrams
19. Optimal point location in a monotone subdivision
20. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets
21. Fitting a set of points by a circle
22. A subexponential algorithm for abstract optimization problems
23. Aspects of approximation of convex bodies
24. Simplified kinetic connectivity for rectangles and hypercubes
25. Out-of-roundness problem revisited
26. A complete roundness classification procedure
27. Approximating by circles
28. Review of dimensioning and tolerancing: Representation and processing
29. Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
30. Probing for near centers and relative roundness
31. On the width and roundness of a set of points in the plane
32. Issues in the metrology of geometric tolerancing