A METHOD OF GENERATING CURVED BASELINE FOR MAP LABELING
First Claim
Patent Images
1. A method of generating a curved baseline for a map labeling, comprising the steps of:
- receiving a polyline P of n points, where P={p1,p2, . . . ,pn};
generating a supporting polyline Q of m points an expected distance d between P and a curved base line L, where Q={q1,q2, . . . ,qm} (m≧
n);
generating a predetermined number of B-Spline points based upon supporting polyline Q; and
outputting the generated B-Spline points.
2 Assignments
0 Petitions
Accused Products
Abstract
Apparatus and methods of generating a curved baseline for a map labeling include receiving a polyline P={p1,p2, . . . ,pn} of n points, generating a supporting polyline Q={q1,q2, . . . ,qm} (m≧n) of m points at an expected distance d between polyline P and a curved base line L. A predetermined number of B-Spline points is generated based upon supporting polyline Q. The B-Spline points are then connected to form a curved baseline L for displaying a label.
-
Citations
12 Claims
-
1. A method of generating a curved baseline for a map labeling, comprising the steps of:
-
receiving a polyline P of n points, where P={p1,p2, . . . ,pn}; generating a supporting polyline Q of m points an expected distance d between P and a curved base line L, where Q={q1,q2, . . . ,qm} (m≧
n);generating a predetermined number of B-Spline points based upon supporting polyline Q; and outputting the generated B-Spline points. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. At least one processor configured to perform the actions of:
-
receiving a polyline P of n points, where P={p1,p2, . . . ,pn; generating a supporting polyline Q of m points an expected distance d between P and a curved base line L, where Q={q1,q2, . . . ,qm} (m≧
n);generating a predetermined number of B-Spline points based upon supporting polyline Q.
-
-
9. A computer program product, comprising:
a computer-readable medium comprising; a first set of codes for causing a computer to receive a polyline P of n points, where P={p1,p2, . . . ,pn}; a second set of codes for causing a computer to generating a supporting polyline Q of m points at an expected distance d between P and a curved base line L, where Q={q1,q2, . . . ,qm}(m≧
n);a third set of codes for causing a computer to generate a predetermined number of B-Spline points based upon supporting polyline Q; and a fourth set of codes for causing a computer to connect the B-Spline points in sequence.
-
10. A portable end user device operable to generate a curved baseline for map labeling, comprising a computer platform further including:
-
a processor; a memory executable by the processor, the memory including a curved baseline generator module that includes; an input of a polyline P of n points, where P={p1,p2, . . . ,pn}; logic operable to generate a supporting polyline Q of m points at an expected distance d between P and a curved base line L, where Q={q1,q2, . . . ,qm} (m≧
n);logic operable to generate a predetermined number of B-Spline points based upon the generated supporting polyline Q; and an output comprising the B-Spline points forming the curved baseline L. - View Dependent Claims (11, 12)
-
Specification