EP3042153A1 - Method for displaying a position on a map - Google Patents
Method for displaying a position on a mapInfo
- Publication number
- EP3042153A1 EP3042153A1 EP15815600.0A EP15815600A EP3042153A1 EP 3042153 A1 EP3042153 A1 EP 3042153A1 EP 15815600 A EP15815600 A EP 15815600A EP 3042153 A1 EP3042153 A1 EP 3042153A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- segment
- region
- point
- curve
- distance
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/36—Input/output arrangements for on-board computers
- G01C21/3667—Display of a road map
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/05—Geographic models
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/36—Input/output arrangements for on-board computers
- G01C21/3667—Display of a road map
- G01C21/367—Details, e.g. road map scale, orientation, zooming, illumination, level of detail, scrolling of road map or positioning of current position marker
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/10—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 by using measurements of speed or acceleration
- G01C21/12—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 by using measurements of speed or acceleration executed aboard the object being navigated; Dead reckoning
- G01C21/14—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 by using measurements of speed or acceleration executed aboard the object being navigated; Dead reckoning by recording the course traversed by the object
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/28—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network with correlation of data from several navigational instruments
- G01C21/30—Map- or contour-matching
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S5/00—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations
- G01S5/02—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations using radio waves
- G01S5/14—Determining absolute distances from a plurality of spaced points of known location
Definitions
- the present technology relates to methods for displaying a position on a map comprising identifying a point of a curve nearest to the position.
- Mapping applications executed by electronic devices such as desktop computers and smartphones display maps to users in order to provide useful geographic information.
- such geographical information may include an indication of a nearest point of a map object to a position.
- a user of a smartphone who wants to catch a glimpse of a parade may use a mapping application to locate a nearest point along the parade route.
- the mapping application may obtain a position of the smartphone via a positioning component, download information concerning the parade route via a networking component, calculate which point along the parade route is nearest to the position, and display an indication of the calculated point to the user.
- the present technology provides computer-implemented methods and program instructions wherein one or more points of a curve are ruled out as candidates for nearest point of the curve to a position without calculating how far they actually are from the position.
- the computational task of calculating the distance to each one of the eliminated candidate points of the curve is obviated, which may result in a reduced usage of computational resources in some cases.
- various implementations of the present technology provide a computer-implemented method for displaying a position on a map, the method executable by an electronic device causing displaying of the map, the method comprising:
- identifying a point of the curve nearest to the position comprising o identifying a first segment of the curve bounded by a first region and a second segment of the curve bounded by a second region; o determining that a distance from the position to a point of the first segment is not greater than a distance from the position to a known nearest point of the second region; and o calculating a shortest distance from the position to the first segment as a shortest distance from the position to either of the first segment and the second segment without calculating a distance from the position to at least one point of the second segment other than the known nearest point of the second region; and
- identifying the first segment of the curve bounded by the first region and the second segment of the curve bounded by the second region comprises dividing the curve into monotonic segments including the first segment and the second segment.
- identifying the first segment of the curve bounded by the first region and the second segment of the curve bounded by the second region comprises dividing a monotonic segment of the curve into segments including the first segment and the second segment.
- dividing the monotonic segment of the curve into segments including the first segment and the second segment comprises dividing the monotonic segment of the curve into an odd number of segments, the first segment being a middle one of the odd number of segments.
- dividing the monotonic segment of the curve into segments including the first segment and the second segment comprises dividing the monotonic segment of the curve into segments including the first segment and the second segment such that the second segment monotonically progresses away from the position from a known nearest point of the second region.
- dividing the monotonic segment of the curve into segments including the first segment and the second segment comprises dividing the monotonic segment of the curve into segments including the first segment, the second segment, and a third segment bounded by a third region, such that the third segment monotonically progresses away from the position from a known nearest point of the third region; and identifying the point of the curve nearest to the position further comprises calculating a distance from the position to the known nearest point of the third region as a shortest distance from the position to the third segment without calculating a distance from the position to at least one point of the third segment other than the known nearest point of the third region.
- determining that the distance from the position to the point of the first segment is not greater than the distance from the position to the known nearest point of the second region comprises determining that a distance from the position to a known farthest point of the first region is not greater than the second distance.
- the map is three-dimensional, the first region is a rectangular cuboid, and the known farthest point of the first region is a farthest corner of the first region. In other such implementations, the map is two-dimensional, the first region is a rectangle, and the known farthest point of the first region is a farthest corner of the first region.
- the map is three-dimensional, the second region is a rectangular cuboid, and the known nearest point of the second region is a nearest corner of the second region.
- the map is two-dimensional, the second region is a rectangle, and the known nearest point of the second region is a nearest corner of the second region.
- calculating a shortest distance from the position to the first segment as a shortest distance from the position to either of the first segment and the second segment without calculating a distance from the position to at least one point of the second segment other than the known nearest point of the second region is calculating a shortest distance from the position to the first segment as a shortest distance from the position to either of the first segment and the second segment without calculating a distance from the position to any point of the second segment other than the known nearest point of the second region.
- various implementations of the present technology provide a computer-implemented method for displaying a position on a map, the method executable by an electronic device causing displaying of the map, the method comprising:
- identifying a point of the curve nearest to the position comprising o identifying a monotonic segment of the curve bounded by a region having a known nearest point to the position; o determining that the monotonic segment monotonically progresses away from the position from the known nearest point; o calculating a distance from the position to the known nearest point of the region as a shortest distance from the position to the monotonic segment without calculating a distance from the position to at least one point of the monotonic segment other than the known nearest point of the region; and
- the map is three-dimensional, the region is a rectangular cuboid, and the known nearest point of the region is a nearest corner of the region.
- the map is two-dimensional, the region is a rectangle, and the known nearest point of the region is a nearest corner of the region.
- calculating a distance from the position to the known nearest point of the region as a shortest distance from the position to the monotonic segment without calculating a distance from the position to at least one point of the monotonic segment other than the known nearest point of the region is calculating a distance from the position to the known nearest point of the region as a shortest distance from the position to the monotonic segment without calculating a distance from the position to any point of the monotonic segment other than the known nearest point of the region.
- various implementations of the present technology provide a non- transitory computer-readable medium storing program instructions for displaying a position on a map, the program instructions being executable by one or more processors of an electronic device to carry out one or more of the above-recited methods.
- an "electronic device” is any hardware and/or software appropriate to the relevant task at hand.
- electronic devices include computers (servers, desktops, laptops, netbooks, etc.), smartphones, and tablets, as well as network equipment such as routers, switches, and gateways.
- computer-readable medium is intended to include media of any nature and kind whatsoever, non-limiting examples of which include RAM, ROM, disks (CD-ROMs, DVDs, floppy disks, hard disk drives, etc.), USB keys, flash memory cards, solid state-drives, and tape drives.
- an "indication" of an information element may be the information element itself or a pointer, reference, link, or other indirect mechanism enabling the recipient of the indication to locate a network, memory, database, or other computer-readable medium location from which the information element may be retrieved.
- an indication of a file could include the file itself (i.e. its contents), or it could be a unique file descriptor identifying the file with respect to a particular filesystem, or some other means of directing the recipient of the indication to a network location, memory address, database table, or other location where the file may be accessed.
- the degree of precision required in such an indication depends on the extent of any prior understanding about the interpretation to be given to information being exchanged as between the sender and the recipient of the indication. For example, if it is understood prior to a communication between a sender and a recipient that an indication of an information element will take the form of a database key for an entry in a particular table of a predetermined database containing the information element, then the sending of the database key is all that is required to effectively convey the information element to the recipient, even though the information element itself was not transmitted as between the sender and the recipient of the indication. [20] In the context of the present specification, unless expressly provided otherwise, the words “first”, “second”, “third”, etc.
- first server and third server are not intended to imply any particular order, type, chronology, hierarchy or ranking (for example) of/between the server, nor is their use (by itself) intended imply that any "second server” must necessarily exist in any given situation.
- reference to a "first” element and a "second” element does not preclude the two elements from being the same actual real-world element.
- a "first" server and a “second” server may be the same software and/or hardware, in other cases they may be different software and/or hardware.
- Implementations of the present technology each have at least one of the above- mentioned object and/or aspects, but do not necessarily have all of them. It should be understood that some aspects of the present technology that have resulted from attempting to attain the above-mentioned object may not satisfy this object and/or may satisfy other objects not specifically recited herein.
- Figure 1 is a diagram of a computer system suitable for implementing the present technology and/or being used in conjunction with implementations of the present technology
- Figure 2 is a diagram of a networked computing environment suitable for use with some implementations of the present technology
- Figure 3 is a diagram of a position and a curve illustrating implementations of the present technology
- Figures 4 and 5 are screenshots of a map which may be displayed by a mapping application according to some implementations of the present technology
- Figures 6 to 8 are diagrams of a position and a curve divided into monotonic segments illustrating implementations of the present technology
- Figure 9 is a diagram of a position and a monotonic segment divided into segments illustrating implementations of the present technology.
- Figures 10 and 11 are flowcharts illustrating the respective steps of two method implementations of the present technology.
- processor may be provided through the use of dedicated hardware as well as hardware capable of executing software in association with appropriate software.
- the functions may be provided by a single dedicated processor, by a single shared processor, or by a plurality of individual processors, some of which may be shared.
- processor or “controller” should not be construed to refer exclusively to hardware capable of executing software, and may implicitly include, without limitation, digital signal processor (DSP) hardware, network processor, application specific integrated circuit (ASIC), field programmable gate array (FPGA), read-only memory (ROM) for storing software, random access memory (RAM), and non-volatile storage.
- DSP digital signal processor
- ASIC application specific integrated circuit
- FPGA field programmable gate array
- ROM read-only memory
- RAM random access memory
- non-volatile storage Other hardware, conventional and/or custom, may also be included.
- FIG 1 there is shown a computer system 100 suitable for use with some implementations of the present technology, the computer system 100 comprising various hardware components including one or more single or multi-core processors collectively represented by processor 110, a solid-state drive 120, a random access memory 130, a display interface 140, and an input/output interface 150.
- Communication between the various components of the computer system 100 may be enabled by one or more internal and/or external buses 160 (e.g. a PCI bus, universal serial bus, IEEE 1394 "Firewire" bus, SCSI bus, Serial-ATA bus, etc.), to which the various hardware components are electronically coupled.
- the display interface 140 may be coupled to a monitor or touchscreen (not shown).
- the solid-state drive 120 stores program instructions suitable for being loaded into the random access memory 130 and executed by the processor 110 for displaying a position on a map.
- the program instructions may be part of a mapping application executable by the processor 110.
- FIG 2 there is shown a networked computing environment 200 suitable for use with some implementations of the present technology, the networked computing environment 200 comprising a smartphone 220 (e.g. an Apple iPhoneTM or a Samsung Galaxy S4TM) with a touchscreen 222 for displaying information to a user 210 and receiving touchscreen commands from the user 210, a mapping server 230 in communication with the smartphone 220 via a communications network 201 (e.g. the Internet), and a GPS satellite 240 transmitting a GPS signal 242 to the smartphone 220.
- a smartphone 220 e.g. an Apple iPhoneTM or a Samsung Galaxy S4TM
- a mapping server 230 in communication with the smartphone 220 via a communications network 201 (e.g. the Internet)
- a GPS satellite 240 transmitting a GPS signal 242 to the smartphone 220.
- smartphone 220 also comprises internal hardware components including one or more single or multi-core processors collectively referred to herein as processor 110, and a random access memory 130, each of which is analogous to the like-numbered hardware components of computer system 100 shown in FIG 1, as well as a network interface (not depicted) for communicating with the mapping server 320 via communications network 201 and a GPS receiver (not depicted) for receiving the GPS signal 242 from GPS satellite 240. It will be understood that other implementations of the present technology may employ a positioning technology other than GPS.
- FIG 3 shows a route 300 from Capital City to Springfield which may be received by the smartphone 220 from the mapping server 230 via communications network 201, and a GPS position 1 of smartphone 220 which may be received by the smartphone 220 from the GPS satellite 240 by way of the GPS signal 242, according to an exemplary implementation of the present technology. It may be useful for a mapping application executed by the processor 110 of the smartphone 220 to carry out the steps of appreciating the route 300 having been received from the mapping server 230, appreciating the GPS position 1 having been received from the GPS satellite 240, identifying a point of the route 300 nearest to the GPS position 1 (e.g. one of the candidate points 2, 3, and 4 shown in FIG 3, lying at respective distances of 2D, 3D, and 4D from GPS position 1), and providing an indication of the nearest point to the user 210 of the smartphone 220.
- a mapping application executed by the processor 110 of the smartphone 220 to carry out the steps of appreciating the route 300 having been received from the mapping server 230, appreciating the GPS position 1 having been
- the mapping application may be reasonably confident (perhaps due to specific input received from the user 210) that the correct position of the smartphone 220 must lie on the route 300, even though the GPS position 1 of smartphone 220 received from the GPS satellite 240 does not lie on the route 300.
- the user 210 may have requested the mapping application to determine the route 300 and display the route to the user 300.
- the mapping application may identify a nearest point of the route 300 to the GPS position 1 as a best estimate of the actual correct position of the smartphone 220 and cause that nearest point of the route 300 to be displayed to the user 210 on a map.
- the route 300 may be an official cycling trail from Capital City to Springfield, and the user 210 of the smartphone 220 at GPS position 1 (this time assumed to be correct) may be a cyclist having deviated from the official cycling trail.
- the user 210 may request assistance from the mapping application to get back to the official cycling trail, causing the mapping application to identify the nearest point of route 300 and display it to the user 210 on the touchscreen 222 of the smartphone 220.
- implementations of the present technology may also be employed in many other scenarios.
- FIG 4 and FIG 5 show two alternative screenshots which may be displayed to the user 210 depending on which of candidate point 3 and candidate point 4 of the route 300 - among all of the other candidate points of the route 300 not depicted - is identified by the mapping application as the point of the route 300 nearest to the GPS position 1.
- candidate point 3, at distance 3D from the GPS position 1 is indicated as the nearest point by way of a small circle drawn on the route 300.
- FIG 5 shows how the mapping application may indicate to the user 210 an alternative conclusion, namely that candidate point 4, at distance 4, is the nearest point on the route 300 to the GPS position 1.
- FIG 6 shows the route 300 having been divided into eight segments 31 to 38, each bounded by a respective region 31R to 38R.
- Each of the segments 31 to 38 is said to be "monotonic" because it is either entirely non-increasing or entirely non-decreasing in each dimension.
- monotonic segments 31, 33, 35, and 37 never decrease in the horizontal dimension (x-dimension), and they also never decrease in the vertical dimension (y-dimension).
- monotonic segments 32, 34, 36, and 38 never increase either in the x-dimension or the y-dimension.
- a monotonic segment may nonetheless have a flat portion such that it neither increases nor decreases in one or more dimensions, so long as it does not both increase and decrease in any dimension.
- the regions bounding various segments of the curve represented by an object such as route 300 may also be three-dimensional, perhaps taking the form of a rectangular cuboid (box) or a sphere, as non-limiting examples. While irregular shapes may be used, it is embodiments of the present technology contemplate selecting a shape that allows boundary points of the regions to be known without undue computation. In particular, some implementations of the present technology involve the nearest and/or farthest points of the regions to be readily known, as will become clear below.
- FIG 6 also shows a first manner in which implementations of the present technology may avoid calculating the distance to some of the candidate points of the route 300.
- a farthest point of the region 35R namely that which coincides with candidate point 5 of the route 300, lies at distance 5D from the GPS position 1.
- a nearest point of the region 38R namely that which coincides with candidate point 6 of the route 300, lies at a greater distance 6D than distance 5D from the GPS position 1.
- implementations of the present technology may conclude that the shortest distance from the GPS position 1 to the segment 35 is the shortest distance from the GPS position 1 to either of the segment 35 and the segment 38.
- FIG 7 shows a second manner in which implementations of the present technology may avoid calculating the distance to some of the candidate points of the route 300.
- the segment 32 bounded by the region 32R, which monotonically progresses away from GPS position 1 from a known nearest point of the region 32R to the GPS position 1, namely candidate point 3 of the route 300. Because it is impossible that any candidate point (e.g. candidate point 7) of the segment 32 is nearer to the GPS position 1 than candidate point 3, implementations of the present technology may therefore soundly conclude without calculating the distance from GPS position 1 to any other candidate point of segment 32 of the route 300, that the shortest distance from GPS position 1 to segment 32 is the distance from GPS position 1 to candidate point 3.
- FIG 8 resembles FIG 7, only it shows a different GPS position 8, this time located within the region 37R which bounds the monotonic segment 37 of the route 300 between Capital City and Springfield. As such, it represents another instance of the same problem presented above with reference to FIG 3 to FIG 7, namely that of identifying a point of the route 300 nearest to a GPS position 8.
- Candidate points 9, 10, and 11 are shown merely as examples of points of the route 300 which may be found to be the nearest point.
- FIG 9 shows a close-up view (not to scale) of the monotonic segment 37 of FIG 8, along with GPS position 8 and candidate points 9 and 11 , with a view to illustrating further techniques of the present technology.
- the monotonic segment 37 has been further divided into segments 371 to 377 each bounded by a respective region 371R to 377R. Being segments of a monotonic segment 37, each of the segments 371 to 377 are necessarily monotonic themselves. According to the implementation shown, the regions 371R to 377R are rectangular, but as previously described, in other implementations they may have other shapes such as circles (or rectangular cuboids, spheres, or other three-dimensional forms in the case of three-dimensional implementations of the present technology).
- Segment 377 (bounded by region 377R) lies entirely within a 1 st Cartesian quarter relative to the GPS position 8, meaning that every point of the segment 377 has greater (or equal) coordinate values than those of the GPS position 8 in each of the x-dimension and the y-dimension. As such, segment 377 presents a situation analogous to that of segment 32 in FIG 7, in that segment 377 monotonically progresses away from GPS position 8 from a nearest corner (represented by candidate point 11) of the region 377R.
- Implementations of the present technology may therefore soundly conclude that the shortest distance to any point of the segment 377 is the distance 11D to the known nearest corner (candidate point 11) of the region 377R. Similarly, segment 371 (bounded by region
- 377R lies entirely within a 3 rd Cartesian quarter relative to the GPS position 8, meaning that every point of the segment 371 has lesser (or equal) coordinate values than those of the GPS position 8 in each of the x-dimension and the y-dimension, and the shortest distance from the GPS position 8 to the segment 377 is therefore known to be the distance to the nearest corner (unlabeled) of the region 371R
- some implementations of the present technology may divide a monotonic segment which lies both in the 4 th Cartesian quarter (or, analogously, the 2 nd Cartesian quarter) and in one or both of the 1 st and 3 rd Cartesian quarters, into segments including a segment lying entirely within one of the 1 st and 3 rd Cartesian quarters, for the specific purpose of eliminating any candidate points of that segment other than a known nearest point of the region bounding that segment.
- the nearest corner 375C of the region 375R is not a point of the segment 375, and is therefore not a candidate point in the way that candidate point 11 was as a nearest corner of the region 377R lying in the 1 st Cartesian quarter. Nevertheless, because the nearest corner 375C is a nearest point to any point of the region 375R which bounds segment 375, the distance 375D from GPS position 8 to the nearest corner 375C serves as an absolute lower bound on the distance from GPS position 8 to any point of the segment 375.
- the need to calculate the actual distance to any of the points of the segment 375 is eliminated as soon as a shorter distance than distance 375D to another candidate point of the segment 37 becomes known.
- implementations of the present technology may soundly conclude that a shortest distance from the GPS position 8 to segment 373 is a shortest distance to either one of segment 373 and segment 375, without ever calculating the distance from GPS position 8 to any of the points of the segment 375.
- the inventor of the present technology has observed that in some embodiments of the present technology one may divide the portion of the monotonic segment (e.g.
- FIG 10 shows a computer-implemented method 400 for displaying a position on a map, the method executable by a processor of an electronic device.
- Method 400 may be carried out, for example, in the context of the smartphone 220 of FIG 2 by a processor 110 executing program instructions having been loaded into its random access memory 130.
- coordinates of the position are appreciated.
- the coordinates of GPS position 8 may be received from a GPS satellite 240 via a GPS signal 242 or read by the processor 110 of smartphone 220 from its memory 120.
- coordinates of an object having a curve near the position are appreciated. For example, coordinates of the route 300 having, among other curves, a segment 37 near the GPS position 8 of FIG 9, may be received by the smartphone 220 from the mapping server 230 via the communications network 201.
- a point of the curve nearest to the position is identified. For example, the candidate point 9 of segment 37 of FIG 9 may be identified as the point of segment 37 nearest to the GPS position 8.
- Step 430 comprises step 432, wherein a first segment of the curve bounded by a first region and a second segment of the curve bounded by a second region are identified. For example, segment 373 bounded by region 373R and segment 375 bounded by segment 375R may be identified.
- the curve may be divided into monotonic segments including the first segment and the second segment.
- the route 300 may be divided into monotonic segments 31 to 38, as in FIG 6, or a monotonic segment 37 may be divided into segments 371 to 377, as in FIG 9.
- Step 430 also comprises step 434, wherein it is determined that a distance from the position to a point of the first segment is not greater than a distance from the position to a known nearest point of the second region. For example, it may be determined that the distance 9D to candidate point 9 is less than the distance 375D to the nearest corner 375C of the region 375R. In some implementations, it may be determined that a farthest point of the first region is at least as near as the nearest point of the second region, such as was the case in the example provided above with reference to FIG 6.
- Step 430 also comprises step 436, wherein a shortest distance from the position to the first segment is calculated as a shortest distance from the position to either of the first segment and the second segment without calculating a distance from the position to at least one point of the second segment other than the known nearest point of the second region.
- the shortest distance from the GPS position 8 to the segment 373 may be calculated as the shortest distance from the GPS position 8 to either of the segment 373 and the segment 375 without calculating a distance to one or more (or any) of the points of the segment 375.
- step 440 displaying on the map of an indication of the point of the curve nearest to the position is caused.
- the processor 110 of the smartphone 220 may cause the display interface 140 of the smartphone 220 to display the point on a map displayed on touchscreen 222, thus providing the user 210 of the smartphone 220 with an indication of the point (candidate point 9) of the route 300 nearest to his or her GPS position 8.
- FIG 11 shows a computer-implemented method 500 for displaying a position on a map, the method executable by a processor of an electronic device.
- Method 500 may be carried out, for example, in the context of the smartphone 220 of FIG 2 by a processor 110 executing program instructions having been loaded into its random access memory 130.
- coordinates of the position are appreciated.
- the coordinates of GPS position 8 may be received from a GPS satellite 240 via a GPS signal 242 or read by the processor 110 of smartphone 220 from its memory 120.
- coordinates of an object having a curve near the position are appreciated.
- coordinates of the route 300 having, among other curves, a segment 37 near the GPS position 8 of FIG 9, may be received by the smartphone 220 from the mapping server 230 via the communications network 201.
- Step 530 a point of the curve nearest to the position is identified.
- the candidate point 9 of segment 37 of FIG 9 may be identified as the point of segment 37 nearest to the GPS position 8.
- Step 530 comprises step 532, wherein a monotonic segment of the curve bounded by a region having a known nearest point to the position is identified.
- segment 377 bounded by region 377R having the known nearest corner coincident with candidate point 11 may be identified.
- Step 530 also comprises step 534, wherein it is determined that the monotonic segment monotonically progresses away from the position from the known nearest point.
- segment 377 is a monotonic segment which, from a known nearest point (the candidate point 11) of region 377R, candidate point 11 having greater coordinate values in both the x-dimension and y-dimension than the GPS position 8, monotonically progresses to other points of the segment 377 having yet greater (or equal) coordinate values than those of candidate point 11.
- Step 530 also comprises step 536, wherein a distance from the position to the known nearest point of the region is calculated as a shortest distance from the position to the monotonic segment without calculating a distance from the position to at least one point of the monotonic segment other than the known nearest point of the region.
- the distance 11D from GPS position 8 to the candidate point 11 of region 377R may be calculated as the shortest distance from GPS position to one or more (or any) point of segment 377.
- step 540 displaying on the map of an indication of the point of the curve nearest to the position is caused.
- the processor 110 of the smartphone 220 may cause the display interface 140 of the smartphone 220 to display the point on a map displayed on touchscreen 222, thus providing the user 210 of the smartphone 220 with an indication of the point (candidate point 9) of the route 300 nearest to his or her GPS position 8.
Abstract
Description
Claims
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
RU2014126767A RU2608885C2 (en) | 2014-06-30 | 2014-06-30 | Method for determining the curve point nearest to the position on the map |
PCT/IB2015/050102 WO2016001768A1 (en) | 2014-06-30 | 2015-01-06 | Method for displaying a position on a map |
Publications (2)
Publication Number | Publication Date |
---|---|
EP3042153A1 true EP3042153A1 (en) | 2016-07-13 |
EP3042153A4 EP3042153A4 (en) | 2016-10-12 |
Family
ID=55018510
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP15815600.0A Withdrawn EP3042153A4 (en) | 2014-06-30 | 2015-01-06 | Method for displaying a position on a map |
Country Status (4)
Country | Link |
---|---|
US (1) | US9581459B2 (en) |
EP (1) | EP3042153A4 (en) |
RU (1) | RU2608885C2 (en) |
WO (1) | WO2016001768A1 (en) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE102016205434A1 (en) * | 2015-11-25 | 2017-06-01 | Volkswagen Aktiengesellschaft | Method and system for creating a lane-accurate occupancy map for lanes |
CN108398701B (en) * | 2017-10-20 | 2020-07-03 | 蔚来汽车有限公司 | Vehicle positioning method and device |
JP6692984B1 (en) * | 2019-09-20 | 2020-05-13 | アジア航測株式会社 | Super resolution stereoscopic processing system and its program |
Family Cites Families (41)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5237647A (en) | 1989-09-15 | 1993-08-17 | Massachusetts Institute Of Technology | Computer aided drawing in three dimensions |
DE69333933T2 (en) | 1992-08-19 | 2006-06-29 | Aisin AW Co., Ltd., Anjo | Car navigation system |
EP0932133B1 (en) | 1993-12-27 | 2006-04-05 | Nissan Motor Co., Ltd. | Apparatus and method for navigating vehicle to destination using display unit |
JP3545839B2 (en) * | 1995-06-09 | 2004-07-21 | 株式会社ザナヴィ・インフォマティクス | Current position calculation device |
WO1998023918A1 (en) * | 1996-11-25 | 1998-06-04 | Toyota Jidosha Kabushiki Kaisha | Navigation device for vehicle and preparation of road shape data used therefor |
US6111588A (en) | 1996-12-05 | 2000-08-29 | Adobe Systems Incorporated | Creating and modifying curves on a computer display |
JPH1152845A (en) * | 1997-08-08 | 1999-02-26 | Aisin Aw Co Ltd | Map display device and recording medium |
US6029173A (en) * | 1997-11-26 | 2000-02-22 | Navigation Technologies Corporation | Method and system for representation and use of shape information in geographic databases |
DE19920709A1 (en) * | 1999-05-05 | 2000-11-16 | Siemens Ag | Method for obtaining a three-dimensional map display and navigation system |
US6427117B1 (en) * | 1999-07-14 | 2002-07-30 | Kabushikikaisha Equos Research | Navigation method, navigation system, and information communications apparatus used in the navigation system |
DE10021373A1 (en) * | 2000-05-02 | 2001-11-08 | Siemens Ag | Positioning method and navigation device |
JP4663136B2 (en) * | 2001-01-29 | 2011-03-30 | パナソニック株式会社 | Method and apparatus for transmitting location information of digital map |
US6681177B2 (en) * | 2001-01-30 | 2004-01-20 | Rajashri Joshi | Bowing coefficient representation of curvature of geographic features |
GB2385223A (en) * | 2002-02-08 | 2003-08-13 | E Lead Electronic Co Ltd | Navigation system where route and deviation limit is calculated remotely and may be revised upon route deviation |
KR100495635B1 (en) * | 2002-09-02 | 2005-06-16 | 엘지전자 주식회사 | Method for correcting position error in navigation system |
KR100498987B1 (en) * | 2002-10-11 | 2005-07-01 | 엘지전자 주식회사 | Method for estimating location of vehicle in Global Positioning System Data's poor region |
US7551173B2 (en) | 2003-11-25 | 2009-06-23 | Canon Kabushiki Kaisha | Pixel accurate edges for scanline rendering system |
JP4807107B2 (en) * | 2006-03-02 | 2011-11-02 | 日産自動車株式会社 | Vehicle travel control device |
JP5064870B2 (en) * | 2007-04-17 | 2012-10-31 | 株式会社日立製作所 | Digital road map generation method and map generation system |
JP4479816B2 (en) * | 2008-03-28 | 2010-06-09 | アイシン・エィ・ダブリュ株式会社 | Road shape estimation device, road shape estimation method and program |
US8698649B2 (en) * | 2008-05-30 | 2014-04-15 | Navteq B.V. | Data mining in a digital map database to identify decreasing radius of curvature along roads and enabling precautionary actions in a vehicle |
US8332143B2 (en) * | 2008-05-30 | 2012-12-11 | Navteq B.V. | Data mining in a digital map database to identify curves along downhill roads and enabling precautionary actions in a vehicle |
US8306735B2 (en) * | 2009-07-15 | 2012-11-06 | GM Global Technology Operations LLC | System and method for managing geographical maplet downloads for a vehicle to support stop sign violation assist and similar applications |
US8762045B2 (en) * | 2009-07-27 | 2014-06-24 | Htc Corporation | Method for adjusting navigation frame, navigation apparatus and recording medium |
US8379025B1 (en) * | 2009-08-28 | 2013-02-19 | Adobe Systems Incorporated | Methods and apparatus for rendering vector art on graphics hardware |
US9217648B2 (en) * | 2010-03-30 | 2015-12-22 | Here Global B.V. | Method of operating a navigation system to provide a pedestrian route |
US8676494B2 (en) * | 2010-09-29 | 2014-03-18 | Navteq B.V. | Multi-dimensional road representation |
US8930142B2 (en) * | 2010-11-26 | 2015-01-06 | International Business Machines Corporation | Route selection system, method and program |
US8718932B1 (en) * | 2011-06-01 | 2014-05-06 | Google Inc. | Snapping GPS tracks to road segments |
JP5831308B2 (en) * | 2012-03-13 | 2015-12-09 | アイシン・エィ・ダブリュ株式会社 | Moving body position detection system, moving body position detection apparatus, moving body position detection method, and computer program |
US9224218B2 (en) * | 2012-06-05 | 2015-12-29 | Apple Inc. | System and method for loading and rendering curved features in a map |
US20140095062A1 (en) * | 2012-09-28 | 2014-04-03 | Hewlett-Packard Development Company, L.P. | Road Maps from Clusters of Line Segments of Multiple Sources |
CN103839228B (en) * | 2012-11-23 | 2016-07-06 | 厦门雅迅网络股份有限公司 | A kind of take out rare method with smoothing processing based on map vector data |
CN103943025B (en) * | 2013-01-18 | 2017-07-11 | 厦门雅迅网络股份有限公司 | A kind of streetscape display methods based on path coordinate system |
JP6026295B2 (en) * | 2013-01-23 | 2016-11-16 | 株式会社デンソーアイティーラボラトリ | Curve shape modeling apparatus, method, and in-vehicle navigation apparatus |
US9423261B2 (en) * | 2013-02-19 | 2016-08-23 | Here Global B.V. | Path curve confidence factors |
JP6233706B2 (en) * | 2013-04-02 | 2017-11-22 | パナソニックIpマネジメント株式会社 | Autonomous mobile device and self-position estimation method of autonomous mobile device |
JP6161942B2 (en) * | 2013-04-19 | 2017-07-12 | 株式会社デンソーアイティーラボラトリ | Curve shape modeling device, vehicle information processing system, curve shape modeling method, and curve shape modeling program |
US9170115B2 (en) * | 2013-06-03 | 2015-10-27 | Hyundai Motor Company | Method and system for generating road map using data of position sensor of vehicle |
JP6278381B2 (en) * | 2013-08-26 | 2018-02-14 | アルパイン株式会社 | Corner information providing apparatus and corner information providing method |
US9322666B2 (en) * | 2014-06-30 | 2016-04-26 | Yandex Europe Ag | Method for displaying a position on a map |
-
2014
- 2014-06-30 RU RU2014126767A patent/RU2608885C2/en active IP Right Revival
-
2015
- 2015-01-06 US US15/022,569 patent/US9581459B2/en active Active
- 2015-01-06 EP EP15815600.0A patent/EP3042153A4/en not_active Withdrawn
- 2015-01-06 WO PCT/IB2015/050102 patent/WO2016001768A1/en active Application Filing
Also Published As
Publication number | Publication date |
---|---|
WO2016001768A1 (en) | 2016-01-07 |
US20160238405A1 (en) | 2016-08-18 |
RU2014126767A (en) | 2016-01-27 |
EP3042153A4 (en) | 2016-10-12 |
US9581459B2 (en) | 2017-02-28 |
RU2608885C2 (en) | 2017-01-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11210310B2 (en) | Method for rendering search results on a map displayable on an electronic device | |
CN108876706B (en) | Thumbnail generation from panoramic images | |
CN112166461A (en) | Physical object boundary detection techniques and systems | |
US10043309B2 (en) | Maintaining consistent boundaries in parallel mesh simplification | |
WO2019125741A1 (en) | Graphical coordinate system transform for video frames | |
WO2019062649A1 (en) | Adaptive region division method and system | |
US10147162B2 (en) | Method and system for recognizing POI outside map screen | |
US9581459B2 (en) | Method for displaying a position on a map | |
US20230186562A1 (en) | Method and system for 3d modeling based on volume estimation | |
US20150128089A1 (en) | Scale Sensitive Treatment of Features in a Geographic Information System | |
US20180300854A1 (en) | Method and electronic device for rendering a panorama image | |
WO2019169699A1 (en) | House model rendering method and apparatus, terminal device, and medium | |
US9322666B2 (en) | Method for displaying a position on a map | |
EP2705500B1 (en) | Merging three-dimensional models based on confidence scores | |
US20220375164A1 (en) | Method and apparatus for three dimensional reconstruction, electronic device and storage medium | |
US9135749B2 (en) | Method and apparatus for processing three-dimensional model data | |
KR20140063965A (en) | Method and system for providing page using dynamic page division | |
US9996744B2 (en) | System, method, and recording medium for tracking gaze using only a monocular camera from a moving screen | |
WO2016135536A1 (en) | Method of and system for generating a heat map | |
WO2022062355A1 (en) | Fusion positioning method and apparatus | |
US20210166053A1 (en) | Merging object detections using graphs | |
RU2608870C2 (en) | Method (versions) and electronic device (versions) for determination of point location relative to the first polygon in multidimensional space | |
US8630477B2 (en) | Electronic device and method for outputting measurement data | |
EP3016005A1 (en) | Method and system for offering of similar photos in real time based on photographing context information of a geographically proximate user group | |
KR20160143936A (en) | Method for increasing 3D rendering performance and system thereof |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20160405 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
AX | Request for extension of the european patent |
Extension state: BA ME |
|
A4 | Supplementary search report drawn up and despatched |
Effective date: 20160912 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: G01C 21/30 20060101ALI20160906BHEP Ipc: G01C 21/34 20060101AFI20160906BHEP |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION HAS BEEN WITHDRAWN |
|
18W | Application withdrawn |
Effective date: 20170315 |