Electrical computers and digital processing systems: memory – Storage accessing and control – Memory configuring
Reexamination Certificate
2008-05-13
2008-05-13
Bataille, Pierre-Michel (Department: 2186)
Electrical computers and digital processing systems: memory
Storage accessing and control
Memory configuring
C711S173000, C701S201000, C701S202000, C707S793000
Reexamination Certificate
active
07373473
ABSTRACT:
Large data sets can be stored and processed in real time by combining and registering the large data sets into a single data set. The data can be stored in a data tree structure formed of layers of spatially organized blocks of data. Such storage allows portions of the data to be viewed efficiently, displaying actual point data at an acceptable resolution for the viewing mechanism. Density limited queries can be executed that allow sub-sampling to be done directly and evenly without geometric constraint, to provide a subset of points that is limited in size and includes a spatially-even decomposition of that set of points. This allows the system as a whole to support arbitrarily large point sets while allowing full partitioning functionality, which is efficient to use in both time and space.
REFERENCES:
patent: 6125367 (2000-09-01), NA
patent: 6771840 (2004-08-01), Ioannou et al.
patent: 7076409 (2006-07-01), Agrawala et al.
patent: 2001/0040573 (2001-11-01), Kressin
patent: 2003/0067461 (2003-04-01), Fletcher et al.
Ying et al., “An Analystical Approach to Floorplanning for Hierarchical Building Blocks Layout”, IEEE Transactions on Computer-Aided Design, vol. 8, No. 4, Apr. 1989, pp. 403-412.
Hirsch, Stephen A. An Algorithm for Automatic Name Placement Around Point Data. The American Cartographer, vol. 9, No. 1, 1982, pp. 5-17.
Douglas et al., Dec. 1973, “Algorithims for the Reduction of the Number of Points Required to Reresent a Digitized Line or its Caricature,” The Canadian Cartographer, vol. 10, No. 2, pp. 112-122.
Sarnet, “Applications of Spatial Data Structures,” Computer Graphics, Image Processing, and GIS, pp. 1-9.
Carla Nardinocchi et al., “Building extraction from LIDAR data, ”IEEE/ISPRS, Joint Workshop on Remote Sensing and Data Fusion over Urban Areas, Nov. 8-9, 2001, Piscataway, NJ, USA, IEEE, Nov. 8, 2001, pp. 79-83.
Marc Alexa et al., “Point Set Surfaces,”Proceedings Visualization 2001(Cat. No. 01CH37269),IEEE, Piscataway, NJ, USA, (2001), pp. 21-28.
Ravi Ramamoorthi et al., “Creating Generative Models from Range Images,”Computer Graphics Proceedings, Annual Conference Series, 1999, Aug. 1999, pp. 195-204.
Martin A. Fischler et al., “Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography,”Communications of the ACM, Jun. 1981, vol. 24, No. 6, pp. 381-395.
Paul J. Besl et al., “Invariant Surface Characteristics for 3D Object Recognition in Range Images,”Computer Vision, Graphics, and Image Processing, (1986), vol. 33, pp. 33-80.
Adam Hoover et al., “An Experimental Comparison of Range Image Segmentation Algorithms,”IEEE Transactions on Pattern Analysis and Machine Intelligence, Jul. 1996, vol. 18, No. 7, pp. 673-689.
Jianbo Shi et al., “Normalized Cuts and Image Segmentation,”IEEE Transactions on Pattern Analysis and Machine Intelligence, Aug. 2000, vol. 22, No. 8, pp. 888-905.
Bukowski Richard William
Downs Laura Michele
Kung Jonathan Apollo
Wheeler Mark Damon
Bataille Pierre-Michel
Leica Geosystems HDS LLC
Workman Nydegger
LandOfFree
System and method for efficient storage and manipulation of... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for efficient storage and manipulation of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for efficient storage and manipulation of... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2775661