Abstract
The application of the concept of linear complex discussed in Sec. 3.4 show that it is important to study the problem of approximation of and with linear complexes. We consider the following question: which linear complex fits a given set of data lines best? What is an appropriate definition of ‘best’ for various application? For this we have to define distance functions for lines and linear complexes, which make the problem computationally tractable. It turns out that most approximation problems can be accessed by least-sqare methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pottmann, H., Wallner, J. (2010). Approximation in Line Space. In: Computational Line Geometry. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04018-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-04018-4_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04017-7
Online ISBN: 978-3-642-04018-4
eBook Packages: Springer Book Archive