Uploaded image for project: 'JDK'
  1. JDK
  2. JDK-8090461

Insertion sort in OpenPisces ScanlineIterator may be very inefficient

XMLWordPrintable

    • Icon: Enhancement Enhancement
    • Resolution: Fixed
    • Icon: P4 P4
    • 10
    • fx2.0
    • javafx

      In ScanlineIterator.next() insertion sort is performed on an array consisting of almost sorted crossing points from previous edges (left part) and unsorted starting points of new edges (right part). In some very common cases (see linked issues), it just happens so that the right part is almost sorted in the reverse order thus making insertion sort very inefficient when the number of new edges is large (thousands). With rendering taking so long, application becomes totally unresponsive.

        1. TextTest.java
          2 kB
        2. TextTest.java
          1 kB

            flar Jim Graham
            omazurov Oleg Mazurov (Inactive)
            Votes:
            1 Vote for this issue
            Watchers:
            8 Start watching this issue

              Created:
              Updated:
              Resolved:
              Imported: