| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Search the digital library catalog Help

Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 1 / 1
First pagePrevious page1Next pageLast page
1.
Reconstructing 3D curves with euclidean minimal spanning trees
Simon Kolmanič, Nikola Guid, 2006, original scientific article

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
Published: 10.07.2015; Views: 676; Downloads: 14
URL Link to full text

Search done in 0.03 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica