← Back to Patent Explorer
US5335319A Expired / Lapsed US ⏱️ 0.0 years remaining

Polygon division method and apparatus

Assignee: Daikin Industries Ltd
•
Filing: 1991-11-19
•
Granted: 1994-08-02
•
Expires: 2011-11-19
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A polygon division method, and polygon division apparatus are disclosed for dividing polygons according to a basic judgement as to whether each apex of the polygon is concave or convex. According to the claimed method, and what is carried out by the claimed apparatus, each apex of a polygon is judged as to whether it is concave or convex. The total number of apexes of the polygon is stored. A first convex apex is selected, whereupon a judgement is made as to whether another apex is present in the interior of a triangle that is formed by two sides which unite at the selected convex apex and a line segment that interconnects the ends of such sides. If no other apex is presence in the interior of such triangle, the triangle is cut from the polygon. Otherwise, a different convex apex is chosen. Further, the method and apparatus could include selection of convex apexes based upon whether the convex apexes overlap other apexes. Also, according to the invention, polygon division can be terminated if, during the division, it is determined that an apex has changed from convex to concave during the division.

Inventors

  • 👤 Koei Obata

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 14:09
CPC Classifications
G; G06; G06T; G06T17/00; G06T17/20

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 174 words
A polygon division method comprising the steps of: judging, for all apexes of a polygon, whether each apex is a concave apex or a convex apex; obtaining a total number of apexes of the polygon, selecting one convex apex from among all apexes of the polygon to obtain a selected apex; judging whether or not another apex is present in an interior of a triangle which is formed by two sides that unite at the selected convex apex and a line segment that interconnects ends of the two sides; cutting the triangle from the polygon, decrementing the number of apexes, and selecting another convex apex on a remaining polygon formed by cutting the triangle, when the judgment in said step of judging whether or not another apex is present is that no apex is present in the interior of the triangle; and selecting a different convex apex, when the judgment in said step of judging whether or not another apex is present is that another apex is present in the interior of the triangle.
Claim 2
Dependent Claim 174 words
A polygon division method comprising the steps of: judging, for all apexes of a polygon, whether each apex is a concave apex or a convex apex; obtaining a total number of apexes of the polygon, selecting one convex apex from among all apexes of the polygon to obtain a selected apex; judging whether or not another apex is present in an interior of a triangle which is formed by two sides that unite at the selected convex apex and a line segment that interconnects ends of the two sides; cutting the triangle from the polygon, decrementing the number of apexes, and selecting another convex apex on a remaining polygon formed by cutting the triangle, when the judgment in said step of judging whether or not another apex is present is that no apex is present in the interior of the triangle; and selecting a different convex apex, when the judgment in said step of judging whether or not another apex is present is that another apex is present in the interior of the triangle.
Claim 3
Dependent Claim 185 words
A polygon division apparatus comprising: apex judging means for judging whether each apex of a polygon is a concave apex or a convex apex; apex number holding means for holding a total number of apexes of said polygon; first convex apex selection means for selecting one convex apex; triangle judging means for judging whether or not another apex is present in an interior of a triangle which is formed by two sides uniting at a convex apex selected by said first convex apex selection means and a line segment interconnecting ends of said sides; triangle cutting means for cutting said triangle from said polygon, for decrementing said total number of apexes of said polygon and for selecting another convex apex on a remaining polygon formed by cutting said triangle, based on a judgement result, from said triangle judging means, indicating that no apex is present in said interior of said triangle; and second convex apex selection means for selecting a different convex apex based on a judgement result, from said triangle judging means, indicating that another apex is present in said interior of said triangle.
Claim 4
Dependent Claim 185 words
A polygon division apparatus comprising: apex judging means for judging whether each apex of a polygon is a concave apex or a convex apex; apex number holding means for holding a total number of apexes of said polygon; first convex apex selection means for selecting one convex apex; triangle judging means for judging whether or not another apex is present in an interior of a triangle which is formed by two sides uniting at a convex apex selected by said first convex apex selection means and a line segment interconnecting ends of said sides; triangle cutting means for cutting said triangle from said polygon, for decrementing said total number of apexes of said polygon and for selecting another convex apex on a remaining polygon formed by cutting said triangle, based on a judgement result, from said triangle judging means, indicating that no apex is present in said interior of said triangle; and second convex apex selection means for selecting a different convex apex based on a judgement result, from said triangle judging means, indicating that another apex is present in said interior of said triangle.
Claim 5
Dependent Claim 358 words
A polygon division method comprising the steps of: judging, for all apexes of a polygon, whether each apex is a concave apex or a convex apex; obtaining a total number of apexes of the polygon; detecting apexes which overlap with one another; selecting one convex apex of the polygon from apexes other than apexes detected as overlapping to obtain a selected apex; judging whether or not another apex is present in an interior of a triangle which is formed by two sides that unite at the selected convex apex and a line segment that interconnects ends of the two sides; cutting the triangle from the polygon, decrementing the number of apexes, and selecting another convex apex on a remaining polygon formed by cutting the triangle when the judgment in said step of judging whether or not another apex is present is that no apex is present in the interior of the triangle; selecting a different convex apex from among the apexes other than the apexes detected as overlapping when the judgment in said step of judging whether or not another apex is present is that another apex is present in the interior of the triangle; when division of the polygon is not completed by selecting convex apexes other than apexes detected as overlapping, selecting an overlapping convex apex which does not include any concave apex therein to obtain a selected overlapping convex apex, judging whether or not another apex is present in an interior of a triangle which is formed by two sides that unite at the selected overlapping convex apex and a line segment that interconnects ends of the two sides and cutting the triangle from the polygon when it is possible to cut the triangle from the polygon; and repeating the selecting step for selecting another convex apex and the judging step for judging whether or not another apex is present in the interior of the triangle, or the apex judging step, the detection step for overlap apexes, the convex apex selection step and the judging step for judging whether or not another apex is present in the interior of the triangle for the remaining polygon.
Claim 6
Dependent Claim 358 words
A polygon division method comprising the steps of: judging, for all apexes of a polygon, whether each apex is a concave apex or a convex apex; obtaining a total number of apexes of the polygon; detecting apexes which overlap with one another; selecting one convex apex of the polygon from apexes other than apexes detected as overlapping to obtain a selected apex; judging whether or not another apex is present in an interior of a triangle which is formed by two sides that unite at the selected convex apex and a line segment that interconnects ends of the two sides; cutting the triangle from the polygon, decrementing the number of apexes, and selecting another convex apex on a remaining polygon formed by cutting the triangle when the judgment in said step of judging whether or not another apex is present is that no apex is present in the interior of the triangle; selecting a different convex apex from among the apexes other than the apexes detected as overlapping when the judgment in said step of judging whether or not another apex is present is that another apex is present in the interior of the triangle; when division of the polygon is not completed by selecting convex apexes other than apexes detected as overlapping, selecting an overlapping convex apex which does not include any concave apex therein to obtain a selected overlapping convex apex, judging whether or not another apex is present in an interior of a triangle which is formed by two sides that unite at the selected overlapping convex apex and a line segment that interconnects ends of the two sides and cutting the triangle from the polygon when it is possible to cut the triangle from the polygon; and repeating the selecting step for selecting another convex apex and the judging step for judging whether or not another apex is present in the interior of the triangle, or the apex judging step, the detection step for overlap apexes, the convex apex selection step and the judging step for judging whether or not another apex is present in the interior of the triangle for the remaining polygon.
Claim 7
Dependent Claim 249 words
A polygon division apparatus comprising: apex judging means for judging whether each apex of a polygon is a concave apex or a convex apex; apex number holding means for holding a total number of apexes of said polygon; detection means for detecting overlap apexes which overlap one another; first convex apex selection means for selecting one convex apex of the polygon, other than one of the overlap apexes; triangle judging means for judging whether or not another apex is present in an interior of a triangle which is formed by two sides uniting at a convex apex selected by said first convex apex selection means and a line segment interconnecting ends of said sides; triangle cutting means for cutting said triangle from said polygon, for decrementing said total number of apexes of said polygon, and for selecting another convex apex on a remaining polygon formed by cutting said triangle based on a judgement result, from said triangle judging means, indicating that no apex is present in said interior of said triangle; second convex apex selection means for selecting a different convex apex based on a judgement result, from said triangle judging means, indicating that another apex is present in said interior of said triangle; and overlap apex selection means for selecting a convex apex which includes no concave apexes and for operating a judging operation by said triangle judging means when convex apexes other than said overlap convex apexes have been sequentially selected and said polygon remains incompletely divided.
Claim 8
Dependent Claim 249 words
A polygon division apparatus comprising: apex judging means for judging whether each apex of a polygon is a concave apex or a convex apex; apex number holding means for holding a total number of apexes of said polygon; detection means for detecting overlap apexes which overlap one another; first convex apex selection means for selecting one convex apex of the polygon, other than one of the overlap apexes; triangle judging means for judging whether or not another apex is present in an interior of a triangle which is formed by two sides uniting at a convex apex selected by said first convex apex selection means and a line segment interconnecting ends of said sides; triangle cutting means for cutting said triangle from said polygon, for decrementing said total number of apexes of said polygon, and for selecting another convex apex on a remaining polygon formed by cutting said triangle based on a judgement result, from said triangle judging means, indicating that no apex is present in said interior of said triangle; second convex apex selection means for selecting a different convex apex based on a judgement result, from said triangle judging means, indicating that another apex is present in said interior of said triangle; and overlap apex selection means for selecting a convex apex which includes no concave apexes and for operating a judging operation by said triangle judging means when convex apexes other than said overlap convex apexes have been sequentially selected and said polygon remains incompletely divided.
Claim 9
Dependent Claim 82 words
A polygon division method comprising the steps of: judging whether or not an apex, which has varied from a convex apex to a concave apex during every triangle cutting operation to a polygon, is present; continuing division of the polygon when judging that no apex which has varied from a convex apex to a concave apex is present; and terminating division of the polygon when judging that an apex which has varied from a convex apex to a concave apex is present.
Claim 10
Dependent Claim 82 words
A polygon division method comprising the steps of: judging whether or not an apex, which has varied from a convex apex to a concave apex during every triangle cutting operation to a polygon, is present; continuing division of the polygon when judging that no apex which has varied from a convex apex to a concave apex is present; and terminating division of the polygon when judging that an apex which has varied from a convex apex to a concave apex is present.
Claim 11
Dependent Claim 319 words
A polygon division apparatus comprising: apex judging means for judging whether each apex of a polygon is a concave apex or a concave apex; apex number holding means for holding a total number of apexes of said polygon; convex apex selection means for selecting one convex apex from among all apexes of said polygon; triangle judging means for judging whether or not another apex is present in an interior of a triangle which is formed by two sides uniting at a convex apex selected b said convex apex selection means and a line segment interconnecting ends of said sides; triangle cutting means for cutting said triangle from said polygon and for decrementing said total number of apexes of said polygon based on the judgement results, from said triangle judging means, indicating that no apex is present in said interior of said triangle; varied apex judging means for judging whether or not an apex has varied from a convex apex to a concave apex during every cutting of a triangle from said polygon; first repetition control means for repetitively operating said apex judging means, said apex number holding means, said convex apex selection means and said triangle judging means for a remaining polygon which is formed by cutting said triangle from said polygon, based on a judgement result, from said varied apex judging means, indicating that no apex is present which has varied from a convex apex to a concave apex; second repetition control means for repetitively operating said convex apex selection means and said triangle judging means based on a judgement result, from said triangle judging means, indicating that another apex is present in an interior of said triangle of said polygon; and terminating means for terminating division of said polygon based on a judgement result, from said varied apex judging means, indicating that an apex which has varied from a convex apex to a concave apex is present.
Claim 12
Dependent Claim 319 words
A polygon division apparatus comprising: apex judging means for judging whether each apex of a polygon is a concave apex or a concave apex; apex number holding means for holding a total number of apexes of said polygon; convex apex selection means for selecting one convex apex from among all apexes of said polygon; triangle judging means for judging whether or not another apex is present in an interior of a triangle which is formed by two sides uniting at a convex apex selected b said convex apex selection means and a line segment interconnecting ends of said sides; triangle cutting means for cutting said triangle from said polygon and for decrementing said total number of apexes of said polygon based on the judgement results, from said triangle judging means, indicating that no apex is present in said interior of said triangle; varied apex judging means for judging whether or not an apex has varied from a convex apex to a concave apex during every cutting of a triangle from said polygon; first repetition control means for repetitively operating said apex judging means, said apex number holding means, said convex apex selection means and said triangle judging means for a remaining polygon which is formed by cutting said triangle from said polygon, based on a judgement result, from said varied apex judging means, indicating that no apex is present which has varied from a convex apex to a concave apex; second repetition control means for repetitively operating said convex apex selection means and said triangle judging means based on a judgement result, from said triangle judging means, indicating that another apex is present in an interior of said triangle of said polygon; and terminating means for terminating division of said polygon based on a judgement result, from said varied apex judging means, indicating that an apex which has varied from a convex apex to a concave apex is present.

References Cited (Backward Citations)

EP0212774A2 Cited
US4815009A Cited
US4951227A Cited
US5129051A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1997-08-01 1998-01-31 1998-08-02 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2001-08-01 2002-01-31 2002-08-02 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2005-08-01 2006-01-31 2006-08-02 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag