Map Position Display Curve Segmentation

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Conventional methods for identifying the point on a curve nearest to a position on a map are computationally intensive and require significant computing resources, especially when the curve has many points.

Innovation Solution

The method involves dividing the curve into monotonic segments and eliminating candidate points by determining the distance from the position to known nearest or farthest points within regions, thereby reducing the need to calculate distances to all points on the curve.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If conventional methods calculate distance from the position to each point of the curve, then the nearest point can be identified accurately, but the computational resource usage increases significantly

Engineering Contradiction:

Improvenearest point identification accuracyVSAvoidcomputational resource usage

Core Design Contradiction:

Measurement precisionVSUse of energy by moving object

Solution Approach 1:

The curve is divided into multiple segments, and the nearest point is identified by evaluating only specific segments rather than all points along the curve. This segmentation approach reduces the number of distance calculations while maintaining identification accuracy.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

Instead of calculating distances to all points on the curve (excessive action), the method calculates distances only to selected representative points or segments (partial action), sufficient to identify the nearest point without requiring complete enumeration of all curve points.

Inventive Principle:

Principle #16Partial or excessive action

2Shape

If the curve comprises many points, then the map object can represent complex geometry accurately, but the computational task of identifying the nearest point becomes more intensive

Engineering Contradiction:

Improvecurve geometry representation accuracyVSAvoidnearest point identification speed

Core Design Contradiction:

ShapeVSProductivity

Solution Approach 1:

The curve is segmented into manageable portions, allowing the system to maintain accurate geometric representation through the segments while reducing computational complexity by processing each segment independently rather than treating the entire curve as a single complex object.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The curve is pre-divided into segments with known characteristics (such as monotonic properties or spatial relationships), enabling the system to use this pre-computed structure to quickly identify the nearest point without performing exhaustive calculations during the nearest point search operation.

Inventive Principle:

Principle #10Preliminary action

Data Source

PatentUS9581459B2Method for displaying a position on a map

Publication Date: 2017.02.28 Y E HUB ARMENIA LLC

AI summary

There is disclosed a method executable by an electronic device for displaying a position on a map. The method comprises appreciating coordinates of position; appreciating coordinates of a map object having a curve near position; identifying a point of curve nearest to position comprising identifying a first segment of curve bounded by a first region and a second segment of curve bounded by a second region, determining that a distance from position to a point of first segment is not greater than a distance from position to a known nearest point of second region, and calculating a shortest distance from position to first segment as a shortest distance from position to either of first segment and second segment without calculating a distance from position to at least one point of second segment other than known nearest point of second region; and causing displaying, on map, of an indication of point of curve nearest to position.