Three-dimensional point-in-polygon operation to facilitate displaying three-dimensional structures
First Claim
1. A computer-implemented method for generating a visual representation of a set of polyhedra in a three-dimensional space, comprising:
- receiving a query to be processed, wherein the query is associated with the set of polyhedra;
using a late-binding schema generated from the query to retrieve a set of one or more data points from a set of events containing previously gathered data;
projecting polygons that define faces of each polyhedron in the set of polyhedra onto projected polygons in a reference plane;
for each data point in the set of one or more data points to be processed to determine what polyhedra the data point falls into,projecting the data point onto a projected data point in the reference plane,performing a two-dimensional point-in-polygon (PIP) operation in the reference plane to determine which projected polygons the projected data point falls into, andfor each projected polygon that the projected data point falls into, performing a three-dimensional crossing number (CN) operation toidentify zero or more polyhedra that the data point falls into;
generating a visual representation of the set of polyhedra, wherein the visual representation of each polyhedron is affected by data points that fall into the polyhedron; and
presenting the visual representation to a user.
1 Assignment
0 Petitions
Accused Products
Abstract
A system, a method and instructions embodied on a non-transitory computer-readable storage medium that solve a 3D point-in-polygon (PIP) problem is presented. This system projects polygons that comprise a set of polyhedra onto projected polygons in a reference plane. Next, the system projects a data point onto the reference plane, and performs a 2D PIP operation in the reference plane to determine which projected polygons the projected data point falls into. For each projected polygon the projected data point falls into, the system performs a 3D crossing number operation by counting intersections between a ray projected from the corresponding data point in a direction orthogonal to the reference plane and polyhedral faces corresponding to projected polygons, to identify polyhedra the data point falls into. The system then generates a visual representation of the set of polyhedra, wherein each polyhedron is affected by data points that fall into it.
-
Citations
33 Claims
-
1. A computer-implemented method for generating a visual representation of a set of polyhedra in a three-dimensional space, comprising:
-
receiving a query to be processed, wherein the query is associated with the set of polyhedra; using a late-binding schema generated from the query to retrieve a set of one or more data points from a set of events containing previously gathered data; projecting polygons that define faces of each polyhedron in the set of polyhedra onto projected polygons in a reference plane; for each data point in the set of one or more data points to be processed to determine what polyhedra the data point falls into, projecting the data point onto a projected data point in the reference plane, performing a two-dimensional point-in-polygon (PIP) operation in the reference plane to determine which projected polygons the projected data point falls into, and for each projected polygon that the projected data point falls into, performing a three-dimensional crossing number (CN) operation to identify zero or more polyhedra that the data point falls into; generating a visual representation of the set of polyhedra, wherein the visual representation of each polyhedron is affected by data points that fall into the polyhedron; and presenting the visual representation to a user. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A non-transitory computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for generating a visual representation of a set of polyhedra in a three-dimensional space, the storage medium including:
-
instructions for receiving a query to be processed, wherein the query is associated with the set of polyhedra; instructions for using a late-binding schema generated from the query to retrieve a set of one or more data points from a set of events containing previously gathered data; instructions for projecting polygons that define faces of each polyhedron in the set of polyhedra onto projected polygons in a reference plane; for each data point in the set of one or more data points to be processed to determine what polyhedra the data point falls into, instructions for projecting the data point onto a projected data point in the reference plane, performing a two-dimensional point-in-polygon (PIP) operation in the reference plane to determine which projected polygons the projected data point falls into, and for each projected polygon that the projected data point falls into, instructions for performing a three-dimensional crossing number (CN) operation to identify zero or more polyhedra that the data point falls into; instructions for generating a visual representation of the set of polyhedra, wherein the visual representation of each polyhedron is affected by data points that fall into the polyhedron; and instructions for presenting the visual representation to a user. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
-
-
23. A system that generates a visual representation of a set of polyhedra in a three-dimensional space, comprising:
-
at least one processor and at least one associated memory; and a display mechanism that executes on the at least one processor, wherein during operation, the display mechanism; receives a query to be processed, wherein the query is associated with the set of polyhedra; uses a late-binding schema generated from the query to retrieve a set of one or more data points from a set of events containing previously gathered data; projects polygons that define faces of each polyhedron in the set of polyhedra onto projected polygons in a reference plane; for each data point in the set of one or more data points to be processed to determine what polyhedra the data point falls into, projects the data point onto a projected data point in the reference plane, performs a two-dimensional point-in-polygon (PIP) operation in the reference plane to determine which projected polygons the projected data point falls into, and for each projected polygon that the projected data point falls into, performs a three-dimensional crossing number (CN) operation to identify zero or more polyhedra that the data point falls into; generates a visual representation of the set of polyhedra, wherein the visual representation of each polyhedron is affected by data points that fall into the polyhedron; and presents the visual representation to a user. - View Dependent Claims (24, 25, 26, 27, 28, 29, 30, 31, 32, 33)
-
Specification