Share Email Print

Proceedings Paper

Efficient Segmentation Method For Range Data
Author(s): Thomas C. Henderson
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

A method for finding planar faces in sets of range data images is described. First, the object points are extracted from the range data image (or images). These are then organized in a k-d tree using the x, y and z values as keys. From the k-d tree a spatial proximity graph is efficiently constructed. Finally, a set of seed points for a possible face is chosen, and the spatial proximity graph is used to guide the search for neighboring points lying on this face.

Paper Details

Date Published: 22 November 1982
PDF: 4 pages
Proc. SPIE 0336, Robot Vision, (22 November 1982); doi: 10.1117/12.933610
Show Author Affiliations
Thomas C. Henderson, University of Utah (United States)

Published in SPIE Proceedings Vol. 0336:
Robot Vision
Azriel Rosenfeld, Editor(s)

© SPIE. Terms of Use
Back to Top