Assigning a hot spot in an electronic artwork

• US 7,139,970 B2
• Filed: 04/10/1998
• Issued: 11/21/2006
• Est. Priority Date: 04/10/1998
• Status: Expired due to Term

• Current Assignee: Adobe Systems Incorporated (Adobe Inc.)
• Original Assignee: Adobe Systems Incorporated (Adobe Inc.)
• Inventors: Michaud, Jeffrey H., Olson, Douglas K.
• Primary Examiner(s): BASHORE, WILLIAM L
• Application Number:
  US09/058,496
• Publication Number:
  US 20020052891A1
• Time in Patent Office: 3,147 Days
• Field of Search: 707/501.1, 707/502, 707/503, 707/504, 707/505, 707/506, 707/507, 707/508, 707/509, 707/510, 707/511, 707/512, 707/513, 345/333, 345/332, 345/331, 345/330, 345/419, 345/357, 345629-636, 345/342, 382/180, 709/203, 715/501.1, 715/513
• US Class Current: 715/247
• CPC Class Codes: G06F 16/9577 Optimising the visualization of content, e.g. distillation of HTML documents

Abstract

Apparatus and methods implementing a technique for creating an electronic artwork with a hot area. For a selected layer of the artwork, a non-transparent region is identified and an action is assigned to an area corresponding to the non-transparent region, the action defining a function that will be activated when the area is selected. The technique is advantageous in computer application programs that composite images from layers and for producing HTML (HyperText Markup Language) output that refers to a corresponding composited image, where the action is a URL and the area is defined by an image map.

Claims

1. A method comprising:

receiving from a user an input selecting a layer in an electronic artwork having a plurality of layers, each layer including image data, the image data of the selected layer including opacity data;

using the opacity data of the selected layer to identify one or more non-transparent regions;

calculating a perimeter boundary of the one or more non-transparent regions;

using the perimeter boundary to define an area in the selected layer;

assigning an action to the area, the action defining a function that is to be activated when the area is selected; and

associating the area and the action with the selected layer as a property of the selected layer in the electronic artwork.

2. The method of claim 1, wherein:

the action is a URL (Uniform Resource Locator).

3. The method of claim 1, wherein the plurality of layers include compositing controls and the method further comprises:

compositing the plurality of layers of the artwork by combining the plurality of layers to produce a final image; and

converting the area and the action to a target output format.

4. The method of claim 3, wherein:

the target output format is HTML (HyperText Markup Language).

5. In a graphics application that supports dynamic content in layers, the method of claim 3, further comprising:

calculating any dynamic content for the selected layer when the layer is composited; and

using the calculated dynamic content to calculate the perimeter boundary and define the area.

6. The method of claim 3, further comprising:

outputting the final image as an image file; and

outputting an HTML file including an image map for the area and a URL for the action.

7. The method of claim 1, further comprising:

re-defining the area automatically if the content of the selected layer of the electronic artwork is edited, the re-defined area conforming to a new perimeter boundary of the one or more non-transparent regions.

8. The method of claim 1, wherein:

the image data in the selected layer has two or more non-contiguous non-transparent regions; and

the two or more non-contiguous non-transparent regions in combination are used to calculate the perimeter boundary.

9. The method of claim 8, further comprising:

generating multiple image maps from the non-transparent regions.

10. The method of claim 1, wherein:

defining the area further comprises automatically fitting a shape to the perimeter boundary, wherein the shape defines the area.

11. The method of claim 10, farther comprising:

receiving user input selecting the shape.

12. The method of claim 10, wherein the shape is a circle.

13. The method of claim 10, wherein the shape is a rectangle.

14. The method of claim 10, wherein the shape is a polygon.

15. The method of claim 1, wherein the perimeter boundary is for the one or more non-transparent regions in combination.

16. The method of claim 1, wherein there are one or more holes within the one or more non-transparent regions;

and

wherein the holes are ignored in calculating the perimeter boundary.

17. The method of claim 1, wherein their are one or more holes within the one or more non-transparent regions;

and

each non-transparent region that has a hole is separated into separate non-transparent regions that do not contain holes; and

the perimeter boundary is calculated from the separate hole-free non-transparent regions.

20. The computer program of claim 6, further comprising instructions to:

receive user input selecting the shape.

21. The method of claim 20, wherein the shape is a circle.

22. The method of claim 20, wherein the shape is a rectangle.

23. The method of claim 20, wherein the shape is a polygon.

18. A computer program, tangibly stored on a computer-readable medium, comprising instructions fix causing a computer to:

receive an electronic artwork having a plurality of layers, each layer including image data;

receive from a user an input selecting one of the plurality of layers, the image data of the selected layer including opacity data;

use the opacity data to identify one or more non-transparent regions in the image data;

calculate a perimeter boundary of the one or more non-transparent regions;

use the perimeter boundary to define an area in the selected layer; and

assign an action to the area, the action defining a function to be activated when the area is selected.

19. The computer program of claim 18, further comprising instructions to:

automatically fit a shape to the perimeter boundary, wherein the shape defines the area.

24. The computer program of claim 18, wherein the plurality of layers include compositing controls and the program further comprises instructions to:

composite the artwork by combining the plurality of layers to produce a final image; and

convert the area and the action to a target output format.

25. The computer program of claim 24, wherein the target output format for the area and the action is HTML.

26. The computer program of claim 25, further comprising instructions to:

write out the final image as an image file and write out an HTML file containing an image map for the area and a URL for the action, the HTML file referring to the image file.

27. The computer program of claim 24, further comprising instructions for causing a computer to:

calculate any dynamic content for the selected layer when the layer is composited; and

use the calculated dynamic content to calculate the boundary and define the area.

28. The computer program of claim 18, further comprising instructions for causing a computer to:

associate the area and the action with the selected layer as a property of the selected layer.

29. The computer program of claim 28, further comprising instructions for causing a computer to:

re-define the area automatically if the content of the selected layer of the electronic artwork is edited, the re-defined urea conforming to a new perimeter boundary of the one or more non-transparent regions.

30. The computer program of claim 18, wherein:

the image data in the selected layer has two or more non-contiguous non-transparent regions; and

the two or more non-contiguous non-transparent regions in combination are used to calculate the perimeter boundary.

31. The computer program of claim 30, further comprising instructions for causing a computer to:

generate multiple image maps from the non-transparent regions.

32. The computer program of claim 18, wherein the action is a URL (Uniform Resource Locator).

33. The computer program of claim 18, wherein the boundary is for the one or more non-transparent regions in combination.

34. The computer program of claim 18, wherein there are one or more holes within the one or more non-transparent regions;

and

wherein the holes are ignored in calculating the perimeter boundary.

35. The computer program of claim 18, Wherein there are one or more holes within the one or more non-transparent regions;

and

each non-transparent region that has a hole is separated into separate non-transparent regions that do not contain holes; and

the perimeter boundary is calculated from the separate hole-free non-transparent regions.