Steiner tree based approach for polygon fracturing
A polygonal, Steiner technique for mask data preparation that addresses low flexibility and portability
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0013] The detailed description hereinafter is given with reference to the accompanying drawings. Preferred embodiments will be described here in order to illustrate the present invention, but these preferred embodiments do not limit the scope of the present invention, which is defined by the claims. Those skilled in the art will recognize various equivalent modifications to the ensuing description.
[0014] Overview of Polygon Fracture Methods
[0015] The innovative approach described here for solving the polygon partitioning problem is based on the formalization of a variant of Steiner's minimum tree, referred to hereafter as a minimum partitioning tree (MPT). The inflection vertices of the original polygon and some additional points intersected by the candidate cutting lines and the polygon boundaries are used as end nodes of the tree. A split is obtained by constructing a specific formalized Steiner tree on these tree endpoints, whose cutting lines are suggested by th...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com