# US 2024/0404139 A1 · Filling overlapping areas of a vector graphical representation using a simple graph

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

- Number: US 2024/0404139 A1
- Document ID: US20240404139A1
- Status: Published application
- Kind: A1
- Application number: 18/205,419
- Filed: 2023-06-02
- Published: 2024-12-05
- Earliest claimed: 2023-06-02
- Assignees: Adobe Inc.
- Applicants: Adobe Inc.
- Inventors: Ankit Phogat; Vishwas Jain; Vineet Batra; Souymodip Chakraborty; Kevin Wampler
- Web page: https://patentgrep.com/patent/US20240404139A1

## CPC

- G06T 11/40: Filling planar surfaces by adding surface attributes, e.g. adding colours or textures
- G06T 7/30: Determination of transform parameters for the alignment of images, i.e. image registration
- G06T 11/23: using straight lines or curves
- G06V 10/44: Local feature extraction by analysis of parts of the pattern, e.g. by detecting edges, contours, loops, corners, strokes or intersections; Connectivity analysis, e.g. of connected components
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING

## Abstract

Certain aspects and features of the present disclosure relate to receiving an input corresponding to a fill for a vector graphical representation including an overlapping area. Aspects and features further involve converting the vector graphical representation to a simple graph, and aligning contours within the simple graph to provide a unified winding number for the overlapping area. Aspects and features also involve rendering the vector graphical representation with the fill using the simple graph to include the overlapping area within the rendered representation as filled.

## Claims

### Claim 1

A method comprising:
receiving an input corresponding to a fill for a vector graphical representation, the vector graphical representation including an overlapping area;
converting the vector graphical representation to a simple graph;
aligning contours within the simple graph to provide a unified winding direction for the overlapping area; and
rendering the vector graphical representation with the fill using the simple graph to include the overlapping area within a rendered representation as filled.

### Claim 2 (depends on 1)

The method of claim 1, wherein converting the vector graphical representation to a simple graph further comprises generating a spanning tree to define edges within the vector graphical representation.

### Claim 3 (depends on 2)

The method of claim 2, wherein converting the vector graphical representation to a simple graph further comprises adding pseudo vertices to the vector graphical representation to eliminate self-edges and multiple edges from among the edges defined within the vector graphical representation.

### Claim 4 (depends on 1)

The method of claim 1, further comprising separating any self-intersecting contour into a plurality of non-self-intersecting contours.

### Claim 5 (depends on 4)

The method of claim 4, further comprising computing self-intersections to separate the self-intersecting contour into the plurality of non-self-intersecting contours.

### Claim 6 (depends on 1)

The method of claim 1, further comprising defining each contour based solely on topology of the vector graphical representation.

### Claim 7 (depends on 1)

The method of claim 1, further comprising defining the fill using at least one of a nonzero rule or an even-odd rule.

### Claim 8

A system comprising:
a memory component; and
a processing device coupled to the memory component, the processing device to perform operations comprising:
converting a vector graphical representation including an overlapping area to a simple graph configured to apply a fill;
aligning contours within the simple graph to provide a unified winding direction for the overlapping area; and
rendering the vector graphical representation with the fill using the simple graph to include the overlapping area within a rendered representation as filled.

### Claim 9 (depends on 8)

The system of claim 8, wherein the operation of converting the vector graphical representation to a simple graph further comprises an operation of generating a spanning tree to define edges within the vector graphical representation.

### Claim 10 (depends on 9)

The system of claim 9, wherein the operation of converting the vector graphical representation to a simple graph further comprises an operation of adding pseudo vertices to the vector graphical representation to eliminate self-edges and multiple edges from among the edges defined within the vector graphical representation.

### Claim 11 (depends on 8)

The system of claim 8, wherein the operations further comprise separating any self-intersecting contour into a plurality of non-self-intersecting contours.

### Claim 12 (depends on 11)

The system of claim 11, wherein the operations further comprise computing self-intersections to separate the self-intersecting contour into the plurality of non-self-intersecting contours.

### Claim 13 (depends on 8)

The system of claim 8, wherein the operations further comprise defining each contour based solely on topology of the vector graphical representation.

### Claim 14 (depends on 8)

The system of claim 8, wherein the operations further comprise defining the fill using at least one of a nonzero rule or an even-odd rule.

### Claim 15

A non-transitory computer-readable medium storing executable instructions, which when executed by a processing device, cause the processing device to perform operations comprising:
receiving an input corresponding to a fill for a vector graphical representation;
providing a simple graph corresponding to the vector graphical representation, the simple graph having a unified winding direction for an overlapping area; and
rendering the vector graphical representation with the fill using the simple graph to include the overlapping area within a rendered representation as filled.

### Claim 16 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein providing a simple graph corresponding to the vector graphical representation comprises generating a spanning tree to define edges within the vector graphical representation.

### Claim 17 (depends on 16)

The non-transitory computer-readable medium of claim 16, wherein providing a simple graph corresponding to the vector graphical representation comprises adding pseudo vertices to the vector graphical representation to eliminate self-edges and multiple edges from among the edges defined within the vector graphical representation.

### Claim 18 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein providing a simple graph corresponding to the vector graphical representation comprises separating a self-intersecting contour in the vector graphical representation into a plurality of non-self-intersecting contours.

### Claim 19 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the operations further comprise defining a contour in the vector graphical representation based solely on topology of the vector graphical representation.

### Claim 20 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the operations further comprise defining the fill using at least one of a nonzero rule or an even-odd rule.
