Narodna in univerzitetna knjižnica, Ljubljana (NUK)
Naročanje gradiva za izposojo na dom
Naročanje gradiva za izposojo v čitalnice
Naročanje kopij člankov
Urnik dostave gradiva z oznako DS v signaturi
  • Reconstructing 3D curves with euclidean minimal spanning trees = Rekonstrukcija prostorskih krivulj s pomočjo evklidskih minimalnih vpetih dreves
    Kolmanič, Simon ; Guid, Nikola
    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.
    Vir: Elektrotehniški vestnik. - ISSN 0013-5852 (Letn. 73, št. 2/3, 2006, str. 84-92)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2006
    Jezik - angleški
    COBISS.SI-ID - 10673174

vir: Elektrotehniški vestnik. - ISSN 0013-5852 (Letn. 73, št. 2/3, 2006, str. 84-92)

loading ...
loading ...
loading ...