22 November 1982 Efficient Segmentation Method For Range Data
Author Affiliations +
Proceedings Volume 0336, Robot Vision; (1982) https://doi.org/10.1117/12.933610
Event: 1982 Technical Symposium East, 1982, Arlington, United States
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.
© (1982) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Thomas C. Henderson, Thomas C. Henderson, } "Efficient Segmentation Method For Range Data", Proc. SPIE 0336, Robot Vision, (22 November 1982); doi: 10.1117/12.933610; https://doi.org/10.1117/12.933610
PROCEEDINGS
4 PAGES


SHARE
Back to Top