Data processing: structural design – modeling – simulation – and em – Modeling by mathematical expression
Reexamination Certificate
2007-07-03
2007-07-03
Ferris, Fred (Department: 2128)
Data processing: structural design, modeling, simulation, and em
Modeling by mathematical expression
C707S793000, C707S793000, C707S793000, C703S013000, C703S021000
Reexamination Certificate
active
10621455
ABSTRACT:
A method for determining a with-distance relationship between a first geometry object and a second geometry object. The method includes defining an exterior approximation of the first geometry and the second geometry. A distance between the exterior approximations is computed. The computed distance is compared with a first predetermined distance to determine whether the second geometry satisfies a first filter condition with respect to the first geometry.
REFERENCES:
patent: 5428744 (1995-06-01), Webb et al.
patent: 5710916 (1998-01-01), Barbara et al.
patent: 5988853 (1999-11-01), Kim 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: 6438269 (2002-08-01), Kim et al.
patent: 6778981 (2004-08-01), Lee et al.
patent: 6847384 (2005-01-01), Sabadell et al.
patent: 6868410 (2005-03-01), Fortin et al.
patent: 6915289 (2005-07-01), Malloy et al.
patent: 7080065 (2006-07-01), Kothuri et al.
patent: 2002/0087570 (2002-07-01), Jacquez et al.
patent: 2004/0249809 (2004-12-01), Ramani et al.
“Quadtree and R-tree Indexes in oracle Spatial: A Comparison using GIS Data”, Kothuri et al, ACM SIGMOD '2002, Jun. 4-6, 2002.
Spatial Databases—Accomplishments and Research Notes, Shekhar et al, IEEE Transactions on Knowledge and Data Engineering, vol. 11, No. 1, 1999.
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-533, Jun. 1999.
Silva et al. “An Exact Interactive Time Visibility Ordering Algorithm for Polyhedral Cell Complexes”, IEEE 1998, pp. 87-94.
Bingham & McCutchen LLP
Ferris Fred
Oracle International Corporation
LandOfFree
Within-distance query pruning in an R-tree index does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Within-distance query pruning in an R-tree index, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Within-distance query pruning in an R-tree index will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3800196