Patent · US Expired

System and method for robust and efficient resizing of simple polygons

US6816170B1 · kind B1 · utility

11Cited by
1References
65Claims
0Family size

Assignee

Inventor

Key dates

Filing dateFeb 22, 2002
Grant dateNov 9, 2004
Priority date
Expiry dateSep 22, 2022

Classification

  • Technology area (CPC G)Physics
  • CPC primaryG06T3/403
  • WIPO fieldComputer technology
  • WIPO sectorElectrical engineering

Abstract

A system and method are disclosed that enable robust resizing of a simple polygon in a computationally inexpensive manner. A preferred embodiment is operable to handle various resizing events that may be encountered when resizing a simple polygon, such as self-intersection, edge-collapse, and edge-split events, in order to accurately generate the correct resized polygon. Further, a preferred embodiment is operable to compute a resulting resized polygon with efficiency of O(n log n), even if one or more of the above types of events is encountered during the resizing process. Embodiments of the present invention handle resizing events for simple polygons (both convex and non-convex) without requiring construction of the straight skeleton of the polygons being resized. Also, embodiments of the present invention are operable for resizing simple polygons that may include holes.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.