Advanced k-D tree encoding for point clouds by most significant axis selection

    公开(公告)号:US10430975B2

    公开(公告)日:2019-10-01

    申请号:US15354683

    申请日:2016-11-17

    Applicant: Google Inc.

    Abstract: An encoder includes a processor, a buffer, and a memory. The memory includes code as instructions that cause the processor to perform a number of steps. The steps include partitioning a geometric construct within an axis of the geometric construct based on a point differential between two partitions, the geometric construct including geometric data, determining a number of points in the partition, storing a value indicating the number of points in the buffer, and entropy encoding the value stored in the buffer.

    ADVANCED K-D TREE ENCODING FOR POINT CLOUDS BY MOST SIGNIFICANT AXIS SELECTION

    公开(公告)号:US20180137653A1

    公开(公告)日:2018-05-17

    申请号:US15354683

    申请日:2016-11-17

    Applicant: Google Inc.

    CPC classification number: G06T9/40

    Abstract: An encoder includes a processor, a buffer, and a memory. The memory includes code as instructions that cause the processor to perform a number of steps. The steps include partitioning a geometric construct within an axis of the geometric construct based on a point differential between two partitions, the geometric construct including geometric data, determining a number of points in the partition, storing a value indicating the number of points in the buffer, and entropy encoding the value stored in the buffer.

Patent Agency Ranking