Abstract
The paper is devoted to planar linear point sets having hierarchical structure. Point configurations arise naturally in several areas of computational geometry. In the paper, the linear approximation of planar point configurations is discussed. Planar point configuration is considered as a fuzzed and deformed image of some ideal configuration. Also, it may be considered as random realizations of ideal one. Pure images and deformed ones are described by the same hierarchical structures. The structure of approximating configuration is determined a priory. Image approximation is realized by mean of least square restoration. The correspondence of the structures is one of the parameters of approximation. Identification procedure is realized by linear transformations. Similarity transformations as general ones are used in the calculations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
