Patents by Inventor Tim Grouisborn

Tim Grouisborn has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20160004762
    Abstract: DBSCAN clustering analyses can be improved by pre-processing of a data set using a Hilbert curve to intelligently identify the centers for initial partitional analysis by a partitional clustering algorithm such as CLARANS. Partitions output by the partitional clustering algorithm can be process by DBSCAN running in parallel before intermediate cluster results are merged.
    Type: Application
    Filed: July 7, 2014
    Publication date: January 7, 2016
    Inventors: Edward-Robert Tyercha, Gerrit Simon Kazmaier, Hinnerk Gildhoff, Isil Pekel, Lars Volker, Tim Grouisborn
  • Publication number: 20160004739
    Abstract: Using index clusters to approximate coordinate values for vertices of compressed simplexes of a spatial data set, valid subspaces can be identified and used to identify other simplexes that may intersect a first simplex. Such approaches can be used for filtering, refining, etc. analysis of intersections between areas, lines, volumes, etc. within spatial data sets.
    Type: Application
    Filed: July 7, 2014
    Publication date: January 7, 2016
    Inventors: Edward-Robert Tyercha, Gerrit Simon Kazmaier, Hinnerk Gildhoff, Lars Volker, Tim Grouisborn
  • Publication number: 20160005141
    Abstract: Polygons can be simplified from an original, higher resolution to a simplified, lower resolution such that the simplified versions of the polygons do not introduce errors and also do not render boundaries shared with other polygons invalid.
    Type: Application
    Filed: July 7, 2014
    Publication date: January 7, 2016
    Inventors: Gerrit Simon Kazmaier, Hinnerk Gildhoff, Lars Volker, Tim Grouisborn
  • Publication number: 20150324373
    Abstract: A query of spatial data is received by a database comprising a columnar data store storing data in a column-oriented structure. Thereafter, a minimal bounding rectangle associated with the query is identified using a grid order scanning technique. The spatial data set corresponding to the received query is then mapped to physical storage in the database using the identified minimal bounding rectangle so that the spatial data set can be retrieved. Related apparatus, systems, techniques and articles are also described.
    Type: Application
    Filed: May 9, 2014
    Publication date: November 12, 2015
    Inventors: Edward-Robert Tyercha, Gerrit Simon Kazmaier, Hinnerk Gildhoff, Isil Pekel, Lars Volker, Tim Grouisborn
  • Publication number: 20150324399
    Abstract: A query of spatial data is received by a database comprising a columnar data store storing data in a column-oriented structure. Thereafter, a minimal bounding rectangle associated with the query is identified using a tree-order scanning technique. A spatial data set that corresponds to the received query is then mapped to the physical storage in the database using the identified minimal bounding rectangle. Next, the spatial data set is then retrieved. Related apparatus, systems, techniques and articles are also described.
    Type: Application
    Filed: May 9, 2014
    Publication date: November 12, 2015
    Inventors: Edward-Robert Tyercha, Gerrit Simon Kazmaier, Hinnerk Gildhoff, Isil Pekel, Lars Volker, Tim Grouisborn