Browse Prior Art Database

A method to detect non-overlapping and non self-intersecting paths using the planar arrangement of objects by using a partial selection of faces input by user.

IP.com Disclosure Number: IPCOM000205482D
Publication Date: 2011-Mar-29
Document File: 3 page(s) / 161K

Publishing Venue

The IP.com Prior Art Database

Abstract

Disclosed is a method to detect paths in a vector artwork which do not overlap with other paths and also are not self-intersecting using a planar arrangement of objects and a partial selection of faces in this planar arrangement by user. This idea enables optimization for certain cases involving the processing of objects inside the planar map.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 46% of the total text.

Page 01 of 3

A method to detect non-overlapping and non self-intersecting paths using the planar arrangement of objects by using a partial selection of faces input by user.

Title

A method to detect non-overlapping and non self-intersecting paths using the planar arrangement of objects by using a partial selection of faces input by user.

Inventor(s)/Author(s)

Gaurav Pant Vineet Batra

Summary

Disclosed is a method to detect paths in a vector artwork which do not overlap with other paths and also are not self-intersecting using a planar arrangement of objects and a partial selection of faces in this planar arrangement by user. This idea enables optimization for certain cases involving the processing of objects inside the planar map.

Background

While implementing the Shape Builder Tool in Illustrator® CS5 we had initially faced a problem that an isolated object was also affected by the merge operation when ideally it should not have been affected by the merge operation. We needed an optimization so that the objects which were not overlapping with any other object should not be affected by the merge operation (The merge operation applies the artstyle of the region where the user does mouse down hence we need to recreate the object which is an unnecessary step and also may be surprising to the user since no merge is actually performed). While doing this we need to also identify if any of the objects were self intersecting. This was necessary because a self intersecting object has multiple faces within itself hence the merge operation should be supported over there. Please refer to the Fig 1.1 -1.4 to better understand the various cases

(This page contains 00 pictures or other non-text object)

Prior Art/Solutions

• None


Page 02 of 3

A method to detect non-overlapping and non self-intersecting paths using the planar arrangement of objects by using a partial selection of faces input by user.

Description

Before we go in the details of the invention we need to understand what a planar arrangement is and a little insight into the operations available on it in the implementation in Illustrator so that we can describe the algorithm.

A planar arrangement is basically a planar graph created out of the selected objects. At any intersection of two objects a vertex is created. As in a planar graph

- Face is a region which is bounded by a set of edges.
- The outer unbounded region is also a face.

On selection of all the objects which the user wants to operate upon and then selecting the Shape Builder Tool this planar arrangement is created. As an output we get a planar paintmap. When the user drags over the selected objects one can query the selected faces from the paintmap. All the input objects are assigned some tags in the planar arrangement.

The following operations are available on a planar paint map
- From a face we can query all its edges.
- For each edge we can query all the shapes to which this edge belongs.

Other terms

ExclusiveFace- Face whose edges b...