Approximation of planar point sets by point configurations
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Omsk State Technical University, Federal State Autonoumos Educational Institution of Higher Education
2023-06-01
|
| Series: | Омский научный вестник |
| Subjects: | |
| Online Access: | https://www.omgtu.ru/general_information/media_omgtu/journal_of_omsk_research_journal/files/arhiv/2023/%E2%84%962%20(186)%20(%D0%9E%D0%9D%D0%92)/55-59%20%D0%AE%D1%80%D0%BA%D0%BE%D0%B2%20%D0%92.%20%D0%AE..pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1813-8225 2541-7541 |