Patent Grant
11487414
This disclosure relates to approaches for production and display of map based slide presentations.
Under conventional approaches, software for developing and displaying slide presentations may be provided. Conventional approaches for creating slide presentations generally permit users to insert images and text in slides, and to display the slides in a linear fashion. Such conventional approaches, however, may be limited in the types of information that can be inserted and presented through slides. These and other drawbacks exist with conventional slide presentation software.
A claimed solution rooted in computer technology overcomes problems specifically arising in the realm of computer technology. In various implementations, a computing system is configured to provide tools that allow users to create map-based slide presentations. For example, in some embodiments, the computing system can provide a map interface through which users can select map data to be included in one or more slides of a presentation. Such map data may include images corresponding to selected map regions as well as selected map labels that describe points of interest in the map regions. The map interface can also permit users to modify various attributes of the map regions (e.g., zoom level, map labels, etc.). Once a desired map region is ready for publication, the user can select an option to export map data corresponding to the map region into one or more slides of the presentation. In some embodiments, information in slides can be linked to data objects. In these embodiments, such information can be updated in response to modifications to the linked data objects. In some embodiments, the technology may also permit the creation of hierarchical slide displays, wherein a portion of a slide display may include a link to another slide display in a nested hierarchy.
In various implementations, the technology may provide a variety of features that permit users to generate slides and slide presentations from map data. For example, a map interface may be provided to a user, permitting the user to select a map portion from which to generate one or more slides. The user may manipulate the map via the interface to define the map portion to be included on the slide, by, for example, altering zoom levels, adjusting labels, selecting map layers, including or excluding points of interest, and/or other manipulations. The selected map portion may be exported to create a slide data object. In some implementations, the slide data object is linked to the source map. In some implementations, the source map being accessed through the interface may include geographical data objects or links to geographical data objects. Such geographical data objects may contain information or data about corresponding locations on the map. When a slide is being generated from a map portion, some or all of the geographical data objects included in a region captured by the slide may be linked to and/or incorporated within the slide. In some implementations, a user may select which geographical data objects to include in the newly created slide. In some implementations, when a slide is created from a source map, the slide itself may be a geographical data object of the map, thereby permitting a user or analyst to view the slide when viewing the source map and/or to incorporate the slide into another slide generated from the source map. In some implementations, a user may tag slides and the information they contain with access control tags. Access control tags may serve to automatically determine which aspects of a slide to make visible during a presentation, based on the access control levels of those viewing the presentation. In some implementations, the map data on the slides may be manipulated during a presentation.
In some implementations, a system for generating a dynamically linked geographical slide presentation is provided. The system may include one or more processors and a memory storing instructions. When executed by the one or more processors the system may be caused to provide map data corresponding to a given geographic region for presentation through an interface, determine a selection of a portion of the geographic region through the interface, and generate a first slide of a slide presentation based at least in part on the selection, the first slide including at least a visual representation of the selected portion of the geographic region.
In some implementations, a method for generating a dynamically linked geographical slide presentation is provided. The method may be performed on a computer system having one or more physical processors programmed with computer program instructions that, when executed by the one or more physical processors, cause the computer system to perform the method. The method may include providing, by the computer system, map data corresponding to a given geographic region for presentation through an interface, determining, by the computer system, a selection of a portion of the geographic region through the interface, and generating, by the computer system, a first slide of a slide presentation based at least in part on the selection, the first slide including at least a visual representation of the selected portion of the geographic region.
These and other objects, features, and characteristics of the systems and/or methods disclosed herein, as well as the methods of operation and functions of the related elements of structure and the combination of parts and economies of manufacture, will become more apparent upon consideration of the following description and the appended claims with reference to the accompanying drawings, all of which form a part of this specification, wherein like reference numerals designate corresponding parts in the various figures. It is to be expressly understood, however, that the drawings are for the purpose of illustration and description only and are not intended as a definition of the limits of the invention. As used in the specification and in the claims, the singular form of “a”, “an”, and “the” include plural referents unless the context clearly dictates otherwise.
Certain features of various embodiments of the present technology are set forth with particularity in the appended claims. A better understanding of the features and advantages of the technology will be obtained by reference to the following detailed description that sets forth illustrative embodiments, in which the principles of the technology are utilized, and the accompanying drawings of which:
The technology described herein relates to systems and methods for producing dynamically linked slide displays from map data. The system provides tools to facilitate the generation of map-based slides from map data. The map data may correspond to a geographic region and may include one or more geographic data objects corresponding to various aspects of the map and/or locations in the map. Implementations of the system permit a user to select a portion of a geographic region, using a map interface, for inclusion within a slide. The mapping interface may further permit a user to include with the slide any portion of the map data, e.g., geographic data objects, associated with the selected portion. In some implementations, all aspects of the slide (e.g., geographic data objects) may be dynamically linked to the source map data from which they were extracted. This linked slide data (e.g., geographical data objects) can be updated when the source map data is updated. In some implementations, generated slides may themselves become geographic data objects and may be included in other generated slides. Thus, in some implementations, generated slides may be linked to other slides in a hierarchical fashion. In some implementations, access controls may be applied to any or all data included within a slide, thereby permitting the restriction of data within the slide to viewers having an appropriate access level.
In some implementations, the object based data structure 100 uses an object model, e.g., a framework for how data is stored. The object model can be further defined by an ontology, defining the types of data and how they are stored in a given system. The ontology can be updated to match the needs of the system and analysts. The ontology may define various types of data objects 101 and 108, object properties 102, and data links 105, to name some examples. The ontology may further define which data object types may be associated with each other. Each data object type may have a corresponding Uniform Resource Identifier (URI) that identifies the data object type.
In some implementations, object types define the kinds of things that may be represented in the system and provide structure for data objects 101. Object types may be derived from, for example, geographical information, slide information, entity types, event types, document types, and multimedia types. Event and document types may have temporal and geospatial data directly included within the data object (e.g., the data object 101) itself. An object type may define the number and composition of properties 102, notes 103, and media components 104 of a data object 101, for example. The object type may further define what other types of objects that data links 105 may permit association with. For example, an entity object type may define a data object 101 used to store data about a person and may include respective data properties 102 for storing a name, address, occupation, e-mail address, phone number, etc. Data links 105 of an entity object 101 may permit the entity object 101 to be linked to other entity objects (e.g., contacts or associates), event objects (e.g., events attended or invited to), linked to document objects (e.g., authored), or other types of objects.
In some implementations, object property types may define the type and behavior of input data. For example, property types may define the structure of the data stored in an object property 102. The property type may define one or more data fields, the type of data associated with the field, as well as tools that may operate on the data fields. Property types may be simple, including a single data field, and/or may be composite, including multiple data fields. For example, an e-mail property type may define an e-mail object property. For example, the e-mail address john@example.com may be stored in an e-mail object property as follows: URI: com.property.Email, Base Type: Composite, with these components: EMAIL_USERNAME with the value “john,” EMAIL_DOMAIN with the value “example.com.” Further, the e-mail property type may define tools for parsing and concatenating the username and the domain, depending on what is required.
In some implementations, data link types may define the types of data links 105 that can exist between data objects (e.g., data object 101 and data object 108). Links may be symmetric or asymmetric. In some implementations, links may have one object that is considered the “parent” object and the other that is the “child” Object. In the case of symmetric links, e.g., “Spouse Of,” which the parent and child objects are not contextually important. In the case of asymmetric links, like “Manager Of/Managed By,” the parent and child may reflects the direction of the link.
Thus, in various implementations, an ontology of an object-based data system may define the way in which data is organized in the object based data system. The ontology can define the types of objects that may be stored and the components of the defined data objects (e.g., data object 101, data object 108, etc.) as well as the manner in which the defined data objects may link to one another through data links 105.
In some implementations, the geographic object based data structure 200 uses a geographic object model defined by a geographic ontology for storing data. For example, a geographic ontology may define a geographic data object 201 which may include a geographic location property 210, a geographic object property 202, and at least one geographic data link 205. The geographic data object 201 can be a specialized data object having any or all of the properties of data object 101 including the additional aspects described. In some implementations, the geographic location property 210 may include information describing a geographic location with which the geographic data 201 is associated. For example, geographic location property 210 may include GPS coordinates, a street address, a three word geographic address, and/or any other geographic coding scheme that may represent a location with which the geographic data object 201 is associated. Geographic object property 202 may be an object property type that includes data describing a given geographic location. For example, a geographic object property 202 may include information about populations, weather conditions, soil conditions, climate history, and/or other types of data associated with the geographic locations. In some implementations, geographic object property 202 may include information about points of interest such as an institution, building, or other entity located at the geographic location (e.g., a school, bus stop, company, etc.). In some implementations, the geographic data link 205 may include a link to any type of data object, including, for example, the data object 101, the geographic data objects 201 and 208, and slide objects (discussed below). In some implementations, the geographic data links 205 may share the properties of data links 105 as described above. Thus, the geographic data structure 200 defines a data ontology for a geographic data object 201, which may be a data object that corresponds to a map, geographic location, or any other data associated with the geographic location.
The slide object based data structure 300 can a slide object model as defined by a slide presentation ontology for storing data. In some implementations, a slide presentation ontology may define a slide data object 301 which may include a map data property 310, a slide object property 302, and at least one slide data link 305. Slide data object 301 may be a specialized data object having any or all of the properties of data object 101 including the additional aspects described. In some implementations, the map data property 310 may include information describing a portion of a geographic region for which the slide contains information. In some implementations, the map data property 310 may be defined by raw map information (e.g., as stored in slide data source 307) and/or by map information stored in an alternate data source. For example, when the slide object 301 is created, the slide object 301 may include data that is obtained directly from the geographic map data from the slide object 301 was created. In another example, the slide object 301 may also include links and/or references to the geographic map data from which the slide object 301 was created. In some implementations, the slide object property 302 may be an object property type that includes data describing a presentation slide. For example, a slide object property 302 may include information describing map data that is included in a map data property 310. In some implementations, the slide object property 302 may include any or all of the aspects described above for object property 202. In some implementations, a slide data link 305 may include a link to any type of data object, including geographic data objects (e.g., the geographic data object 201) and slide data objects (e.g., the slide data object 301). In some implementations, a slide data link 305 may link to other slide data objects (e.g., slide data object 308) as part of a linear multi-slide presentation. In some implementations, the slide data link 305 may link to other slide data objects as part of a tiered or hierarchical presentation. For example, information presented in a given slide that corresponds to a slide data object 301 may link to an additional slide (or slides) that provide additional detail. Thus, in this example, a viewer of the given slide may choose to view the next linked presentation slide in sequence. Alternatively, the viewer may choose to view additional linked presentation slides that provide more detail on a topic presented by the given slide. In various implementations, the slide data links 305 may share the properties of other data links as described above. Thus, in some implementations, the slide data structure 300 defines a data ontology for a slide data object 301, which may be a data object that includes map data and other information to be presented with the map data.
After the user has defined the selection area 401, the user may select an option to export the selection area 401. In some implementations, a slide is generated from the exported selection area 401. This slide can then be included in a slide presentation. In some implementations, data corresponding to the exported selection area 401 is stored as a slide data object (e.g., the slide data object 301). Exported slide data object 301 may include slide map data 310 including information describing the selection area 401. For example, the information can be using map data extracted from the map data 402 and/or as a series of parameters defining the selection area (e.g., such as coordinates, map customization settings, etc.). In some implementations, the system may export, with the slide data object 301, any geographic data objects located within the selection area 401. In some implementations, geographic data objects (e.g., geographic data objects 403) can be identified in the map data 402 as points of interest. In some implementations, a user may select geographic data objects located within the selection area 401 to be included in a slide data object being exported. In some implementations, the geographic data object icons 403 may be representative of other slide data objects. Thus, for example, a user may build a hierarchical slide presentation by determining a selection area that includes other slide data objects. In this example, any slide data objects that are included in an area selected in the map data 402 can be included in the newly created slide.
After extracting a slide data object (e.g., the slide data object 301), the system may facilitate the customization of a slide associated with the slide data object 301. Accordingly, the user may add or link to additional information to be included in the displayed slide. Such information may be included in one or more slide data properties 302 of the slide data object 301, for example. The user may further determine to link the slide data object 301 to other slide data objects using slide data links (e.g., slide data links 305). By linking one slide data object to another, the user can create a series of linked slides for display in a slide presentation. In one example, a first slide data object corresponding to a given slide may be linked to a second slide data object that corresponds to various data (e.g., map data). The second slide data object may provide information that is referenced during presentation of the given slide and/or information that supports statements made in the given slide.
The system may further determine access control levels to regulate the amount of data that is shown during a slide presentation. In some implementations, access control levels can be assigned by a user that creates a slide data object and/or may be assigned by an alternative system operator to any data aspect stored by the system. For example, in some implementations, when a new slide data object 301 is created, the slide map data 310, the various slide data properties 302, and any linked data objects (as defined by the slide data links 305) may each be assigned a corresponding access control level by a user creating the slide data object 301. In some implementations, data may already have an access control associated. For example, a selection area 401 may incorporate one or more geographic data objects 201, which may already include an assigned access control level. When incorporated into a slide data object 301, either directly as a slide data property 302 or via linking, the previously assigned access control level of the included geographic data object may remain intact. In some implementations, when creating a slide or slide presentation based on a slide data object 301, the system may embed information corresponding to the assigned access control level into the slide or slide presentation.
In various implementations, a slide presentation (or a slide deck) can be created using the approaches described above. This slide presentation can then be shown to an audience. In some implementations, an individual (e.g., a presenter) can interact with map data included in the slide presentation while slides are being presented to the audience. That is, in some implementations, the presenter may dynamically interact with map data being presented without losing their position in the slide presentation. For example, in some implementations, the presenter may choose to respond to questions from an audience member by manipulating map data, including panning and zooming, interacting with other map data objects, or by navigating to another slide based on the geospatial reference of that slide rather than its location in the presentation. In such implementations, this manipulation of map data allows the presenter to appropriately respond to questions and/or to communicate various information during the presentation without affecting the overall slide presentation sequence.
The data sources 107, 207, 307, 507 may be computer memories configured to store data. Further, the data sources 107, 207, 307, 507 may store data formatted according to object based data structures as described above. For example, the data source 107, geographic data source 207, and slide data source 307 are described above. In some implementations, the map data source 507 may store map data of a geographic region. The stored map data may include multi-layer maps, e.g., streets, topography, underground, buildings, etc. The stored map data may also include information about geographic locations on the map. The stored map data may further include any additional relevant map data. In some implementations, the stored map data may include references to data objects, such as geographic data objects (e.g., geographic data object 201) and/or slide data objects (e.g., slide data object 301) associated with various locations in the map.
The computer system 510 may be configured as a server (e.g., having one or more server blades, processors, etc.), a personal computer (e.g., a desktop computer, a laptop computer, etc.), a smartphone, a tablet computing device, and/or other computing device that can be programmed to receive tabular data or object based data, provide services for the manipulation of the data, and provide services for transformation and display of the data.
The computer system 510 may include one or more processors 532 (also interchangeably referred to herein as processors 532, processor(s) 532, or processor 532 for convenience), one or more storage devices 534, and/or other components. Processors 532 may be programmed by one or more computer program instructions stored on storage device 534. For example, processors 532 may be programmed by database access module 512, map interface module 514, slide object generation module 516, slide interface module 518, access control module 520, and/or other instructions that program computer system 510 to perform various operations, each of which are described in greater detail herein. As used herein, for convenience, the various instruction modules, systems, and engines will be described as performing an operation, when, in fact, the various instructions program the processors 532 (and therefore computer system 510) to perform the operation. Further details and features of a computer system 510 configured for implementing features of the described technology may be understood with respect to computer system 700 as illustrated in
User device 540 may be configured as a server (e.g., having one or more server blades, processors, etc.), a personal computer (e.g., a desktop computer, a laptop computer, etc.), a smartphone, a tablet computing device, and/or other device that can be programmed to receive tabular data or object based data, provide services for the manipulation of the data, and provide services for transformation and display of the data.
User device 540 may include one or more processors 542 (also interchangeably referred to herein as processors 542, processor(s) 542, or processor 542 for convenience), one or more storage devices 544, and/or other components. Processors 542 may be programmed by one or more computer program instructions. For example, processors 542 may be programmed by database access module 512, map interface module 514, slide object generation module 516, slide interface module 518, access control module 520, and/or other instructions that program user device 540 to perform various operations, each of which are described in greater detail herein. As used herein, for convenience, the various instruction modules will be described as performing an operation, when, in fact, the various instructions program the processors 542 (and therefore user device 540) to perform the operation.
In various implementations, the database access module 512, may be a software module operating on computer system 510 and/or user device 540. Database access module 512 may be configured to provide system access to data sources, e.g., the data sources 107, 207, 307, 507. Database access module 512 may be configured to read and write to data sources 107, 207, 307, 507, as well as carry out searches, queries, and any other database functionality required by computer system 510 and/or user device 540. In some implementations, the database access module 512 may access data objects (e.g., data objects 101), geographic data objects (e.g., geographic data objects 201), slide data objects (e.g., slide data objects 301), and stored map data.
In various implementations, the map interface module 514, may be a software module operating on computer system 510 and/or user device 540. Map interface module 514 may provide a map interface to a user via a computer display and receive user inputs for manipulation of the map display. Map interface module 514 may provide the user with the tools and features to determine a selection area (e.g., the selection area 401) from map data of a geographic region and generate a slide data object (e.g., the slide data object 301). Map interface module 514 may communicate with database access module 512 to obtain map data from map data sources (e.g., the map data source 507) for geographic regions to be presented to a user. Map interface module 514 may further communicate with database access module 512 to obtain data from data source 107, geographic data source 207, and slide data source 307, for example.
Map interface module 514 may customize a map according to user interactions. For example, the map interface module 514 may adjust the various aspects included on the map, including panning and zooming, layers, geographic data objects, slide data objects, geographic features, map feature names, etc., according to a user's inputs and/or interactions with the map interface. Map interface module 514 can capture a portion of the geographic region based on the user's selection of a selection area (e.g., the selection area 401).
In some implementations, the map interface module 514 may further provide a user with data entry options to add additional information to a slide for presentation. Additional data entry options may permit a user to include text, images, videos, etc., within a slide. Map interface module 514 may further receive inputs from a user to link a slide to one or more other slides in the same presentation or in different presentations.
In various implementations, the slide object generation module 516, may be a software module operating on computer 510 and/or user device 540. Slide object generation module 516 may receive data including a selected map portion and included geographic data objects (e.g., the geographic data objects 201) and slide data objects (e.g., slide data objects 301) as well as any additional data entered by the user for slide object generation from map interface module 514. Slide object generation module 514 may create a slide data object (e.g., slide data object 301) storing the selected portion of the geographic region as slide map data (e.g., slide map data 310), and storing geographic data objects (e.g., geographic data objects 201), slide data objects (e.g., slide data objects 301), and any additional information provided by a user as slide object properties (e.g., slide object properties 302). In some implementations, slide data objects and geographic data objects may be linked to via slide data object links. Slide data object links may further store links to additional slides in a presentation, as selected or designated by a user via map interface module 514.
In some implementations, the slide object generation module 516 may generate one or more slides of a slide presentation for viewing independent of access to data sources 107, 207, 307, 507. That is, in such implementations, all of the data required for display of a slide presentation, including all linked slides and data objects, may be packaged together in one or more files for export for display on a system that cannot access the data sources.
In various implementations, the slide interface module 518, may be a software module operating on computer system 510 and/or user device 540. Slide interface module 518 may be configured to access a slide data object (e.g., slide data object 301), e.g., via database access module 512, and generate a slide of a slide presentation for display to a user. Slide interface module 518 may access and display map data stored in or linked to via slide map data (e.g., slide map data 310) and may display additional slide information stored as slide object properties (e.g., slide object properties 302) and/or linked to the slide data object via slide object data links (e.g., slide object data links 305).
In various implementations, the slide interface module 518 may access a slide data object (e.g., slide data object 301) to display a slide as part of a larger slide presentation, and may provide to a user software tools to navigate a slide presentation, both linearly and hierarchically. Slide interface module 518 may advance a slide presentation linearly from one slide to the next, accessing the respective slide data objects associated with each slide in the presentation. Slide interface module 518 may further access and cause the display of geographic data objects (e.g., geographic data objects 201) and slide data objects linked to via slide data object links. For example, when viewing a slide of a presentation, a user may choose to navigate to the next slide in a linear display and/or may select a geographic data object or slide data object included in the selected map area. Navigating to a geographic data object or slide data object included in the selected map area may permit the user to access data sources from which the slide is created and/or to access additional slide presentations that provide greater detail to topics discussed in the initial slide. In some implementations, additional slides (or slide presentations) may be pre-built in anticipation of certain topics and/or questions that may arise during a given slide presentation. That is, these additional slides may include information (e.g., map data) that specifically addresses various topics and/or questions that may or may not be needed during the slide presentation. In such implementations, these additional slides are typically not shown during the slide presentation unless needed. If needed during the presentation, the presenter can access the additional slides either by locating these slides geospatially and/or by accessing a direct link to the slides from a slide (or parent slide) in the presentation.
In some implementations, the slide interface module 518 may update a slide presentation for display. A user may access and display a slide presentation associated with one or more slide data objects at a first time. After accessing the slide presentation, data associated with the various data (e.g., geographic data objects 201 and slide data objects 301, as well as map data 402) associated with the slide display may be updated. In such instances, the user may access and display the slide presentation after data has been updated. When the slide presentation is accessed again, slide interface module 518 may provide an updated slide presentation for display and interaction with the user. In some implementations, the user selects an update option to cause the slide presentation to be updated based on changes to the underlying data (e.g., geographic data objects 201 and slide data objects 301, as well as map data 402).
In various implementations, the access control module 520 may be a software module operating on computer system 510 and/or user device 540. Access control module 520 may operate to verify viewer access levels and adjust slide presentation access according an access level of one or more viewers. Access control module 520 may operate in concert with slide interface module 518 to cause the display of slide elements corresponding to an access level of viewers of the slide presentation. Access control module may also operate in concert with slide object generation module 516 to receive access control levels associated with the data of slide data objects and embed information corresponding to the access control levels with that data in the corresponding slide data objects. As discussed above, any and all data associated with a slide data object, including slide map data, slide data properties, and any data linked to the slide data object via a slide data link may be designated with a corresponding access level control designating a required access level for viewing.
In some implementations, when a slide presentation is being presented, a presenter can identify the respective access levels of entities in the audience using the access control module 520. For example, in some implementations, access levels may be represented as security categories (or “hats”). When giving a slide presentation, the presenter can indicate the respective security categories (or hats) corresponding to individuals in the audience. Based on the indicated access levels, the access control module 520 can automatically modify the slide presentation so that only slides (or information in slides) that are cleared for access by the audience are displayed. In some implementations, the access control module 520 may require potential viewers to log-in via user name and password, may require biometric scanning, may require physical credential verification, and/or may require any other suitable verification.
In some implementations, the access control module 520 may cause the selective display of data associated with a slide data object according to the access levels of viewers. For example, where all viewers have access to all data, the access control module 520 may permit slide interface module 518 to display all aspects of a slide presentation. In another example, if a verified user has an access level that does not permit viewing of all data, any data not permitted by that user's access level is not displayed. In another example, users may have access to information provided in a slide presentation, but may lack access to any linked geographic data objects or slide data objects that support the information on the slide. In this example, a user may be permitted to see summarized information without being permitted to see the more in-depth information from which the summary information is created. In some implementations, the slides, or portions of the slides, are redacted based on audience access levels. In some implementations, when multiple entities in the audience have different access levels, the union of these access levels is used to determine which aspects of the slide presentation will be shown.
Although illustrated in
Furthermore, it should be appreciated that although the various instructions are illustrated in
Additionally, the modular software breakdown as illustrated in
The description of the functionality provided by the different instructions described herein is for illustrative purposes, and is not intended to be limiting, as any of instructions may provide more or less functionality than is described. For example, one or more of the instructions may be eliminated, and some or all of its functionality may be provided by other ones of the instructions. As another example, processor(s) 532, 542 may be programmed by one or more additional instructions that may perform some or all of the functionality attributed herein to one of the instructions.
The various instructions described herein may be stored in a storage device 534, 544 which may comprise random access memory (RAM), read only memory (ROM), and/or other memory. The storage device may store the computer program instructions (e.g., the aforementioned instructions) to be executed by processor 532, 542 as well as data that may be manipulated by processor 532, 542. The storage device may comprise floppy disks, hard disks, optical disks, tapes, or other storage media for storing computer-executable instructions and/or data.
The various components illustrated in
In an operation 602, map data may be provided to a user via a map interface (e.g., the map interface 400). For example, the map interface module 514 may operate to obtain map data (e.g., map data 402) via database access module 512 and present a map interface to a user. The map data provided may correspond to a specific geographic region. Map interface module 514 may further provide the user software tools for map manipulation, as described above.
In an operation 604, a selection of a portion of the geographic region may be determined via the map interface. The selection may be determined according to user input through the map interface. The selected portion of the geographic region may include all of the map data encompassed by the selected portion, as well as any data objects, geographic data objects, and slide data objects associated with and/or located within the selected portion of the geographic region.
In an operation 606, a slide of a slide presentation may be generated according to at least the selected portion. The generated slide may include a visual representation of the selected portion as well as visual representations of any data objects encompassed therein. For example, the slide object generation module 516 may extract data for a slide data object from the map data and data objects of the selected portion in the map interface.
In some implementations, operation 606 may further include receiving additional information, from the user via map interface, for inclusion within the slide. For example, where a user has selected a specific map portion, the user may then wish to add bullet points and or other data to complete the slide. Additional user information, including added data as well as linked-to data objects may be included in the slide data object representative of the newly created slide.
In an operation 608, access controls may be determined and embedded within the slide data object and/or within the newly created slide. Access controls may be determined and embedded by operation of access control module 520. Access controls may be determined by direct user input. For example, a user may individually assign required access levels to various pieces of data and information in a newly created slide. Access controls may also be determined by incorporation. For example, when the selected portion includes a geographic data object that becomes incorporated in the newly created slide, the access level of that geographic data object may remain the same in the newly created slide. In some implementations, the user may be given an opportunity to adjust the access level of incorporated data.
In some implementations, the system may return to operation 602 or operation 604 to permit a user to generate one or more additional slides to create a slide presentation.
In an operation 610, one or more slides of a presentation may be displayed. Slide interface module 518 may operate to cause display of the newly created slide or slides on a computer display. The slide or slides may be cause to be displayed on a computer system 510, user device 540, and/or any other computer system including a display capable of displaying the slide to any viewer or viewers. Slide interface module 518 may cooperate with access control module 520 to determine which portions of the slide(s) to display, based on access control levels of viewers as determined by access control module 520.
Thus, slide generation process 600 may provide a method of generating slides by extracting slide data objects from map data according to user input and manipulation of the map data. The extracted slide data objects may be the data source for the newly generated slides, and a user may generate as many slide data objects as needed to complete a slide presentation. Created slides may encompass any or all map data and/or data objects within a selected map portion, according to user input. A user may apply access level controls to the newly created slides, and/or may apply previously assigned access level controls to incorporated data. The system may further cause the display of the newly created slides and access control of their content.
The computer system 700 also includes a main memory 706, such as a random access memory (RAM), cache and/or other dynamic storage devices, coupled to bus 702 for storing information and instructions to be executed by processor 704. Main memory 706 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 704. Such instructions, when stored in storage media accessible to processor 704, render computer system 700 into a special-purpose machine that is customized to perform the operations specified in the instructions.
The computer system 700 further includes a read only memory (ROM) 708 or other static storage device coupled to bus 702 for storing static information and instructions for processor 704. A storage device 710, such as a magnetic disk, optical disk, or USB thumb drive (Flash drive), etc., is provided and coupled to bus 702 for storing information and instructions.
The computer system 700 may be coupled via bus 702 to a display 712, such as a cathode ray tube (CRT) or LCD display (or touch screen), for displaying information to a computer user. An input device 714, including alphanumeric and other keys, is coupled to bus 702 for communicating information and command selections to processor 704. Another type of user input device is cursor control 716, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 704 and for controlling cursor movement on display 712. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane. In some embodiments, the same direction information and command selections as cursor control may be implemented via receiving touches on a touch screen without a cursor.
The computing system 700 may include a user interface module to implement a GUI that may be stored in a mass storage device as executable software codes that are executed by the computing device(s). This and other modules may include, by way of example, components, such as software components, object-oriented software components, class components and task components, processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables.
In general, the word “module,” as used herein, refers to logic embodied in hardware or firmware, or to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, C or C++. A software module may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, for example, BASIC, Perl, or Python. It will be appreciated that software modules may be callable from other modules or from themselves, and/or may be invoked in response to detected events or interrupts. Software modules configured for execution on computing devices may be provided on a computer readable medium, such as a compact disc, digital video disc, flash drive, magnetic disc, or any other tangible medium, or as a digital download (and may be originally stored in a compressed or installable format that requires installation, decompression or decryption prior to execution). Such software code may be stored, partially or fully, on a memory device of the executing computing device, for execution by the computing device. Software instructions may be embedded in firmware, such as an EPROM. It will be further appreciated that hardware modules may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. The modules or computing device functionality described herein are preferably implemented as software modules, but may be represented in hardware or firmware. Generally, the modules described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage.
The computer system 700 may implement the techniques described herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which in combination with the computer system causes or programs computer system 700 to be a special-purpose machine. According to one embodiment, the techniques herein are performed by computer system 700 in response to processor(s) 704 executing one or more sequences of one or more instructions contained in main memory 706. Such instructions may be read into main memory 706 from another storage medium, such as storage device 710. Execution of the sequences of instructions contained in main memory 706 causes processor(s) 704 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions.
The term “non-transitory media,” and similar terms, as used herein refers to any media that store data and/or instructions that cause a machine to operate in a specific fashion. Such non-transitory media may comprise non-volatile media and/or volatile media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 710. Volatile media includes dynamic memory, such as main memory 706. Common forms of non-transitory media include, for example, a floppy disk, a flexible disk, hard disk, solid state drive, magnetic tape, or any other magnetic data storage medium, a CD-ROM, any other optical data storage medium, any physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, NVRAM, any other memory chip or cartridge, and networked versions of the same.
Non-transitory media is distinct from but may be used in conjunction with transmission media. Transmission media participates in transferring information between non-transitory media. For example, transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 702. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.
Various forms of media may be involved in carrying one or more sequences of one or more instructions to processor 704 for execution. For example, the instructions may initially be carried on a magnetic disk or solid state drive of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 700 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 702. Bus 702 carries the data to main memory 706, from which processor 704 retrieves and executes the instructions. The instructions received by main memory 706 may retrieves and executes the instructions. The instructions received by main memory 706 may optionally be stored on storage device 710 either before or after execution by processor 704.
The computer system 700 also includes a communication interface 718 coupled to bus 702. Communication interface 718 provides a two-way data communication coupling to one or more network links that are connected to one or more local networks. For example, communication interface 718 may be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 718 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN (or WAN component to communicated with a WAN). Wireless links may also be implemented. In any such implementation, communication interface 718 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
A network link typically provides data communication through one or more networks to other data devices. For example, a network link may provide a connection through local network to a host computer or to data equipment operated by an Internet Service Provider (ISP). The ISP in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet”. Local network and Internet both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link and through communication interface 718, which carry the digital data to and from computer system 700, are example forms of transmission media.
The computer system 700 can send messages and receive data, including program code, through the network(s), network link and communication interface 718. In the Internet example, a server might transmit a requested code for an application program through the Internet, the ISP, the local network and the communication interface 718.
The received code may be executed by processor 704 as it is received, and/or stored in storage device 710, or other non-volatile storage for later execution.
Each of the processes, methods, and algorithms described in the preceding sections may be embodied in, and fully or partially automated by, code modules executed by one or more computer systems or computer processors comprising computer hardware. The processes and algorithms may be implemented partially or wholly in application-specific circuitry.
The various features and processes described above may be used independently of one another, or may be combined in various ways. All possible combinations and sub-combinations are intended to fall within the scope of this disclosure. In addition, certain method or process blocks may be omitted in some implementations. The methods and processes described herein are also not limited to any particular sequence, and the blocks or states relating thereto can be performed in other sequences that are appropriate. For example, described blocks or states may be performed in an order other than that specifically disclosed, or multiple blocks or states may be combined in a single block or state. The example blocks or states may be performed in serial, in parallel, or in some other manner. Blocks or states may be added to or removed from the disclosed example embodiments. The example systems and components described herein may be configured differently than described. For example, elements may be added to, removed from, or rearranged compared to the disclosed example embodiments.
Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment.
Any process descriptions, elements, or blocks in the flow diagrams described herein and/or depicted in the attached figures should be understood as potentially representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those skilled in the art.
It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are to be understood as being among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure. The foregoing description details certain embodiments of the invention. It will be appreciated, however, that no matter how detailed the foregoing appears in text, the invention can be practiced in many ways. As is also stated above, it should be noted that the use of particular terminology when describing certain features or aspects of the invention should not be taken to imply that the terminology is being re-defined herein to be restricted to including any specific characteristics of the features or aspects of the invention with which that terminology is associated. The scope of the invention should therefore be construed in accordance with the appended claims and any equivalents thereof.
Engines, Components, and Logic
Certain embodiments are described herein as including logic or a number of components, engines, or mechanisms. Engines may constitute either software engines (e.g., code embodied on a machine-readable medium) or hardware engines. A “hardware engine” is a tangible unit capable of performing certain operations and may be configured or arranged in a certain physical manner. In various example embodiments, one or more computer systems (e.g., a standalone computer system, a client computer system, or a server computer system) or one or more hardware engines of a computer system (e.g., a processor or a group of processors) may be configured by software (e.g., an application or application portion) as a hardware engine that operates to perform certain operations as described herein.
In some embodiments, a hardware engine may be implemented mechanically, electronically, or any suitable combination thereof. For example, a hardware engine may include dedicated circuitry or logic that is permanently configured to perform certain operations. For example, a hardware engine may be a special-purpose processor, such as a Field-Programmable Gate Array (FPGA) or an Application Specific Integrated Circuit (ASIC). A hardware engine may also include programmable logic or circuitry that is temporarily configured by software to perform certain operations. For example, a hardware engine may include software executed by a general-purpose processor or other programmable processor. Once configured by such software, hardware engines become specific machines (or specific components of a machine) uniquely tailored to perform the configured functions and are no longer general-purpose processors. It will be appreciated that the decision to implement a hardware engine mechanically, in dedicated and permanently configured circuitry, or in temporarily configured circuitry (e.g., configured by software) may be driven by cost and time considerations.
Accordingly, the phrase “hardware engine” should be understood to encompass a tangible entity, be that an entity that is physically constructed, permanently configured (e.g., hardwired), or temporarily configured (e.g., programmed) to operate in a certain manner or to perform certain operations described herein. As used herein, “hardware-implemented engine” refers to a hardware engine. Considering embodiments in which hardware engines are temporarily configured (e.g., programmed), each of the hardware engines need not be configured or instantiated at any one instance in time. For example, where a hardware engine comprises a general-purpose processor configured by software to become a special-purpose processor, the general-purpose processor may be configured as respectively different special-purpose processors (e.g., comprising different hardware engines) at different times. Software accordingly configures a particular processor or processors, for example, to constitute a particular hardware engine at one instance of time and to constitute a different hardware engine at a different instance of time.
Hardware engines can provide information to, and receive information from, other hardware engines. Accordingly, the described hardware engines may be regarded as being communicatively coupled. Where multiple hardware engines exist contemporaneously, communications may be achieved through signal transmission (e.g., over appropriate circuits and buses) between or among two or more of the hardware engines. In embodiments in which multiple hardware engines are configured or instantiated at different times, communications between such hardware engines may be achieved, for example, through the storage and retrieval of information in memory structures to which the multiple hardware engines have access. For example, one hardware engine may perform an operation and store the output of that operation in a memory device to which it is communicatively coupled. A further hardware engine may then, at a later time, access the memory device to retrieve and process the stored output. Hardware engines may also initiate communications with input or output devices, and can operate on a resource (e.g., a collection of information).
The various operations of example methods described herein may be performed, at least partially, by one or more processors that are temporarily configured (e.g., by software) or permanently configured to perform the relevant operations. Whether temporarily or permanently configured, such processors may constitute processor-implemented engines that operate to perform one or more operations or functions described herein. As used herein, “processor-implemented engine” refers to a hardware engine implemented using one or more processors.
Similarly, the methods described herein may be at least partially processor-implemented, with a particular processor or processors being an example of hardware. For example, at least some of the operations of a method may be performed by one or more processors or processor-implemented engines. Moreover, the one or more processors may also operate to support performance of the relevant operations in a “cloud computing” environment or as a “software as a service” (SaaS). For example, at least some of the operations may be performed by a group of computers (as examples of machines including processors), with these operations being accessible via a network (e.g., the Internet) and via one or more appropriate interfaces (e.g., an Application Program Interface (API)).
The performance of certain of the operations may be distributed among the processors, not only residing within a single machine, but deployed across a number of machines. In some example embodiments, the processors or processor-implemented engines may be located in a single geographic location (e.g., within a home environment, an office environment, or a server farm). In other example embodiments, the processors or processor-implemented engines may be distributed across a number of geographic locations.
Language
Throughout this specification, plural instances may implement components, operations, or structures described as a single instance. Although individual operations of one or more methods are illustrated and described as separate operations, one or more of the individual operations may be performed concurrently, and nothing requires that the operations be performed in the order illustrated. Structures and functionality presented as separate components in example configurations may be implemented as a combined structure or component. Similarly, structures and functionality presented as a single component may be implemented as separate components. These and other variations, modifications, additions, and improvements fall within the scope of the subject matter herein.
Although an overview of the subject matter has been described with reference to specific example embodiments, various modifications and changes may be made to these embodiments without departing from the broader scope of embodiments of the present disclosure. Such embodiments of the subject matter may be referred to herein, individually or collectively, by the term “invention” merely for convenience and without intending to voluntarily limit the scope of this application to any single disclosure or concept if more than one is, in fact, disclosed.
The embodiments illustrated herein are described in sufficient detail to enable those skilled in the art to practice the teachings disclosed. Other embodiments may be used and derived therefrom, such that structural and logical substitutions and changes may be made without departing from the scope of this disclosure. The Detailed Description, therefore, is not to be taken in a limiting sense, and the scope of various embodiments is defined only by the appended claims, along with the full range of equivalents to which such claims are entitled.
It will be appreciated that an “engine,” “system,” “data store,” and/or “database” may comprise software, hardware, firmware, and/or circuitry. In one example, one or more software programs comprising instructions capable of being executable by a processor may perform one or more of the functions of the engines, data stores, databases, or systems described herein. In another example, circuitry may perform the same or similar functions. Alternative embodiments may comprise more, less, or functionally equivalent engines, systems, data stores, or databases, and still be within the scope of present embodiments. For example, the functionality of the various systems, engines, data stores, and/or databases may be combined or divided differently.
“Open source” software is defined herein to be source code that allows distribution as source code as well as compiled form, with a well-publicized and indexed means of obtaining the source, optionally with a license that allows modifications and derived works.
The data stores described herein may be any suitable structure (e.g., an active database, a relational database, a self-referential database, a table, a matrix, an array, a flat file, a documented-oriented storage system, a non-relational No-SQL system, and the like), and may be cloud-based or otherwise.
As used herein, the term “or” may be construed in either an inclusive or exclusive sense. Moreover, plural instances may be provided for resources, operations, or structures described herein as a single instance. Additionally, boundaries between various resources, operations, engines, engines, and data stores are somewhat arbitrary, and particular operations are illustrated in a context of specific illustrative configurations. Other allocations of functionality are envisioned and may fall within a scope of various embodiments of the present disclosure. In general, structures and functionality presented as separate resources in the example configurations may be implemented as a combined structure or resource. Similarly, structures and functionality presented as a single resource may be implemented as separate resources. These and other variations, modifications, additions, and improvements fall within a scope of embodiments of the present disclosure as represented by the appended claims. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment.
Although the invention has been described in detail for the purpose of illustration based on what is currently considered to be the most practical and preferred implementations, it is to be understood that such detail is solely for that purpose and that the invention is not limited to the disclosed implementations, but, on the contrary, is intended to cover modifications and equivalent arrangements that are within the spirit and scope of the appended claims. For example, it is to be understood that the present invention contemplates that, to the extent possible, one or more features of any embodiment can be combined with one or more features of any other embodiment.
Other implementations, uses and advantages of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. The specification should be considered exemplary only, and the scope of the invention is accordingly intended to be limited only by the following claims.
This application is a continuation of U.S. application Ser. No. 16/806,250, filed Mar. 2, 2020, which is a continuation of U.S. application Ser. No. 15/676,509, filed Aug. 14, 2017, which claims the benefit under 35 U.S.C. § 119(e) of the U.S. Provisional Application Ser. No. 62/475,695, filed Mar. 23, 2017, the contents of each of which are hereby incorporated by reference in their entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4899161 | Morin, Jr. et al. | Feb 1990 | A |
| 4958305 | Piazza | Sep 1990 | A |
| 5329108 | Lamoure | Jul 1994 | A |
| 5754182 | Kobayashi | May 1998 | A |
| 5781195 | Marvin | Jul 1998 | A |
| 5781704 | Rossmo | Jul 1998 | A |
| 6091956 | Hollenberg | Jul 2000 | A |
| 6157747 | Szeliski et al. | Dec 2000 | A |
| 6169552 | Endo et al. | Jan 2001 | B1 |
| 6173067 | Payton et al. | Jan 2001 | B1 |
| 6178432 | Cook et al. | Jan 2001 | B1 |
| 6247019 | Davies | Jun 2001 | B1 |
| 6389289 | Voce et al. | May 2002 | B1 |
| 6414683 | Gueziec | Jul 2002 | B1 |
| 6483509 | Rabenhorst | Nov 2002 | B1 |
| 6529900 | Patterson et al. | Mar 2003 | B1 |
| 6631496 | Li et al. | Oct 2003 | B1 |
| 6642925 | Roy et al. | Nov 2003 | B2 |
| 6662103 | Skolnick et al. | Dec 2003 | B1 |
| 6757445 | Knopp | Jun 2004 | B1 |
| 6828920 | Owen et al. | Dec 2004 | B2 |
| 6904588 | Reddy et al. | Jun 2005 | B2 |
| 6958753 | Abe | Oct 2005 | B2 |
| 6983203 | Wako | Jan 2006 | B1 |
| 6985950 | Hanson et al. | Jan 2006 | B1 |
| 7036085 | Barros | Apr 2006 | B2 |
| 7051291 | Sciammarella et al. | May 2006 | B2 |
| 7158878 | Rasmussen et al. | Jan 2007 | B2 |
| 7375732 | Aguera Y Arcas | May 2008 | B2 |
| 7379811 | Rasmussen et al. | May 2008 | B2 |
| 7457706 | Melero et al. | Nov 2008 | B2 |
| 7502786 | Liu et al. | Mar 2009 | B2 |
| 7519470 | Brasche et al. | Apr 2009 | B2 |
| 7529195 | Gorman | May 2009 | B2 |
| 7539666 | Ashworth et al. | May 2009 | B2 |
| 7558677 | Jones | Jul 2009 | B2 |
| 7574428 | Leiserowitz et al. | Aug 2009 | B2 |
| 7579965 | Bucholz | Aug 2009 | B2 |
| 7617314 | Bansod et al. | Nov 2009 | B1 |
| 7620628 | Kapur et al. | Nov 2009 | B2 |
| 7663621 | Allen et al. | Feb 2010 | B1 |
| 7791616 | Toup et al. | Sep 2010 | B2 |
| 7805457 | Viola et al. | Sep 2010 | B1 |
| 7809703 | Balabhadrapatruni et al. | Oct 2010 | B2 |
| 7836028 | Agarwal et al. | Nov 2010 | B1 |
| 7872647 | Mayer et al. | Jan 2011 | B2 |
| 7894984 | Rasmussen et al. | Feb 2011 | B2 |
| 7899611 | Downs et al. | Mar 2011 | B2 |
| 7920963 | Jouline et al. | Apr 2011 | B2 |
| 7945852 | Pilskalns | May 2011 | B1 |
| 7962281 | Rasmussen et al. | Jun 2011 | B2 |
| 7970240 | Chao et al. | Jun 2011 | B1 |
| 8010545 | Stefik et al. | Aug 2011 | B2 |
| 8036632 | Cona et al. | Oct 2011 | B1 |
| 8065080 | Koch | Nov 2011 | B2 |
| 8085268 | Carrino et al. | Dec 2011 | B2 |
| 8108790 | Morrison, Jr. et al. | Jan 2012 | B2 |
| 8134457 | Velipasalar et al. | Mar 2012 | B2 |
| 8145703 | Frishert et al. | Mar 2012 | B2 |
| 8200676 | Frank | Jun 2012 | B2 |
| 8214361 | Sandler et al. | Jul 2012 | B1 |
| 8214764 | Gemmell et al. | Jul 2012 | B2 |
| 8229947 | Fujinaga | Jul 2012 | B2 |
| 8230333 | Decherd et al. | Jul 2012 | B2 |
| 8290942 | Jones et al. | Oct 2012 | B2 |
| 8290943 | Carbone et al. | Oct 2012 | B2 |
| 8301464 | Cave et al. | Oct 2012 | B1 |
| 8325178 | Doyle, Jr. | Dec 2012 | B1 |
| 8368695 | Howell et al. | Feb 2013 | B2 |
| 8397171 | Klassen et al. | Mar 2013 | B2 |
| 8400448 | Doyle, Jr. | Mar 2013 | B1 |
| 8407180 | Ramesh et al. | Mar 2013 | B1 |
| 8412234 | Gatmir-Motahari et al. | Apr 2013 | B1 |
| 8412707 | Mianji | Apr 2013 | B1 |
| 8422825 | Neophytou et al. | Apr 2013 | B1 |
| 8452790 | Mianji | May 2013 | B1 |
| 8463036 | Ramesh et al. | Jun 2013 | B1 |
| 8489331 | Kopf et al. | Jul 2013 | B2 |
| 8489641 | Seefeld et al. | Jul 2013 | B1 |
| 8498984 | Hwang et al. | Jul 2013 | B1 |
| 8508533 | Cervelli et al. | Aug 2013 | B2 |
| 8514229 | Cervelli et al. | Aug 2013 | B2 |
| 8515207 | Chau | Aug 2013 | B2 |
| 8564596 | Carrino et al. | Oct 2013 | B2 |
| 8742934 | Sarpy, Sr. et al. | Jun 2014 | B1 |
| 8781169 | Jackson et al. | Jul 2014 | B2 |
| 8799799 | Cervelli et al. | Aug 2014 | B1 |
| 8830322 | Nerayoff et al. | Sep 2014 | B2 |
| 8938686 | Erenrich et al. | Jan 2015 | B1 |
| 8949164 | Mohler | Feb 2015 | B1 |
| 8983494 | Onnen et al. | Mar 2015 | B1 |
| 9009177 | Zheng et al. | Apr 2015 | B2 |
| 9021384 | Beard et al. | Apr 2015 | B1 |
| 9104293 | Kornfeld et al. | Aug 2015 | B1 |
| 9104695 | Cervelli et al. | Aug 2015 | B1 |
| 9111380 | Piemonte et al. | Aug 2015 | B2 |
| 9129219 | Robertson et al. | Sep 2015 | B1 |
| 9146125 | Vulcano et al. | Sep 2015 | B2 |
| 9280618 | Bruce et al. | Mar 2016 | B1 |
| 9600146 | Cervelli et al. | Mar 2017 | B2 |
| 9996229 | Erenrich et al. | Jun 2018 | B2 |
| 10387002 | Spirer | Aug 2019 | B2 |
| 10579239 | Wilczynski | Mar 2020 | B1 |
| 11054975 | Wilczynski | Jul 2021 | B2 |
| 20020116120 | Ruiz et al. | Aug 2002 | A1 |
| 20020130867 | Yang et al. | Sep 2002 | A1 |
| 20020130906 | Miyaki | Sep 2002 | A1 |
| 20030052896 | Higgins et al. | Mar 2003 | A1 |
| 20030103049 | Kindratenko et al. | Jun 2003 | A1 |
| 20030144868 | MacIntyre et al. | Jul 2003 | A1 |
| 20030163352 | Surpin et al. | Aug 2003 | A1 |
| 20030225755 | Iwayama et al. | Dec 2003 | A1 |
| 20040030492 | Fox et al. | Feb 2004 | A1 |
| 20040039498 | Ollis et al. | Feb 2004 | A1 |
| 20040098236 | Mayer et al. | May 2004 | A1 |
| 20050031197 | Knopp | Feb 2005 | A1 |
| 20050034062 | Bufkin et al. | Feb 2005 | A1 |
| 20050080769 | Gemmell et al. | Apr 2005 | A1 |
| 20050143602 | Yada et al. | Jun 2005 | A1 |
| 20050162523 | Darrell et al. | Jul 2005 | A1 |
| 20050182502 | Iyengar | Aug 2005 | A1 |
| 20050182793 | Keenan et al. | Aug 2005 | A1 |
| 20050223044 | Ashworth et al. | Oct 2005 | A1 |
| 20050267652 | Allstadt et al. | Dec 2005 | A1 |
| 20060005163 | Huesken et al. | Jan 2006 | A1 |
| 20060015499 | Clissold | Jan 2006 | A1 |
| 20060026170 | Kreitler et al. | Feb 2006 | A1 |
| 20060139375 | Rasmussen et al. | Jun 2006 | A1 |
| 20060146050 | Yamauchi | Jul 2006 | A1 |
| 20060149596 | Surpin et al. | Jul 2006 | A1 |
| 20060200384 | Arutunian et al. | Sep 2006 | A1 |
| 20060251307 | Florin et al. | Nov 2006 | A1 |
| 20060259527 | Devarakonda et al. | Nov 2006 | A1 |
| 20060271277 | Hu et al. | Nov 2006 | A1 |
| 20060279630 | Aggarwal et al. | Dec 2006 | A1 |
| 20070011150 | Frank | Jan 2007 | A1 |
| 20070016363 | Huang et al. | Jan 2007 | A1 |
| 20070024620 | Muller-Fischer et al. | Feb 2007 | A1 |
| 20070057966 | Ohno et al. | Mar 2007 | A1 |
| 20070078832 | Ott et al. | Apr 2007 | A1 |
| 20070115373 | Gallagher et al. | May 2007 | A1 |
| 20070124373 | Chatterjee et al. | May 2007 | A1 |
| 20070188516 | Ioup et al. | Aug 2007 | A1 |
| 20070208497 | Downs et al. | Sep 2007 | A1 |
| 20070208498 | Barker et al. | Sep 2007 | A1 |
| 20070258642 | Thota | Nov 2007 | A1 |
| 20070294643 | Kyle | Dec 2007 | A1 |
| 20080010605 | Frank | Jan 2008 | A1 |
| 20080040684 | Crump | Feb 2008 | A1 |
| 20080077642 | Carbone et al. | Mar 2008 | A1 |
| 20080082578 | Hogue et al. | Apr 2008 | A1 |
| 20080098085 | Krane et al. | Apr 2008 | A1 |
| 20080104019 | Nath | May 2008 | A1 |
| 20080133579 | Lim | Jun 2008 | A1 |
| 20080163073 | Becker et al. | Jul 2008 | A1 |
| 20080189678 | Joo et al. | Aug 2008 | A1 |
| 20080192053 | Howell et al. | Aug 2008 | A1 |
| 20080195417 | Surpin et al. | Aug 2008 | A1 |
| 20080223834 | Griffiths et al. | Sep 2008 | A1 |
| 20080229056 | Agarwal et al. | Sep 2008 | A1 |
| 20080263468 | Cappione et al. | Oct 2008 | A1 |
| 20080267107 | Rosenberg | Oct 2008 | A1 |
| 20080270468 | Mao et al. | Oct 2008 | A1 |
| 20080278311 | Grange et al. | Nov 2008 | A1 |
| 20080288306 | MacIntyre et al. | Nov 2008 | A1 |
| 20080294678 | Gorman et al. | Nov 2008 | A1 |
| 20080301643 | Appleton et al. | Dec 2008 | A1 |
| 20090019426 | Baueumer et al. | Jan 2009 | A1 |
| 20090027418 | Maru et al. | Jan 2009 | A1 |
| 20090088964 | Schaaf et al. | Apr 2009 | A1 |
| 20090100018 | Roberts | Apr 2009 | A1 |
| 20090115786 | Shimasaki et al. | May 2009 | A1 |
| 20090132921 | Hwangbo et al. | May 2009 | A1 |
| 20090132953 | Reed, Jr. et al. | May 2009 | A1 |
| 20090144262 | White et al. | Jun 2009 | A1 |
| 20090158185 | Lacevic et al. | Jun 2009 | A1 |
| 20090171939 | Athsani et al. | Jul 2009 | A1 |
| 20090172511 | Decherd et al. | Jul 2009 | A1 |
| 20090179892 | Tsuda et al. | Jul 2009 | A1 |
| 20090187447 | Cheng et al. | Jul 2009 | A1 |
| 20090187464 | Bai et al. | Jul 2009 | A1 |
| 20090222400 | Kupershmidt et al. | Sep 2009 | A1 |
| 20090292626 | Oxford | Nov 2009 | A1 |
| 20100057716 | Stefik et al. | Mar 2010 | A1 |
| 20100063961 | Guiheneuf et al. | Mar 2010 | A1 |
| 20100070523 | Delgo et al. | Mar 2010 | A1 |
| 20100076968 | Boyns et al. | Mar 2010 | A1 |
| 20100106420 | Mattikalli et al. | Apr 2010 | A1 |
| 20100162176 | Dunton | Jun 2010 | A1 |
| 20100185692 | Zhang et al. | Jul 2010 | A1 |
| 20100198684 | Eraker et al. | Aug 2010 | A1 |
| 20100199225 | Coleman et al. | Aug 2010 | A1 |
| 20100217784 | Carter | Aug 2010 | A1 |
| 20100277611 | Holt et al. | Nov 2010 | A1 |
| 20100293174 | Bennett et al. | Nov 2010 | A1 |
| 20100321399 | Ellren et al. | Dec 2010 | A1 |
| 20110022312 | McDonough et al. | Jan 2011 | A1 |
| 20110090254 | Carrino et al. | Apr 2011 | A1 |
| 20110117878 | Barash et al. | May 2011 | A1 |
| 20110137766 | Rasmussen et al. | Jun 2011 | A1 |
| 20110153368 | Pierre et al. | Jun 2011 | A1 |
| 20110161096 | Buehler et al. | Jun 2011 | A1 |
| 20110170799 | Carrino et al. | Jul 2011 | A1 |
| 20110208724 | Jones et al. | Aug 2011 | A1 |
| 20110218934 | Elser | Sep 2011 | A1 |
| 20110225198 | Edwards et al. | Sep 2011 | A1 |
| 20110238690 | Arrasvuori et al. | Sep 2011 | A1 |
| 20110270705 | Parker | Nov 2011 | A1 |
| 20120066296 | Appleton et al. | Mar 2012 | A1 |
| 20120084118 | Bai et al. | Apr 2012 | A1 |
| 20120106801 | Jackson | May 2012 | A1 |
| 20120144335 | Abeln et al. | Jun 2012 | A1 |
| 20120158527 | Cannelongo et al. | Jun 2012 | A1 |
| 20120159363 | DeBacker et al. | Jun 2012 | A1 |
| 20120173985 | Peppel | Jul 2012 | A1 |
| 20120206469 | Hulubei et al. | Aug 2012 | A1 |
| 20120208636 | Feige | Aug 2012 | A1 |
| 20120221580 | Barney | Aug 2012 | A1 |
| 20120323888 | Osann, Jr. | Dec 2012 | A1 |
| 20130006725 | Simanek et al. | Jan 2013 | A1 |
| 20130021445 | Cossette-Pacheco et al. | Jan 2013 | A1 |
| 20130057551 | Ebert et al. | Mar 2013 | A1 |
| 20130060786 | Serrano et al. | Mar 2013 | A1 |
| 20130073377 | Heath | Mar 2013 | A1 |
| 20130076732 | Cervelli et al. | Mar 2013 | A1 |
| 20130100134 | Cervelli et al. | Apr 2013 | A1 |
| 20130101159 | Chao et al. | Apr 2013 | A1 |
| 20130132389 | Majidian | May 2013 | A1 |
| 20130132398 | Pfeifle | May 2013 | A1 |
| 20130150004 | Rosen | Jun 2013 | A1 |
| 20130176321 | Mitchell et al. | Jul 2013 | A1 |
| 20130179420 | Park et al. | Jul 2013 | A1 |
| 20130254900 | Sathish et al. | Sep 2013 | A1 |
| 20130268520 | Fisher et al. | Oct 2013 | A1 |
| 20130279757 | Kephart | Oct 2013 | A1 |
| 20130282723 | Petersen et al. | Oct 2013 | A1 |
| 20130339891 | Blumenberg et al. | Dec 2013 | A1 |
| 20140176606 | Narayan et al. | Jun 2014 | A1 |
| 20140210839 | Castelli | Jul 2014 | A1 |
| 20140218400 | O'Toole et al. | Aug 2014 | A1 |
| 20140282013 | Amijee | Sep 2014 | A1 |
| 20140333651 | Cervelli et al. | Nov 2014 | A1 |
| 20140337772 | Cervelli et al. | Nov 2014 | A1 |
| 20140361899 | Layson | Dec 2014 | A1 |
| 20150029176 | Baxter et al. | Jan 2015 | A1 |
| 20150100907 | Erenrich et al. | Apr 2015 | A1 |
| 20150106170 | Bonica | Apr 2015 | A1 |
| 20150177964 | Spirer | Jun 2015 | A1 |
| 20150186821 | Wang et al. | Jul 2015 | A1 |
| 20150187036 | Wang et al. | Jul 2015 | A1 |
| 20150187100 | Berry et al. | Jul 2015 | A1 |
| 20150281250 | Miller | Oct 2015 | A1 |
| 20150312323 | Peterson | Oct 2015 | A1 |
| 20150338233 | Cervelli et al. | Nov 2015 | A1 |
| 20150379413 | Robertson et al. | Dec 2015 | A1 |
| 20170052654 | Cervelli et al. | Feb 2017 | A1 |
| 20170052655 | Cervelli et al. | Feb 2017 | A1 |
| 20170206684 | Duncker | Jul 2017 | A1 |
| 20170220232 | Gilmore | Aug 2017 | A1 |
| 20190179916 | Sivaji | Jun 2019 | A1 |
| 20200201524 | Wilczynski | Jun 2020 | A1 |
| Number | Date | Country |
|---|---|---|
| 2012216622 | Apr 2013 | AU |
| 102013222023 | Jan 2015 | DE |
| 0763201 | Mar 1997 | EP |
| 2575107 | Apr 2013 | EP |
| 2858014 | Apr 2015 | EP |
| 2963595 | Jan 2016 | EP |
| 2516155 | Jan 2015 | GB |
| 2012778 | Nov 2014 | NL |
| 624557 | Aug 2014 | NZ |
| 9532424 | Nov 1995 | WO |
| 0009529 | Feb 2000 | WO |
| 0198925 | Dec 2001 | WO |
| 2004057268 | Jul 2004 | WO |
| 2005013200 | Feb 2005 | WO |
| 2008064207 | May 2008 | WO |
| 2009061501 | May 2009 | WO |
| 2009123975 | Oct 2009 | WO |
| 2011058507 | May 2011 | WO |
| Entry |
|---|
| “A First Look: Predicting Market Demand for Food Retail using a Huff Analysis,” TRF Policy Solutions, Jul. 2012, pp. 30. |
| “Andy Turner's GISRUK 2012 Notes” <https://docs.google.com/document/d/1cTmxg7mVx5gd89IqblCYvCEnHA4QAivH4- I4WpyPsqE4/edit?pli=1> printed Sep. 16, 2013 in 15 pages. |
| “HunchLab: Heat Map and Kernel Density Calculation for Crime Analysis,” Azavea Journal, printed from www.azavea.com/blogs/newsletter/v4i4/kernel-density-capabilities-added-to- -hunchlab/ on Sep. 9, 2014, 2 pages. |
| Barnes et al., “Viewshed Analysis”, GIS-ARC/INFO 2001, <www.evsc.virginia.edu/.about.jhp7e/evsc466/student_pres/Rounds.pdf>- ;. |
| Carver et al., “Real-Time Visibility Analysis and Rapid Viewshed Calculation Using a Voxel-Based Modelling Approach,” GISRUK 2012 Conference, Apr. 11-13, Lancaster UK, Apr. 13, 2012, pp. 6. |
| Chen et al., “Bringing Order to the Web: Automatically Categorizing Search Results,” CHI 2000, Proceedings of the SIGCHI conference on Human Factors in Computing Systems, Apr. 1-6, 2000, The Hague, The Netherlands, pp. 145-152. |
| Chen et al., “iVIBRATE: Interactive Visualization-Based Framework for Clustering Large Datasets,” ACM Transaction on Information Systems, vol. 24, No. 2, Apr. 2006, pp. 245-294. |
| Correa et al., “SPVN: A New Application Framework for Interactive Visualization of Large Datasets,” SIGGRAPH 2007, San Diego, California, Aug. 5-9, 2007, No. 12, 6 pages. |
| Definition “Identify”, downloaded Jan. 22, 2015, 1 page. |
| Definition “Overlay”, downloaded Jan. 22, 2015, 1 page. |
| Dramowicz, Ela, “Retail Trade Area Analysis Using the Huff Model,” Directions Magazine, Jul. 2, 2005 in 10 pages, http://www.directionsmag.com/articles/retail-trade-area-analysis-using-th- e-huff-model/123411. |
| Eick, Stephen G., “Visual Discovery and Analysis,” IEEE Transactions on Visualization and Computer Graphics, vol. 6, No. 1, Jan.-Mar. 2000, pp. 44-58. |
| Ghosh, P., “A Solution of Polygon Containment, Spatial Planning, and Other Related Problems Using Minkowski Operations,” Computer Vision, Graphics, and Image Processing, 1990, vol. 49, pp. 1-35. |
| GIS-NET 3 Public _ Department of Regional Planning. Planning & Zoning Information for Unincorporated LA County. Retrieved Oct. 2, 2013 from http://gis.planning.lacounty.gov/GIS-NET3_Public/Viewer.html. |
| Gorr et al., “Crime Hot Spot Forecasting: Modeling and Comparative Evaluation”, Grant 98-IJ-CX-K005, May 6, 2002, 37 pages. |
| Griffith, Daniel A., “A Generalized Huff Model,” Geographical Analysis, Apr. 1982, vol. 14, No. 2, pp. 135-144. |
| Haralick et al., “Image Analysis Using Mathematical Morphology,” Pattern Analysis and Machine Intelligence, IEEE Transactions, Jul. 1987, vol. PAMI-9, No. 4, pp. 532-550. |
| Hibbert et al., “Prediction of Shopping Behavior Using a Huff Model Within a GIS Framework,” Healthy Eating in Context, Mar. 18, 2011, pp. 16. |
| Huang et al., “Systematic and Integrative Analysis of Large Gene Lists Using DAVID Bioinformatics Resources,” Nature Protocols, 4.1, 2008, 44-57. |
| Huff et al., “Calibrating the Huff Model Using ArcGIS Business Analyst,” ESRI, Sep. 2008, pp. 33. |
| Huff, David L., “Parameter Estimation in the Huff Model,” ESRI, ArcUser, Oct.-Dec. 2003, pp. 34-36. |
| Ipbucker, C., “Inverse Transformation for Several Pseudo-cylindrical Map Projections Using Jacobian Matrix,” ICCSA 2009, Part 1 LNCS 5592, pp. 553-564. |
| Jomier et al., “Remote Visualization of Large Datesets with MIDAS and ParaViewWeb,” Web3D '11, Paris, France, Jun. 20-22, 2011, pp. 147-150. |
| Levine, N., “Crime Mapping and the Crimestat Program,” Geographical Analysis, 2006, vol. 38, pp. 41-56. |
| Liu, Tianshun, “Combining GIS and the Huff Model to Analyze Suitable Locations for a New Asian Supermarket in the Minneapolis and St. Paul, Minnesota USA,” Papers in Resource Analysis, 2012, vol. 14, pp. 8. |
| Mandagere, Nagapramod, “Buffer Operations in GIS,” <http://www-users.cs.umn.edu/.about.npramod/enc_pdf.pdf> retrieved Jan. 28, 2010, pp. 7. |
| Map Builder, “Rapid Mashup Development Tool for Google and Yahoo Maps!” <http://web.archive.org/web/20090626224734/http://www.mapbuilder.net/&- gt; printed Jul. 20, 2012 in 2 pages. |
| Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.bing.com. |
| Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.google.com. |
| Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.yahoo.com. |
| Murray, C., Oracle Spatial Developer's Guide—6 Coordinate Systems (Spatial Reference Systems), <http://docs.oracle.com/cd/B28359_01/appdev.111/b28400.pdf>, Jun. 2009. |
| Open Street Map, “Amm's Diary:Unconnected ways and other data quality issues,” http://www.openstreetmap.org/user/amm/diary printed Jul. 23, 2012 in 3 pages. |
| POI Editor, “How to: Create Your Own Points of Interest,” <http://www.poieditor.com/articles/how_tocreate_your_own_points_of_interest/> printed Jul. 22, 2012 in 4 pages. |
| Pozzi et al., “Vegetation and Population Density in Urban and Suburban Areas in the U.S.A.” Third International Symposium of Remote Sensing of Urban Areas Istanbul, Turkey, Jun. 2002, pp. 8. |
| Qiu, Fang, “3d Analysis and Surface Modeling”, <http://web.archive.org/web/20091202221925/http://www.utsa.edu/Irsg/Te- aching/EES6513/08-3D.pdf> printed Sep. 16, 2013 in 26 pages. |
| Reddy et al., “Under the hood of GeoVRML 1.0,” SRI International, Proceedings of the fifth symposium on Vurtual Reality Modeling Language (Web3D-VRML), New York, NY, Feb. 2000, pp. 23-28.<http://pdf.aminer.org/000/648/038/under_the_hood_of_geovrml.pdf>. |
| Reibel et al., “Areal Interpolation of Population Counts Using Pre-classi_ed Land Cover Data,” Population Research and Policy Review, 2007, vol. 26, pp. 619-633. |
| Reibel, M., “Geographic Information Systems and Spatial Data Processing in Demography: a Review,” Population Research and Policy Review, 2007, vol. 26, pp. 601-618. |
| Rizzardi et al., “Interfacing U.S. Census Map Files with Statistical Graphics Software: Application and Use in Epidemiology,” Statistics in Medicine, Oct. 1993, vol. 12, No. 19-20, pp. 1953-1964. |
| Snyder, “Map Projections—A Working Manual,” U.S. Geological Survey Professional paper 1395, United States Government Printing Office, Washington: 1987, pp. 11-21 and 60-70. |
| Sonris, “Using the Area of Interest Tools,” <http://web.archive.org/web/20061001053327/http://sonris-www.dnr.state- .la.us/gis/instruct_files/tutslide12> printed Jan. 3, 2013 in 1 page. |
| Tangelder et al., “Freeform Shape Matching Using Minkowski Operations,” The Netherlands, Jun. 1996, pp. 12. |
| Thompson, Mick, “Getting Started with GEO,” Getting Started with GEO, Jul. 26, 2011. |
| Valentini et al., “Ensembles of Learning Machines”, M. Marinara and R. Tagliaferri (Eds.): WIRN VIETRI 2002, LNCS 2486, pp. 3-20. |
| VB Forums, “Buffers Polygon,” Internet Citation, <http://www.vbforums.com/showthread.php?198436-Buffer-a-Polygon>, Specifically Thread #1, #5 & #11 retrieved on May 2, 2013, pp. 8. |
| Vivid Solutions, “JTS Topology Suite: Technical Specifications,” <http://www.vividsolutions.com/jts/bin/JTS%20Technical%20Specs.pdf> Version 1.4, 2003, pp. 36. |
| Wikipedia, “Douglas_Peucker-Algorithms,” <http://de.wikipedia.org/w/index.php?title=Douglas-Peucker-Algorithmus-&oldid=91846042> printed Jul. 2011, pp. 2. |
| Wikipedia, “Ramer_Douglas_Peucker Algorithm,” <http://en.wikipedia.org/wiki/Ramer%E2%80%93Douglas%E2%80%93Peucker_al- gorithm> printed Jul. 2011, pp. 3. |
| Wongsuphasawat et al., “Visual Analytics for Transportation Incident Data Sets,” Transportation Research Record 2138, 2009, pp. 135-145. |
| Woodbridge, Stephen, “[geos-devel] Polygon simplification,” <http://lists.osgeo.org/pipermail/geos-devel/2011-May/005210.html> dated May 8, 2011, pp. 3. |
| Number | Date | Country | |
|---|---|---|---|
| 20210333985 A1 | Oct 2021 | US |
| Number | Date | Country | |
|---|---|---|---|
| 62475695 | Mar 2017 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 16806250 | Mar 2020 | US |
| Child | 17367211 | US | |
| Parent | 15676509 | Aug 2017 | US |
| Child | 16806250 | US |
