Search

Darin J Beesley

from Overland Park, KS
Age ~63
Get Report
Also known as:
Darin Beese, Darin Y
Phone and address:
9211 112Th St, Overland Park, KS 66210
(913) 498-8559
Related to:
Ann R Lee, 66Karl L Lee, 66Kari J Beesley, 62Jennifer BeesleyAdam B Hawkins, 32Jennifer C Hawkins, 32Lauren Beesley, 34James Beesley
Connected to:
Aaron Beesley, 70Adrian J Beesley, 57Benjamin L Beesley, 41Bill Beesley, 42Bradford K Beesley, 76Brooke E Beesley, 44Caitlyn D Beesley, 31Charlie Beesley, 30Christa M Beesley, 46Christine W Beesley, 80

Darin Beesley Phones & Addresses

  • 9211 112Th St, Overland Park, KS 66210 (913) 498-8559
  • 9211 W 112Th Ter, Overland Park, KS 66210 (913) 498-8559
  • 9711 112Th St, Overland Park, KS 66210 (913) 498-8559
  • Garden City, KS
  • Dighton, KS
  • Olathe, KS
  • 9211 112Th St, Shawnee Mission, KS 66210 (913) 498-8559
  • Kansas City, MO
  • Gove, KS
  • Kansas City, KS

Publications

Us Patents

Method And Apparatus For Backtracking A Path

View page
US Patent:
6459987, Oct 1, 2002
Filed:
Nov 15, 1996
Appl. No.:
08/751125
Inventors:
Jay Dee Krull - Olathe KS
Darin J. Beesley - Kansas City MO
Assignee:
Garmin Corporation
International Classification:
G06G 778
US Classification:
701213, 701200, 701201, 701207, 701205
Abstract:
A method for automatically generating a point-reduced backtrack route is provided, using the aid of Global Positioning System technology. The method begins by recording a potentially very large series of data points using GPS technology and a user-selected point recording algorithm into a forward-track route. A point-reducing algorithm is then used to reduce the forward track to a backtrack route which preserves the topological essence of the original route, but with far fewer data points. This reduced backtrack route is then suitable for storage in a memory constrained device, and is suitable for backtrack navigation without the need for the large set of original route points. Storage of a number of such backtrack routes is thus made available to the end user.

System And Method For Calculating A Navigation Route Based On Adjacent Cartographic Map Databases

View page
US Patent:
6574553, Jun 3, 2003
Filed:
Oct 11, 2001
Appl. No.:
10/015148
Inventors:
Darin J. Beesley - Overland Park KS
Michael Childs - Olathe KS
Assignee:
Garmin Ltd.
International Classification:
G01C 2130
US Classification:
701209, 701 23, 701201, 701208, 701212, 340990
Abstract:
A method and apparatus are provided for calculating potential paths through a roadway network defined at least partially by separate, but adjacent data maps. First and second data maps are provided that are indicative of roadway networks for different geographic regions bounded by region edges, at least one of which is common to both geographic regions. The data maps are adjacent, and one data map contains the first location while the other data map contains a roadway segment over which the potential paths may travel. Potential paths are planned from the first location through the first data map. When a current potential path intersects an edge of the first data map, the intersection is identified by coordinate data. A transition point is located in an adjacent data map based on the location where the current potential path intersects the edge of the first data map. The calculation method and apparatus continue from the transition point through the second data map toward the second location.

System And Method For Calculating A Navigation Route Based On Non-Contiguous Cartographic Map Databases

View page
US Patent:
6574554, Jun 3, 2003
Filed:
Dec 11, 2001
Appl. No.:
10/015153
Inventors:
Darin J. Beesley - Overland Park KS
Michael Childs - Olathe KS
Assignee:
Garmin Ltd.
International Classification:
G01C 2130
US Classification:
701209, 701 23, 701201, 701208, 701212, 340990
Abstract:
A method and apparatus are provided for calculating potential paths between source and destination locations. First and second map databases are provided that are indicative of roadway networks for geographic regions bounded by region edges and containing source and destination locations. The first and second map databases, are non-adjacent, non-contiguous such that the region edges of the first map database are separate and distinct from region edges of the second map database. Potential paths are calculated through the roadway network of the first map database up to a node or segment at which each potential path intersects a region edge of the first map database, thereby defining a node/edge coordinate. A transition location is obtained in the second map database that geographically corresponds to the node/edge coordinate at which a given potential path intersected the region edge of the first map database. The calculation continues from the transition location through the roadway network of the second map database.

Systems And Methods For A Navigational Device With Forced Layer Switching Based On Memory Constraints

View page
US Patent:
6581003, Jun 17, 2003
Filed:
Dec 20, 2001
Appl. No.:
10/027159
Inventors:
Michael Childs - Olathe KS
Darin J. Beesley - Overland Park KS
Assignee:
Garmin Ltd.
International Classification:
G01C 2100
US Classification:
701209, 701 25, 701208
Abstract:
Systems, devices and methods are provided for more efficient use of RAM and other resources in connection with a route calculation algorithm which quickly obtains a best or reasonable best path between two locations. The navigational aid device includes forced layer switching capabilities. The navigational aid device includes a processor and a memory adapted to communicate with the processor. The memory has cartographic data including any number of locations and data indicative of thoroughfares of a plurality of types connecting certain ones of the locations. The plurality of thoroughfares are organized in a hierarchy of detail levels. The processor operates on a route calculation algorithm to find a path between any two of the number of locations and the route calculation algorithm dynamically forces switching between different levels in the hierarchy of detail levels based on a set of criteria.

System And Method For Compressing Data

View page
US Patent:
6650996, Nov 18, 2003
Filed:
Dec 20, 2001
Appl. No.:
10/027334
Inventors:
Darin J. Beesley - Overland Park KS
Stephen C. Robinson - Olathe KS
Michael Childs - Olathe KS
Chunyen Liu - Overland Park KS
Assignee:
Garmin Ltd.
International Classification:
H03M 740
US Classification:
701200, 341 65, 341 67
Abstract:
Systems, devices and methods are provided to compress data, and in particular to code and decode data. One aspect of the present subject matter is a data structure. The data structure includes a field representing a decoding structure to decode canonical Huffman encoded data, and a field representing a symbol table. The decoding structure includes a field representing an accelerator table to provide a 2 -deep direct-index lookup to provide high-frequency symbols for high-frequency data and to provide bracketing indices for low-frequency data. The decoding structure also includes a field for a binary search table to provide a low-frequency symbol index using a binary search bounded by the bracketing indices provided by the accelerator table. The symbol table is adapted to provide a symbol associated with the low-frequency index.

Systems, Functional Data, And Methods For Generating A Route

View page
US Patent:
6675093, Jan 6, 2004
Filed:
Dec 21, 2001
Appl. No.:
10/032033
Inventors:
Michael Childs - Olathe KS
Darin J. Beesley - Overland Park KS
Assignee:
Garmin Ltd.
International Classification:
G01C 2134
US Classification:
701209, 701211, 34099519
Abstract:
Devices, systems, functional data and methods are provided for an improved route generation in navigational enabled devices. In generating the route, the available locations are inspected repetitively and locations adjacent to a last selected location are inserted into a first data structure such that the first location of the first data structure is always a least cost location associated with all adjacent locations comprising the first data structure. The first location is then optionally inserted into a second data structure. The generated route includes the current location, one or more first locations, and the destination.

Systems And Methods For A Pda With Forced Layer Switching Based On Memory Constraints

View page
US Patent:
6694256, Feb 17, 2004
Filed:
Oct 11, 2002
Appl. No.:
10/269316
Inventors:
Michael E. Childs - Overland Park KS
Darin J. Beesley - Overland Park KS
Assignee:
Garmin Ltd.
International Classification:
G01C 2100
US Classification:
701209, 701 25, 701208
Abstract:
Systems, devices and methods are provided for more efficient use of RAM and other resources in connection with a route calculation algorithm which quickly obtains a best or reasonable best path between two locations. A PDA includes forced layer switching capabilities. The PDA includes a processor and a memory adapted to communicate with the processor. The memory has cartographic data including any number of locations and data indicative of thoroughfares of a plurality of types connecting certain ones of the locations. The plurality of thoroughfares are organized in a hierarchy of detail levels. The processor operates on a route calculation algorithm to find a path between any two of the number of locations and the route calculation algorithm dynamically forces switching between different levels in the hierarchy of detail levels based on a set of criteria.

System And Method For Estimating Impedance Time Through A Road Network

View page
US Patent:
6704645, Mar 9, 2004
Filed:
Dec 11, 2001
Appl. No.:
10/015152
Inventors:
Darin J. Beesley - Overland Park KS
Michael Childs - Olathe KS
Assignee:
Garmin Ltd.
International Classification:
G01C 2126
US Classification:
701202, 701 23, 701209, 340990
Abstract:
A method and apparatus are provided for estimating an impedance through a node at an intersection between roads in a roadway network. The impedance may be measured in time or distance, for example. Characteristic information describes at least one feature of the intersecting roads. One or more pieces of characteristic information may impact the impedance of traffic through an intersection and are used to estimate the impedance through the node. Examples of characteristic information are speed information, road-type, network routing level, intersection angle information, one-way, and cross traffic turn information. An impedance factor, or a cost, is assigned to each piece of characteristic information. The cost may be positive if the characteristic information adds impedance to the node, or negative if the characteristic information subtracts impedance from the node.
Control profile
Darin J Beesley from Overland Park, KS, age ~63 Get Report