Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2007-02-27
2007-02-27
Le, Uyen (Department: 2163)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000
Reexamination Certificate
active
10397530
ABSTRACT:
A method for determining relationships among data representing regions on a surface of a body. The method includes identifying a center of a first geometry. A minimum distance is identified from the center to a boundary of the first geometry. A first circle is defined on the surface of the body having the minimum distance as its radius and the center of the first geometry as its center. The first circle is compared with a second geometry to determine if the second geometry fulfills a first filter condition with respect to the first geometry.
REFERENCES:
patent: 5428744 (1995-06-01), Webb et al.
patent: 5710916 (1998-01-01), Barbaraet et al.
patent: 5963956 (1999-10-01), Smartt
patent: 5988853 (1999-11-01), Kim et al.
patent: 6084595 (2000-07-01), Bach et al.
patent: 6115717 (2000-09-01), Mehrotra et al.
patent: 6148295 (2000-11-01), Megiddo et al.
patent: 6154746 (2000-11-01), Berchtold et al.
patent: 6252605 (2001-06-01), Beesley et al.
patent: 6263334 (2001-07-01), Fayyad et al.
patent: 6308177 (2001-10-01), Israni et al.
patent: 6323859 (2001-11-01), Gantt
patent: 6438269 (2002-08-01), Kim et al.
patent: 6778981 (2004-08-01), Lee et al.
patent: 2002/0018061 (2002-02-01), Gantt
Kawachi et al, “Distance Computation between Non-convex Polyhedra at Short Range Based on Discrete Voronoi Regions”, Geometric Modeling and Processing 2000. Theory and Applications. Proceedings. Publication date: Apr. 10-12, 2000, pp. 123-128.
Kim et al “Development of Multi-Step Filtering Processor”, IEEE 1999, pp. 169-176.
P. Fischer et al., Computing a Maximum Axis-Aligned Rectangle in a Convex Polygon, Information Processing Letters 51 (1994) 189-193.
R. Kothuri et al., Efficient Processing of Large Spatial Queries Using Interior Approximations, Advances in Spacial and Temporal Databases, Lecture Notes in Computer Science, 2121, pp. 404-424, Redondo Beach, CA, Jul. 2001.
H. Alt et al., Computing the Largest Inscribed Isothetic Rectangle, pp. 1-8, Proc. 7thCanadian Conference Computational Geometry, Universit'e Laval, Qu'ebec, Aug. 1995.
K. Kanth et al., Indexing Medium-Dimensionality Data in Oracle, Proc. Of ACM SIGMOND Intl. Conference on Management of Data, pp. 521-522, Jun. 1999.
Silva et al “An Exact Interactive Time Visibility Ordering Algorithm for Polyhedral Cell Complexes”, IEEE 1998, pp. 87-94.
Bingham & McCutchen LLP
Le Uyen
LandOfFree
Query pruning using interior circles for geodetic data in an... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Query pruning using interior circles for geodetic data in an..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Query pruning using interior circles for geodetic data in an... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3865017