or
Bookmark and Share
Method and apparatus for constructing a convex polygon that encloses a set of points in a region
   
Document Number
US Patent 7002572
Issued Date
February 21, 2006
Link
Inventors
Teig; Steven (Menlo Park, CA)
Map
Abstract
Some embodiments of the invention provide a method for constructing a convex polygon that encloses a set of points in a region. This method identifies a first polygon that encloses the set of points. It then identifies a second polygon that encloses the set of points. The method then specifies the convex polygon as the intersection of the first and second polygons.
Tags:
Description:
Amusing 0%
Clever 0%
Complex 0%
Efficient 0%
Historic 0%
Important 0%
Innovative 0%
Interesting 0%
Practical 0%
Simple 0%
Number of Claims:
9
Comments:
no comments yet
Owner
Published
February 21, 2006
Application Number
10/175,390
Filed
June 19, 2002
US Classification
345/420  
Int'l Classification
G06T   17/00   (20060101)  
Examiner
Attorney/Law Firm
USPTO Field of Search
345/420   345/421   345/423   345/629   345/440   345/964   700/97   716/14   257/211  
Related Patents
7409661 - Computer-aided thermal relief pad design system and method - Owned by Hon Hai Precision Industry Co., Ltd. (Tu-Cheng, Taipei Hsien,TW)

A computer-aided thermal relief pad design system includes a depicting unit, a memory unit and a calculating unit. The depicting unit is used for depicting an elongated oval pattern of a thermal relief pad. The elongated oval pattern includes two perpendicular axes that intersect at a center point, and a plurality of terminals. The memory unit is used for storing formulae defining relationships between lengths of the two axes and coordinates of the terminals. The coordinates of the terminal define positions of the terminals relative to the center point. The calculating unit is used for calculating the coordinates of the terminals based on the formulae stored in the memory unit.

7472366 - Method and apparatus for performing a path search - Owned by Cadence Design Systems, Inc. (San Jose, CA)

Some embodiments of the invention provide a routing method. The routing method receives a set of nets to route in a region of an integrated circuit ("IC") layout. The routing method defines routes for the nets in a manner that ensures that each segment of each route is not less than a minimum length that is required for the segment. In some embodiments, the routing method identifies a route for a net by performing one or more path search operations. Each path search operation identifies one set of path expansions that can be used to define a segment of a route for the net. A path search operation in some embodiments performs a viability check for each path expansion that it identifies, in order to ensure that any segment that might eventually result from an identified set of path expansions satisfies its minimum required length.

Claims
Description
About| FAQs| Terms & Disclaimer| Link to Us| Contact Us