# US 2008/0260283 A1 · Triangulating Design Data and Encoding Design Intent for Microlithographic Printing

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2008/0260283 A1
- Document ID: US20080260283A1
- Status: Published application
- Kind: A1
- Application number: 11/736,490
- Filed: 2007-04-17
- Published: 2008-10-23
- Earliest claimed: 2007-04-17
- Assignees: Micronic Laser Systems AB
- Inventors: Lars Ivansen; Anders Osterberg
- Web page: https://patentgrep.com/patent/US20080260283A1

## CPC

- G03F 7/70291: {Addressable masks, e.g. spatial light modulators [SLMs], digital micro-mirror devices [DMDs] or liquid crystal display [LCD] patterning devices}
- B82Y 10/00: Nanotechnology for information processing, storage or transmission, e.g. quantum computing or single electron logic
- B82Y 40/00: Manufacture or treatment of nanostructures
- G03F 1/68: Preparation processes not covered by groups G03F1/20 - G03F1/50
- G03F 7/70466: {Multiple exposures, e.g. combination of fine and coarse exposures, double patterning or multiple exposures for printing a single feature (stitching G03F7/70475)}
- H01J 37/3174: {Particle-beam lithography, e.g. electron beam lithography}
- G03F: PHOTOMECHANICAL PRODUCTION OF TEXTURED OR PATTERNED SURFACES, e.g. FOR PRINTING, FOR PROCESSING OF SEMICONDUCTOR DEVICES; MATERIALS THEREFOR; ORIGINALS THEREFOR; APPARATUS SPECIALLY ADAPTED THEREFOR; (phototypographic composing devices B41B; photosensitive materials or processes for photographic purposes G03C; electrophotography, sensitive layers or processes therefor G03G)
- B82Y: SPECIFIC USES OR APPLICATIONS OF NANOSTRUCTURES; MEASUREMENT OR ANALYSIS OF NANOSTRUCTURES; MANUFACTURE OR TREATMENT OF NANOSTRUCTURES
- H01J: ELECTRIC DISCHARGE TUBES OR DISCHARGE LAMPS (spark-gaps H01T; electric arc lamps H05B31/00; particle accelerators H05H)

## Abstract

The present disclosure relates to fracturing of polygon data, with one application being microlithography. In particular, it relates to preserving data regarding edges and/or vertices of the original polygons as the polygons are triangulated and even if the results of triangulation are further fractured.

## Claims

### Claim 1

A method of decomposing microlithographic pattern data and using it to produce a latent image in a radiation sensitive layer on a workpiece, the method including:
electronically receiving at least part of a microlithographic pattern;
triangulating a polygon having four or more edges from the microlithographic pattern, thereby producing a plurality of triangles that have edges that are not constrained to orientation parallel to an axis;
feeding the triangles via a datapath to an image producing subsystem that drives an image projector;
using the triangles to define an image projected by the image projector, to drive the image projector and to expose a latent image in a radiation sensitive layer on a workpiece.

### Claim 2 (depends on 1)

The method of claim 1, further including:
encoding the edges of the triangles by whether they represent a boundary between an inside and an outside the polygon, thereby producing edge encodings; and
feeding the edge encodings with the triangles to the image producing subsystem.

### Claim 3 (depends on 2)

The method of claim 2, wherein the edge encodings include a permutation of vertices of the triangles and a datum indicating how many edges represent a boundary between the inside and the outside of the polygon.

### Claim 4 (depends on 3)

The method of claim 3, wherein the datum consists of two bits, thereby encoding whether zero, one, two or three of the edges of the triangle represent a boundary between the inside and outside of the polygon.

### Claim 5 (depends on 2)

The method of claim 2, further including:
encoding vertices of the triangles by whether they represent an intersection of two segments of the boundary between the inside and the outside of the polygon, thereby producing vertex encodings; and
feeding the vertex encodings with the triangles and the edge encodings to the image producing subsystem.

### Claim 6 (depends on 3)

The method of claim 3, further including:
encoding vertices of the triangles by whether they represent an intersection of two segments of the boundary between the inside and the outside of the polygon, thereby producing vertex encodings;
wherein the vertex encodings include an additional datum that is conditional on the edge encoding and that indicates how many of and which of the vertices represent the intersection of two segments of the boundary between the inside and the outside of the polygon; and
feeding the vertex encodings with the triangles and the edge encodings to the image producing subsystem

### Claim 7 (depends on 3)

The method of claim 3, further including:
filtering the triangles to select particular triangles;
further dividing the particular triangles to produce contained triangles, wherein a particular contained triangle uses at least one vertex of the triangle that contains it and introduces at least one vertex that was not a vertex of the triangle that contains it, thereby supplanting the particular triangles; and
encoding edges of the contained triangles by whether they coincide with the edges of the containing triangles that are edge encoded as representing a boundary between the inside and the outside the polygon, thereby supplanting the edge encodings of the further triangulated particular triangles.

### Claim 8 (depends on 5)

The method of claim 5, further including:
filtering the triangles to select particular triangles;
further triangulating the particular triangles to produce contained triangles, wherein a particular contained triangle uses at least one vertex of the triangle that contains it, thereby supplanting the particular triangles;
encoding edges of the contained triangles by whether they coincide with the edges of the containing triangles that are edge encoded as representing a boundary between the inside and the outside the polygon, thereby supplanting the edge encodings of the further triangulated particular triangles; and
encoding vertices of the contained triangles by whether they coincide with the vertices edges the containing triangles that are vertex encoded as representing the intersection of two segments of the boundary between the inside and the outside of the polygon, thereby supplanting the vertex encodings of the further triangulated particular triangles.

### Claim 9 (depends on 2)

The method of claim 2, wherein the workpiece is a wafer that is being directly written, further including developing the latent image on the workpiece and further processing the workpiece to form a feature of a semiconductor device.

### Claim 10 (depends on 5)

The method of claim 5, wherein the workpiece is a wafer that is being directly written, further including developing the latent image on the workpiece and further processing the workpiece to form a feature of a semiconductor device.

### Claim 11 (depends on 2)

The method of claim 2, wherein the workpiece is a photomask, further including:
developing the latent image on the workpiece;
using the workpiece in a stepper or scanner to form a latent image on an additional radiation sensitive layer on a substrate;
developing the latent image on the substrate; and
further processing the substrate to form a feature of a semiconductor device.

### Claim 12 (depends on 5)

The method of claim 5, wherein the workpiece is a photomask, further including:
developing the latent image on the workpiece;
using the workpiece in a stepper or scanner to form a latent image on an additional radiation sensitive layer on a substrate;
developing the latent image on the substrate; and
further processing the substrate to form a feature of a semiconductor device.

### Claim 13

A system for decomposing microlithographic pattern data and creating a latent image in a radiation sensitive layer on a workpiece, the system including:
a microlithographic pattern triangulating subsystem;
a datapath coupled to the triangulating subsystem;
an image producing subsystem, coupled to the datapath;
an image projector, coupled to the image producing subsystem;
wherein the triangulating subsystem includes logic coupled to memory, the logic adapted to triangulate a polygon having four or more edges from the microlithographic pattern, thereby producing a plurality of triangles that have edges that are not constrained to orientation parallel to an axis, and output the plurality of triangles on the datapath; and
wherein the image producing subsystem is adapted to process triangles that have edges that are not constrained to orientation parallel to an axis.

### Claim 14 (depends on 13)

The system of claim 13, wherein the triangulating subsystem further includes:
second logic coupled to memory, the second logic adapted to encode the edges of the plurality of triangles by whether they represent a boundary between an inside and an outside the polygon, thereby producing edge encodings, and output the edge encodings with the plurality of triangles on the datapath.

### Claim 15 (depends on 14)

The system of claim 14, wherein the triangulating subsystem further includes:
third logic coupled to memory, the third logic adapted to encode vertices of the triangles by whether they represent an intersection of two segments of the boundary between the inside and the outside of the polygon, thereby producing vertex encodings, and output the vertex encodings with the plurality of triangles on the datapath.

### Claim 16

A method of decomposing polygons while preserving at least some information regarding edges of the polygons that represent a boundary between an inside and an outside of the polygon, the method including:
electronically receiving pattern data including the polygons;
triangulating a polygon from the pattern data, thereby producing a plurality of triangles that have edges that are not constrained to orientation parallel to an axis;
encoding the edges of the triangles by whether they represent a boundary between an inside and an outside the polygon, thereby producing edge encodings; and
feeding the edge encodings with the triangles electronically to a further processing device.

### Claim 17 (depends on 16)

The method of claim 16, wherein actions of the further processing device further include using the edge encodings to relocate the boundaries between the inside and the outside of the polygon, based upon partial reconstruction of the polygon from the triangles.

### Claim 18 (depends on 17)

The method of claim 17, wherein actions of the further processing device further include processing individual triangles of the polygon in parallel to relocate the boundaries of the polygon.

### Claim 19 (depends on 17)

The method of claim 17, further including encoding vertices that are part of the boundary of the polygon, wherein actions of the further processing device further include:
processing the encoded vertices to determine proximity to other vertices that are part of a boundary of any polygon; and
adjusting doses at the encoded vertices responsive to the proximity.

### Claim 20 (depends on 17)

The method of claim 17, wherein actions of the further processing device further include:
processing encoded vertices that are part of the boundary of the polygon to determine proximity to other polygons; and
adjusting doses at the encoded vertices responsive to the proximity.

### Claim 21 (depends on 16)

The method of claim 16, wherein actions of the further processing device further include using the edge and vertex encodings to identify an identified triangle edge that does not represent a boundary of the polygon and to treat a pair of identified triangles adjoining the identified triangle edge as sharing the identified triangle edge (that is, without gap, overlap or rounding error artifacts between the identified triangles along the shared identified edge) when calculating a gray value for a pixel that contains part of the identified triangle edge.

### Claim 22 (depends on 16)

The method of claim 16, wherein actions of the further processing device further include:
using the edge and vertex encodings to identify pixels that include only true edges that are a boundary of the polygon; and
calculating a gray value for the identified pixels without using a sub-pixel grid.

### Claim 23 (depends on 16)

The method of claim 16, wherein actions of the further processing device further include:
using the vertex encodings to identify corners of the polygon; and
enhancing printing of the identified corners.

### Claim 24 (depends on 16)

The method of claim 16, wherein edge encodings include a permutation of vertices of the triangles and a datum indicating how many edges represent a boundary between the inside and the outside of the polygon.

### Claim 25 (depends on 17)

The method of claim 17, wherein the datum consists of two bits, thereby encoding whether zero, one, two or three of the edges of the triangle represent a boundary between the inside and outside of the polygon.

### Claim 26 (depends on 16)

The method of claim 16, further including:
encoding vertices of the triangles by whether they represent an intersection of two segments of the boundary between the inside and the outside of the polygon, thereby producing vertex encodings; and
feeding the vertex encodings with the triangles and the edge encodings to the further processing device.

### Claim 27 (depends on 17)

The method of claim 17, further including:
encoding vertices of the triangles by whether they represent an intersection of two segments of the boundary between the inside and the outside of the polygon, thereby producing vertex encodings;
wherein the vertex encodings include an additional datum that is conditional on the edge encoding and that indicates how many of and which of the vertices represent the intersection of two segments of the boundary between the inside and the outside of the polygon; and
feeding the vertex encodings with the triangles and the edge encodings the further processing device.

### Claim 28 (depends on 17)

The method of claim 17, further including:
filtering the triangles to select particular triangles;
further dividing the particular triangles to produce contained triangles, wherein a particular contained triangle uses at least one vertex of the triangle that contains it and introduces at least one vertex that was not a vertex of the triangle that contains it, thereby supplanting the particular triangles; and
encoding edges of the contained triangles by whether they coincide with the edges of the containing triangles that are edge encoded as representing a boundary between the inside and the outside the polygon, thereby supplanting the edge encodings of the further triangulated particular triangles.

### Claim 29 (depends on 26)

The method of claim 26, further including:
filtering the triangles to select particular triangles;
further triangulating the particular triangles to produce contained triangles, wherein a particular contained triangle uses at least one vertex of the triangle that contains it, thereby supplanting the particular triangles;
encoding edges of the contained triangles by whether they coincide with the edges of the containing triangles that are edge encoded as representing a boundary between the inside and the outside the polygon, thereby supplanting the edge encodings of the further triangulated particular triangles; and
encoding vertices of the contained triangles by whether they coincide with the vertices edges the containing triangles that are vertex encoded as representing the intersection of two segments of the boundary between the inside and the outside of the polygon, thereby supplanting the vertex encodings of the further triangulated particular triangle.

### Claim 30

A system for fracturing polygons and encoding at least some information regarding edges of the polygons that represent a boundary between an inside and an outside of the polygon, the system including:
a polygon triangulating subsystem;
a datapath coupled to the triangulating subsystem; and
an image rendering subsystem, coupled to the datapath;
wherein the triangulating subsystem includes logic coupled to memory, the logic adapted to
triangulate a polygon having four or more edges from the microlithographic pattern, thereby producing a plurality of triangles that have edges that are not constrained to orientation parallel to an axis, and output the plurality of triangles on the datapath, and
encode the edges of the triangles by whether they represent a boundary between an inside and an outside the polygon, thereby producing edge encodings, and output the edge encodings with the plurality of triangles on the datapath; and
wherein the image rendering subsystem is adapted to process triangles that have edges that are not constrained to orientation parallel to an axis.

### Claim 31 (depends on 30)

The system of claim 30, for encoding at least some information regarding corners of polygons between segments that represent the boundary between the inside and the outside of the polygon, wherein the triangulating subsystem further includes:
second logic coupled to memory, the second logic adapted to encode vertices of the triangles by whether they represent an intersection of two segments of the boundary between the inside and the outside of the polygon, thereby producing vertex encodings, and output the vertex encodings with the plurality of triangles on the datapath.
