Abstract
Three-dimensional point sets can be used to represent data in different domains. Given a database of 3D point sets, pattern discovery looks for similar subsets that occur in multiple point sets. Geometric hashing has proved to be an effective technique in discovering patterns in 3D point sets. However, the method are has shortcomings. We propose a new indexing technique called /spl Delta/B/sup +/ trees. It is an extension of B/sup +/-trees that stores point triplet information and overcomes shortcomings of the geometric hashing technique. We introduce four different ways of constructing the key from a triplet. We give an analytical comparison between the new index structure and the geometric hashing technique. We also conduct experiments on both synthetic data and real data to evaluate performance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
