| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Reconstructing 3D curves with euclidean minimal spanning trees
Authors:ID Kolmanič, Simon (Author)
ID Guid, Nikola (Author)
Files:URL 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 New window
UDC:681.5
ISSN on article:0013-5852
COBISS.SI-ID:10673174 New window
NUK URN:URN:SI:UM:DK:A2VLSJ13
Publication date in DKUM:10.07.2015
Views:2232
Downloads:43
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
KOLMANIČ, Simon and GUID, Nikola, 2006, Reconstructing 3D curves with euclidean minimal spanning trees. Elektrotehniški vestnik [online]. 2006. Vol. 73, no. 2–3, p. 84–92. [Accessed 20 January 2025]. Retrieved from: http://www.dlib.si/details/URN:NBN:SI:DOC-O6HI03MS
Copy citation
  
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Searching for similar works...Please wait....
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Elektrotehniški vestnik
Publisher:Strokovna zadruga koncesijoniranih elektrotehnikov
ISSN:0013-5852
COBISS.SI-ID:742916 New window

Secondary language

Language:English
Title:Rekonstrukcija prostorskih krivulj s pomočjo evklidskih minimalnih vpetih dreves
Abstract:V članku predstavljamo nov učinkovit algoritem za rekonstrukcijo prostorskih krivulj iz dovolj gostega vzorca. S pomočjo evklidskih minimalnih vpetih dreves poiščemo tiste daljice, ki rekonstruirajo krivuljo. Za delo z več krivuljami v vzorcu in odstranitev točk šuma uporabljamo strukturo, ki jo imenujmo verige povezanih daljic. Z inkrementalno rastjo, ki temelji na hevristiki, dobimo v verigah iskano rekonstrukcijo krivulj. Predstavljena metoda je robustna in hitra tako pri rekonstrukciji ravninskih kot tudi prostorskih krivulj.


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica