Text Layout Using Path-Fill Algorithm for Arbitrary Shapes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing algorithms for laying out text around objects with arbitrary shapes in software applications are complex, time-consuming, and error-prone, as they differ significantly from well-established path-fill algorithms used for filling paths in computer graphics.
Innovation Solution
A method and system that utilize a path-fill algorithm to calculate geometric primitives for both exclusion and text regions, allowing for code reuse and efficient text placement around objects by filling exclusion regions with texture and placing text within calculated segments.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a custom text layout algorithm is developed to place text around arbitrary objects, then text placement flexibility is improved, but development time and error risk increase
Solution Approach 1:
The patent applies path-fill algorithms originally designed for computer graphics to the text layout problem, making a universal algorithm serve multiple purposes. By treating text regions as fillable paths and using existing path-fill technology, the system achieves arbitrary object text wrapping without developing a completely new algorithm, thus reducing development time while maintaining flexibility
Solution Approach 2:
The patent copies the proven path-fill algorithm approach from computer graphics into text layout processing. Instead of creating a new algorithm from scratch, it adapts the existing path-fill methodology to handle text regions, leveraging established computational geometry techniques to solve the text wrapping problem efficiently
2Adaptability or versatility
If a custom text layout algorithm is developed to place text around arbitrary objects, then text placement flexibility is improved, but implementation complexity increases
Solution Approach 1:
The patent makes a universal path-fill algorithm handle both the geometric computation of text regions and the text placement logic. By reusing the same algorithmic framework from computer graphics, the system reduces implementation complexity while achieving arbitrary shape text wrapping capability
Solution Approach 2:
The patent introduces geometric primitives as an intermediary representation between the arbitrary object shapes and the text layout process. By converting complex shapes into manageable geometric primitives through path-fill algorithms, the system simplifies the intermediate computation steps and makes the overall process more tractable
3Adaptability or versatility
If a custom text layout algorithm is developed to place text around arbitrary objects, then text wrapping capability is improved, but maintenance difficulty increases
Solution Approach 1:
The patent uses a universal path-fill algorithm that is already well-established in computer graphics, reducing maintenance burden. Since this algorithm is proven and widely used in graphics systems, any bugs or performance issues have likely been identified and resolved in other contexts, making maintenance easier than with a completely custom algorithm
Data Source
AI summary
A method for placing a text string on a page includes obtaining an electronic document identifying a margin of the page, an exclusion region having a perimeter for placement on the page, a texture to fill the exclusion region, and the text string, calculating, using a path-fill algorithm inputting the perimeter, exclusion region geometric primitives, calculating, using the path-fill algorithm inputting a path based on the perimeter and the margin, text region geometric primitives, receiving the text string and the text region geometric primitives; calculating, for a line band crossing the page, segments corresponding to an intersection of the line band with the text region geometric primitives, rendering the page by filling the exclusion region geometric primitives with the texture, and placing the text string within the segments.