About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Abstract
We present topological walk, which is an on-line algorithm to give a walk of an arrangement. Here, a walk is a list of cells of the arrangement in which consecutive cells are adjacent to each other. The algorithm is input-sensitive; in precise, given an arrangement of n lines in a convex region which contains K cells, a walk is given in O(K+ n log n) time and O(n) working space. Further, we can efficiently solve several optimal cell finding problems applying topological walk.