This repository was archived by the owner on Apr 27, 2026. It is now read-only.
Changed reading order algorithmus slightly - #118
Open
zuphilip wants to merge 1 commit into
Open
Conversation
Collaborator
Author
|
The current algorithm for the reading order is described in this paper http://www.dfki.de/web/research/publications/renameFileForDownload?filename=HighPerfDocLayoutAna.pdf&file_id=uploads_552 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This will solve #113 . I tried all examples in the test they look pretty good. But I guess we should do more tests and maybe @tmbdev can also look at this PR. I don't understand exactly the previous algorithms or the "separates" method.
The now proposed algorithm distinguishes more cases and can therefore make a (hopefully) better decision whether to look horizontally or vertically. Here are the different case which should help to understand the algorithm: