Scribd Logo
Upload

Welcome to Scribd!

  • Point Cloud Segmentation Algorithm Under 40 Characters

    Uploaded by

    Sanintya Septiana
    27 views3 pages
    The algorithm takes in a point cloud, point normals, curvatures, and neighbor finding function. It initializes a region list and available points list. It then iterates through the available points list. For each point, it finds neighbors and adds them to the current region if the curvature and normal angle thresholds are met. It then adds the segmented region to the global list.

    Original Description:

    REGION GROWING

    Original Title

    Algorithm Region Growing

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The algorithm takes in a point cloud, point normals, curvatures, and neighbor finding function. It initializes a region list and available points list. It then iterates through the available points list. For each point, it finds neighbors and adds them to the current region if the curvature and normal angle thresholds are met. It then adds the segmented region to the global list.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    27 views3 pages

    Point Cloud Segmentation Algorithm Under 40 Characters

    Uploaded by

    Sanintya Septiana
    The algorithm takes in a point cloud, point normals, curvatures, and neighbor finding function. It initializes a region list and available points list. It then iterates through the available points list. For each point, it finds neighbors and adds them to the current region if the curvature and normal angle thresholds are met. It then adds the segmented region to the global list.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    Algorithm:

    While is not empty do

    Current region

    Current seeds

    Point with minimum curvature in

    for to size ( ) do
    Find nearest neighbours of current

    seed point

    for to size ( ) do

    Current neighbour point

    If contains and

    then

    If then


    end if
    end if
    end for
    o end for

    o Add current region to global segment list


    inputs:

    Point cloud =
    Point normals =
    Points curvatures =
    Neighbour finding function
    Curvature threshold
    Angle threshold

    Initialize:

    Region list
    Available points list

    Algorithm:

    While is not empty do

    Current region

    Current seeds

    Point with minimum curvature in

    for to size ( ) do
    Find nearest neighbours of current

    seed point

    for to size ( ) do

    Current neighbour point

    If contains and

    then

    If then


    end if
    end if
    end for
    o end for

    o Add current region to global segment list

    You might also like