| Title: | Reconstructing 3D curves with euclidean minimal spanning trees |
|---|
| Authors: | ID Kolmanič, Simon (Author)
ID Guid, Nikola (Author) |
|---|
| Files: |  http://www.dlib.si/details/URN:NBN:SI:DOC-O6HI03MS
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FERI - Faculty of Electrical Engineering and Computer Science
|
|---|
| Abstract: | In this paper, we present a new efficient algorithm for reconstruction of nonintersecting 3D curves from a sufficiently den se sample. We use the Euclidean minimal spanning trees to identify line segments reconstructing curve shapes. To deal with more than one curve in a sample and to eliminate noisy data, we introduce chains of connected line segments. With the incremental growth based on heuristics, the chains contain finally curve shapes. The method is robust and fast for both 2D and 3D curves. |
|---|
| Keywords: | oblaki točk, rekonstrukcija krivulj, evklidska minimalna vpeta drevesa, point cloud, curve reconstruction, euclidean minimal spanning trees |
|---|
| Publisher: | Elektrotehniška zveza Slovenije |
|---|
| Year of publishing: | 2006 |
|---|
| Number of pages: | str. 84-92 |
|---|
| Numbering: | Vol. 73, no. 2-3 |
|---|
| PID: | 20.500.12556/DKUM-52857  |
|---|
| UDC: | 681.5 |
|---|
| ISSN on article: | 0013-5852 |
|---|
| COBISS.SI-ID: | 10673174 |
|---|
| NUK URN: | URN:SI:UM:DK:A2VLSJ13 |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 2480 |
|---|
| Downloads: | 51 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
